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 β¦
New Monte Carlo algorithms for protein folding
β Scribed by Ulrich H.E. Hansmann; Yuko Okamoto
- Book ID
- 114314871
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 909 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0959-440X
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
Monte Carlo algorithms for QCD
β
Don Weingarten
π
Article
π
1989
π
Elsevier Science
π
English
β 656 KB
Comparison of Monte Carlo and genetic al
β
Ron Unger; Franc Avbelj; John Moult
π
Article
π
1993
π
Elsevier Science
π
English
β 139 KB
A new algorithm for Reverse Monte Carlo
β
da Silva, Fernando LuΔ±Μs B.; Svensson, Bo; AΜkesson, TorbjoΜrn; JoΜnsson, Bo
π
Article
π
1998
π
American Institute of Physics
π
English
β 339 KB
Protein folding, aggregation and unfoldi
β
Sandipan Mohanty; Anders IrbΓ€ck; Simon Mitternacht; Giorgio Favrin; U.H.E. Hansm
π
Article
π
2010
π
Elsevier
π
English
β 807 KB
PROFASI: A Monte Carlo simulation packag
β
Anders IrbΓ€ck; Sandipan Mohanty
π
Article
π
2006
π
John Wiley and Sons
π
English
β 202 KB
## 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