paper

A New Monte Carlo Algorithm for Protein Folding

arXiv:cond-mat/9705146 · doi:10.1103/PhysRevLett.80.3149

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.

4 pages, Latex incl. 3 eps-figs., submitted to Phys. Rev. Lett., revised version with changes in the text

References in corpus (3)

Cited by in corpus (25)