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 Ca
β¦ LIBER β¦
Comparison of Monte Carlo and genetic algorithm methods for folding peptides
β Scribed by Ron Unger; Franc Avbelj; John Moult
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 139 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0263-7855
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Testing a new Monte Carlo algorithm for
β
Ugo Bastolla; Helge Frauenkron; Erwin Gerstner; Peter Grassberger; Walter Nadler
π
Article
π
1998
π
John Wiley and Sons
π
English
β 397 KB
π 1 views
Comparison of Monte Carlo calculation me
β
Yasunobu Nagaya; Go Chiba; Takamasa Mori; Dwi Irwanto; Ken Nakajima
π
Article
π
2010
π
Elsevier Science
π
English
β 500 KB
A comparison of two Monte Carlo methods
β
G.W Cunningham; P.H.E Meuer
π
Article
π
1976
π
Elsevier Science
π
English
β 719 KB
A benchmark comparison of Monte Carlo pa
β
Patrick S. Brantley
π
Article
π
2011
π
Elsevier Science
π
English
β 818 KB
A comparison of generalized hybrid Monte
β
Elena Akhmatskaya; Nawaf Bou-Rabee; Sebastian Reich
π
Article
π
2009
π
Elsevier Science
π
English
β 445 KB
The generalized hybrid Monte Carlo (GHMC) method combines Metropolis corrected constant energy simulations with a partial random refreshment step in the particle momenta. The standard detailed balance condition requires that momenta are negated upon rejection of a molecular dynamics proposal step. T
Comparison between performances of Monte
β
Gokmen Demirkaya; Faruk ArinΓ§; Nevin SelΓ§uk; Isil Ayranci
π
Article
π
2005
π
Elsevier Science
π
English
β 318 KB