Powerful simulated‐annealing algorithm locates global minimum of protein‐folding potentials from multiple starting conformations

Protein‐folding potentials, designed with the explicit goal that the global energy minimum correspond to crystallographically observed conformations of protein molecules, may offer great promise toward calculating native protein structures. Achieving this promise, however, depends on finding an effective means of dealing with the multiple‐minimum problem inherent in such potentials. In this study, a protein‐folding‐potential test system has been developed that exhibits the properties of general protein‐folding potentials yet has a unique well‐defined global energy minimum corresponding to the crystallographically determined conformation of the test molecule. A simulated‐annealing algorithm is developed that locates the global minimum of this potential in four of eight test runs from random starting conformations. Exploration of the energy‐conformation surface of the potential indicates that it contains the numerous local minima typical of protein‐folding potentials and that the global minimum is not easily located by conventional minimization procedures. When the annealing algorithm is applied to a previously developed actual folding potential to analyze the conformation of avian pancreatic polypeptide, a new conformer is located that is lower in energy than any conformer located in previous studies using a variety of minimization techniques.