A New Monte Carlo Algorithm for Protein Folding

Preprint

15 May 1997

preprint
Published by arXiv in arXiv

Abstract

We demonstrate that the recently proposed pruned-enriched Rosenbluth method (P. Grassberger, preprint (1996)) 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.

Keywords

EFFICIENT ALGORITHMS
PROTEIN FOLDING
PRUNED ENRICHED
PROPOSED PRUNED
CARLO ALGORITHM
MONTE CARLO
NEW MINIMAL
NEW MONTE
MODELS

All Related Versions

Version 1, 1997-05-15, ArXiv
Version 2, 1998-01-08, ArXiv
Version 1, 1997-10-02, ArXiv (Unconfirmed version)
Published version: Physical Review Letters, 80 (14), 3149.

This publication has 0 references indexed in Scilit: