An Adaptive Branch-and-Bound Minimization Method Based on Dynamic Programming

  • Sandor Vajda
  • Charles Delisi


Computational studies are potentially useful for analyzing various putative mechanisms of protein folding. The general question that can be addressed is whether or not it is possible to obtain native-like conformations of a protein on the basis of a well-defined set of physical and chemical principles. In particular, computation is the only tool available for studying the relations between native protein structures and the conformations that correspond to various free energy minima (Skolnick and Kolinski, 1989; Chan and Dill, 1993). If the “thermodynamic hypothesis” is valid and the free-energy evaluation is of acceptable accuracy, then the native structure can be identified in principle by systematic evaluation of the energy of every possible conformation. However, using a detailed model of protein geometry and a force field of near-atomic resolution, we are at present unable to explore the conformational space even for the smallest proteins.


Dynamic Programming Global Minimum Optimal Path Configuration Space Conformational State 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bellman R (1975): Dynamic Programming. Princeton: Princeton University PressGoogle Scholar
  2. Bernstein F, Koetzle T, Williams G, Meyer E, Brice M, Rodgers J, Kennard O, Shimanoushi T, Tasumi M (1977): The protein data bank: A computer-based archival file for macromolecular structures. J Mol Biol 112:535–542PubMedCrossRefGoogle Scholar
  3. Brower R, Vasmatzis G, Silverman M, DeLisi C (1993): Exhaustive conformational search and simulated annealing for models of lattice peptides. Biopolymers 33:329–334PubMedCrossRefGoogle Scholar
  4. Bruccoleri RE, Karplus M (1987): Prediction of the folding of short Polypeptide segments by uniform conformational sampling. Biopolymers 26:137–168PubMedCrossRefGoogle Scholar
  5. Chan HS, Dill KA (1991): Polymer principles in protein structure and stability. Ann Rev Biophys Biophys Chem 20:447–490CrossRefGoogle Scholar
  6. Chan HS, Dill KA (1993): The protein folding problem. Phys Today 2:24–32CrossRefGoogle Scholar
  7. Covell DG, Jernigan RL (1990): Conformations in folded proteins in restricted spaces. Biochemistry 29:3287–3294PubMedCrossRefGoogle Scholar
  8. Crippen GM (1991): Prediction of protein folding from amino acid sequence over discrete conformational spaces. Biochemistry 30:4232–4237.PubMedCrossRefGoogle Scholar
  9. Dill KA, Fiebig K, Chan SH (1993): Cooperativity in protein-folding kinetics. Proc Natl Acad Sci USA 90:1942–1946PubMedCrossRefGoogle Scholar
  10. Go N, Taketomi H (1978): Respective roles of short-and long-range interactions in protein folding. Proc Natl Acad Sci USA 75:559–563PubMedCrossRefGoogle Scholar
  11. Horowitz E, Sahni S (1979): Fundamentals of Computer Algorithms. Rockville: Science Press.Google Scholar
  12. Hu, TC (1982): Combinatorial Algorithms. Reading, MA: Addison-Wesley.Google Scholar
  13. Kirkpatrick S, Gellatt CD, Vecchi MP (1983): Optimization by simulated annealing. Science 220:671–680PubMedCrossRefGoogle Scholar
  14. Lau KF, Dill KA (1989): A lattice statistical mechanics model of the conformational and sequence space in proteins. Macromolecules 13:3986–3997CrossRefGoogle Scholar
  15. Lipton M, Still WC (1988): The multiple minima problem in molecular modeling. Tree searching internal coordinate conformational space. J Comp Chem 9:343–355CrossRefGoogle Scholar
  16. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953): Equations of state calculations by fast computing machines. J Chem Phys 21:1087–1092CrossRefGoogle Scholar
  17. Moult J, James MNG (1986): An algorithm for determining the conformation of Polypeptide segments in proteins by systematic search. Proteins 1:146–163.PubMedCrossRefGoogle Scholar
  18. Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1986): Numerical Recipes.Cambridge: Cambridge University Press.Google Scholar
  19. Rooman MJ, Kocher J-PA, Wodak SJ (1991): Prediction of protein backbone conformation based on seven structure assignments. J Mol Biol 221:961–979PubMedCrossRefGoogle Scholar
  20. Shaknovich E, Farztdinov G, Gutin AM, Karplus M (1991): Protein folding bottlenecks: a lattice Monte-Carlo simulation. Phys Rev Lett 67:1665–1668CrossRefGoogle Scholar
  21. Shortle D, Chan HS, Dill K (1992): Modeling the effects of mutations on the denatured states of proteins. Protein Science 1:201–215PubMedCrossRefGoogle Scholar
  22. Sikorski A, Skolnick J (1989): Monte Carlo studies of equilibrium globular protein folding, α-helical bundles with long loops. Proc Natl Acad Sci USA 86:2668–2672PubMedCrossRefGoogle Scholar
  23. Skolnick J, Kolinski A (1989): Computer simulations of globular protein folding and tertiary structure. Annu Rev Phys Chem 40:207–205PubMedCrossRefGoogle Scholar
  24. Skolnick J, Kolinski A (1990): Simulations of the folding of a globular protein. Science 250:1121–1125PubMedCrossRefGoogle Scholar
  25. Taketomi H, Kano F, Go N (1988): The effect of amino acid substitution on proteinfolding and-unfolding transition studied by computer simulation. Biopolymers 27:527–559PubMedCrossRefGoogle Scholar
  26. Unger R, Moult J (1993): Genetic algorithms for protein folding simulations. J Mol Biol 231:75–81PubMedCrossRefGoogle Scholar
  27. Vajda S, DeLisi C (1990): Determining minimum energy conformations of Polypeptides by dynamic programming. Biopolymers 29:1755–1772PubMedCrossRefGoogle Scholar
  28. Vajda S, Jafri MS, Sezerman U, DeLisi C (1993): Necessary conditions for avoiding incorrect Polypeptide folds in conformational search by energy minimization. Biopolymers 33:173–192PubMedCrossRefGoogle Scholar

Copyright information

© Birkhäuser Boston 1994

Authors and Affiliations

  • Sandor Vajda
  • Charles Delisi

There are no affiliations available

Personalised recommendations