Evolutionary Monte Carlo for protein folding simulations

We demonstrate that evolutionary Monte Carlo (EMC) can be applied successfully to simulations of protein folding on simple lattice models, and to finding the ground state of a protein. In all cases, EMC is faster than the genetic algorithm and the conventional Metropolis Monte Carlo, and in several cases it finds new lower energy states. We also propose one method for the use of secondary structures in protein folding. The numerical results show that it is drastically superior to other methods in finding the ground state of a protein.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  A. W. Rosenbluth,et al.  MONTE CARLO CALCULATION OF THE AVERAGE EXTENSION OF MOLECULAR CHAINS , 1955 .

[3]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[4]  D. Wetlaufer.  Nucleation, rapid folding, and globular intrachain regions in proteins. , 1973, Proceedings of the National Academy of Sciences of the United States of America.

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  H. Scheraga,et al.  A Method for Predicting Nucleation Sites for Protein Folding Based on Hydrophobic Contacts , 1978 .

[7]  T. Creighton,et al.  Experimental studies of protein folding and unfolding. , 1978, Progress in biophysics and molecular biology.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  K. Dill.  Theory for the folding and stability of globular proteins. , 1985, Biochemistry.

[10]  H. Scheraga,et al.  Monte Carlo-minimization approach to the multiple-minima problem in protein folding. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[13]  P. S. Kim,et al.  Intermediates in the folding reactions of small proteins. , 1990, Annual review of biochemistry.

[14]  K. Dill,et al.  Theory for protein mutability and biogenesis. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[15]  K. Dill,et al.  ‘‘Sequence space soup’’ of proteins and copolymers , 1991 .

[16]  G. Crippen.  Prediction of protein folding from amino acid sequence over discrete conformation spaces. , 1991, Biochemistry.

[17]  Berg,et al.  Multicanonical ensemble: A new approach to simulate first-order phase transitions. , 1992, Physical review letters.

[18]  K. Dill,et al.  Folding kinetics of proteins and copolymers , 1992 .

[19]  G. Parisi,et al.  Simulated tempering: a new Monte Carlo scheme , 1992, hep-lat/9205018.

[20]  R Unger,et al.  Genetic algorithms for protein folding simulations. , 1992, Journal of molecular biology.

[21]  Hue Sun Chan,et al.  Energy landscapes and the collapse dynamics of homopolymers , 1993 .

[22]  Lee,et al.  New Monte Carlo algorithm: Entropic sampling. , 1993, Physical review letters.

[23]  K. Dill,et al.  Cooperativity in protein-folding kinetics. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[24]  M. Karplus,et al.  How does a protein fold? , 1994, Nature.

[25]  Scott Wilson.  The Protein Folding Problem and Tertiary Structure Prediction , 1994, Birkhäuser Boston.

[26]  Hesselbo,et al.  Monte Carlo simulation and global optimization without parameters. , 1995, Physical review letters.

[27]  K. Hukushima,et al.  Exchange Monte Carlo Method and Application to Spin Glass Simulations , 1995, cond-mat/9512035.

[28]  J. Pekny,et al.  A dynamic Monte Carlo algorithm for exploration of dense conformational spaces in heteropolymers , 1997 .

[29]  P. Grassberger.  Pruned-enriched Rosenbluth method: Simulations of θ polymers of chain length up to 1 000 000 , 1997 .

[30]  Long range moves for high density polymer simulations , 1997, cond-mat/9610116.

[31]  B. Berger,et al.  Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete , 1998, J. Comput. Biol..

[32]  Mihalis Yannakakis,et al.  On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[33]  P. Grassberger,et al.  Testing a new Monte Carlo algorithm for protein folding , 1997, Proteins.

[34]  Walter Nadler,et al.  Testing a new Monte Carlo algorithm for protein folding , 1998 .

[35]  U H Hansmann,et al.  New Monte Carlo algorithms for protein folding. , 1999, Current opinion in structural biology.

[36]  T. Dandekar,et al.  Improving genetic algorithms for protein folding simulations by systematic crossover. , 1999, Bio Systems.