CGU: An Algorithm for Molecular Structure Prediction

  • K. A. Dill
  • A. T. Phillips
  • J. B. Rosen
Part of the The IMA Volumes in Mathematics and its Applications book series (IMA, volume 94)


A global optimization method is presented for predicting the minimum energy structure of small protein-like molecules. This method begins by collecting a large number of molecular conformations, each obtained by finding a local minimum of a potential energy function from a random starting point. The information from these conformera is then used to form a convex quadratic global underestimating function for the potential energy of all known conformers. This underestimator is an L1 approximation to all known local minima, and is obtained by a linear programming formulation and solution. The minimum of this underestimator is used to predict the global minimum for the function, allowing a localized conformer search to be performed based on the predicted minimum. The new set of conformers generated by the localized search serves as the basis for another quadratic underestimation step in an iterative algorithm. This algorithm has been used to predict the minimum energy structures of heteropolymers with as many as 48 residues, and can be applied to a variety of molecular models. The results obtained also show the dependence of the native conformation on the sequence of hydrophobic and polar residues.


Global Minimum Ramachandran Plot Potential Energy Function Global Optimization Algorithm Global Optimization Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.A. Dill, Dominant Forces in Protein Folding, Biochemistry 29 (1990), 7133–7155.CrossRefGoogle Scholar
  2. [2]
    K.A. Dill, A.T. Phillips, and J.B. Rosen, Molecular Structure Prediction by Global Optimization, Journal of Global Optimization, in press (1996).Google Scholar
  3. [3]
    D.A. Hinds and M. Levitt, Exploring Conformational Space with a Simple Lattice Model for Protein Structure, Journal of Molecular Biology 243 (1994), 668–682.CrossRefGoogle Scholar
  4. [4]
    A.L. Lehninger, Biochemistry: The Molecular Basis of Cell Structure and Function, Worth Publishers, New York, 1970.Google Scholar
  5. [5]
    M. Levitt and A. Warshel, Computer Simulation of Protein Folding, Nature 253 (1975), 694–698.CrossRefGoogle Scholar
  6. [6]
    C.D. Maranas, I.P. Androulakis, and C.A. Floudas, A Deterministic Global Optimization Approach for the Protein Folding Problem, Dimacs Series in Discrete Mathematics and Theoretical Computer Science, (1995), 133–150.Google Scholar
  7. [7]
    S. Miyazawa and R.L. Jernigan, A New Substitution Matrix for Protein Sequence Searches Based on Contact Frequencies in Protein Structures, Protein Engineering 6 (1993), 267–278.CrossRefGoogle Scholar
  8. [8]
    A. Monge, R.A. Friesner, and B. Honig, An Algorithm to Generate Low-Resolution Protein Tertiary Structures from Knowledge of Secondary Structure, Proceedings of the National Academy of Sciences USA 91 (1994), 5027–5029.CrossRefGoogle Scholar
  9. [9]
    A.T. Phillips, J.B. Rosen, and V.H. Walke, Molecular Structure Determination by Convex Global Underestimation of Local Energy Minima, Dimacs Series in Discrete Mathematics and Theoretical Computer Science 23 (1995), 181–198.Google Scholar
  10. [10]
    J. Skolnick and A. Kolinski, Simulations of the Folding of a Globular Protein, Science 250 (1990), 1121–1125.CrossRefGoogle Scholar
  11. [11]
    R. Srinivasan and G.D. Rose, LINUS: A Hierarchic Procedure to Predict the Fold of a Protein, PROTEINS: Structure, Function, and Genetics 22 (1995), 81–99.CrossRefGoogle Scholar
  12. [12]
    S. Sun, Reduced representation model of protein structure prediction: statistical potential and genetic algorithms, Protein Science 2 (1993), 762–785.CrossRefGoogle Scholar
  13. [13]
    S. Sun, P.D. Thomas, and K.A. Dill, A Simple Protein Folding Algorithm using a Binary Code and Secondary Structure Constraints, Protein Engineering 8 (1995), 769–778.CrossRefGoogle Scholar
  14. [14]
    K. Yue, K.M. Fiebig, P.D. Thomas, H.S. Chan, E.I. Shakhnovich, and K.A. Dill, A Test of Lattice Protein Folding Algorithms, Proceedings of the National Academy of Sciences USA 92 (1995), 325–329.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • K. A. Dill
    • 1
  • A. T. Phillips
    • 2
  • J. B. Rosen
    • 3
  1. 1.Department of Pharmaceutical ChemistryUniversity of California, San FranciscoSan FranciscoUSA
  2. 2.Computer Science DepartmentUnited States Naval AcademyAnnapolisUSA
  3. 3.Computer Science and Engineering DepartmentUniversity of California San DiegoSan DiegoUSA

Personalised recommendations