arXiv:cond-mat/9705146AbstractReferencesReviewsResources
A New Monte Carlo Algorithm for Protein Folding
Helge Frauenkron, Ugo Bastolla, Erwin Gerstner, Peter Grassberger, Walter Nadler
Published 1997-05-15, updated 1998-01-08Version 2
We demonstrate that the recently proposed pruned-enriched Rosenbluth method (P. Grassberger, Phys. Rev. E 56 (1997) 3682) leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for lattice heteropolymers, and compare to published Monte Carlo studies. In all cases our algorithms are faster than all previous ones, and in several cases we find new minimal energy states. In addition to ground states, our algorithms give estimates for the partition sum at finite temperatures.
Comments: 4 pages, Latex incl. 3 eps-figs., submitted to Phys. Rev. Lett., revised version with changes in the text
Journal: Phys. Rev. Lett. 80 (1998) 3149--3152
Categories: cond-mat.stat-mech, q-bio
Keywords: monte carlo algorithm, protein folding, simple model proteins, published monte carlo studies, minimal energy states
Tags: journal article
Related articles: Most relevant | Search more
arXiv:cond-mat/9710030 (Published 1997-10-02)
Testing a new Monte Carlo Algorithm for Protein Folding
arXiv:cond-mat/0103270 (Published 2001-03-13)
A dynamical approach to protein folding
arXiv:cond-mat/0606774 (Published 2006-06-29)
Kinetics of the Wako-Saito-Munoz-Eaton Model of Protein Folding