Testing a new Monte Carlo Algorithm for Protein Folding

Simple item page
dc.creatorBastolla, Ugo
dc.creatorFrauenkron, Helge
dc.creatorGerstner, Erwin
dc.creatorGrassberger, Peter
dc.creatorNadler, Walter
dc.date1997-10-02
dc.date.accessioned2026-07-07T03:09:12Z
dc.date.available2026-07-07T03:09:12Z
dc.descriptionWe demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P. Grassberger, Phys. Rev. E, in press (1997)) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models for lattice heteropolymers, and compare to published Monte Carlo studies of the properties of particular sequences. In all cases our method is faster than the previous ones, and in several cases we find new minimal energy states. In addition to producing more reliable candidates for ground states, our method gives detailed information about the thermal spectrum and, thus, allows to analyze static aspects of the folding behavior of arbitrary sequences.
dc.description13 pages, RevTeX, needs epsfig.sty and multicolum.sty
dc.identifierhttps://arxiv.org/abs/cond-mat/9710030
dc.identifierhttp://arxiv.org/abs/cond-mat/9710030
dc.identifierProteins: Structure, Function, and Genetics Vol. 32 (1998) 52--66
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/27794
dc.subjectStatistical Mechanics
dc.subjectQuantitative Biology
dc.titleTesting a new Monte Carlo Algorithm for Protein Folding
dc.typetext

Files

Collections

arXiv