Growth Algorithms for Lattice Heteropolymers at Low Temperatures

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 9 figures. J. Chem. Phys., in press

Scientific paper

10.1063/1.1522710

Two improved versions of the pruned-enriched-Rosenbluth method (PERM) are proposed and tested on simple models of lattice heteropolymers. Both are found to outperform not only the previous version of PERM, but also all other stochastic algorithms which have been employed on this problem, except for the core directed chain growth method (CG) of Beutler & Dill. In nearly all test cases they are faster in finding low-energy states, and in many cases they found new lowest energy states missed in previous papers. The CG method is superior to our method in some cases, but less efficient in others. On the other hand, the CG method uses heavily heuristics based on presumptions about the hydrophobic core and does not give thermodynamic properties, while the present method is a fully blind general purpose algorithm giving correct Boltzmann-Gibbs weights, and can be applied in principle to any stochastic sampling problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Growth Algorithms for Lattice Heteropolymers at Low Temperatures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Growth Algorithms for Lattice Heteropolymers at Low Temperatures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Growth Algorithms for Lattice Heteropolymers at Low Temperatures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-441876

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.