A new Hybrid Monte Carlo (HMC) algorithm has been developed to test protein potential functions and, ultimately, refine protein structures. The main principle of this algorithm is, in each cycle, a new trial conformation is generated by carrying out a short period of molecular dynamics (MD) iteratio
Testing a new Monte Carlo algorithm for protein folding
β Scribed by Ugo Bastolla; Helge Frauenkron; Erwin Gerstner; Peter Grassberger; Walter Nadler
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 397 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0887-3585
No coin nor oath required. For personal study only.
β¦ Synopsis
We demonstrate that the recently proposed pruned-enriched Rosenbluth method (PERM) (Grassberger, Phys. Rev. E 56:3682, 1997) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models for lattice heteropolymers, and compare it 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 one to analyze thermodynamic aspects of the folding behavior of arbitrary sequences. Pro-
π SIMILAR VOLUMES
## Abstract We present a flexible and efficient program package written in C++, PROFASI, for simulating protein folding and aggregation. The systems are modeled using an allβatom description of the protein chains with only torsional degrees of freedom, and implicit water. The program package has a
Advances in marker technology have made a dense marker map a reality. If each marker is considered separately, and separate tests for association with a disease gene are performed, then multiple testing becomes an issue. A common solution uses a Bonferroni correction to account for multiple tests pe
Monte Carlo methods have become popular for obtaining solutions to global optimization problems. One such Monte Carlo optimization technique is simulated annealing (SA). Typically in SA the parameters of the search are determined a priori. Using an aggregated, or lumped, version of SA's associated M