arXiv · cond-mat/9705146
A New Monte Carlo Algorithm for Protein Folding
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Helge Frauenkron, Ugo Bastolla, Erwin Gerstner, Peter Grassberger, Walter Nadler. 1998-01-08. A New Monte Carlo Algorithm for Protein Folding. https://doi.org/10.1103/physrevlett.80.3149. https://searcharxiv.com/abs/cond-mat/9705146
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.