The HP model of protein folding: A challenging testing ground for Wang-Landau sampling

Abstract The hydrophobic-polar (HP) lattice protein model has gained much attention as a standard in assessing the efficiency of computational methods for protein structure prediction as well as for exploring the statistical physics of protein folding. In this work we show that Wang–Landau sampling, in connection with a suitable move set (pull moves), provides a powerful route for both the search of global energy minimum conformations and the precise determination of the density of states for HP sequences with up to 100 monomers in two and three dimensions. The main advantage of our approach lies in its general applicability to a broad range of lattice protein models that go beyond the scope of the HP model.

[1]  D. Landau,et al.  Wang-Landau algorithm for continuous models and joint density of states. , 2005, Physical review letters.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Katta G. Murty,et al.  On KΔ , 1986, Discret. Appl. Math..

[4]  D. Engelman,et al.  Membrane protein folding and oligomerization: the two-stage model. , 1990, Biochemistry.

[5]  Wolfhard Janke,et al.  DENSITY OF STATES FOR HP LATTICE PROTEINS , 2003, 0710.4074.

[6]  K. Dill,et al.  A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .

[7]  Sue Whitesides,et al.  A complete and effective move set for simplified protein folding , 2003, RECOMB '03.

[8]  Chiaki Yamaguchi,et al.  Three-dimensional antiferromagnetic q-state Potts models: application of the Wang-Landau algorithm , 2001 .

[9]  Hsiao-Ping Hsu,et al.  Growth-based optimization algorithm for lattice heteropolymers. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  D. Landau,et al.  A new approach to Monte Carlo simulations in statistical physics: Wang-Landau sampling , 2004 .

[11]  Wolfhard Janke,et al.  Thermodynamics of lattice heteropolymers. , 2003, The Journal of chemical physics.

[12]  David P. Landau,et al.  Determining the density of states for classical statistical models by a flat-histogram random walk☆ , 2002 .

[13]  Frank Thomson Leighton,et al.  Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete , 1998, RECOMB '98.

[14]  George Chikenji,et al.  Simulation of Lattice Polymers with Multi-Self-Overlap Ensemble , 1998 .

[15]  H S Chan,et al.  Modeling protein density of states: Additive hydrophobic effects are insufficient for calorimetric two‐state cooperativity , 2000, Proteins.

[16]  W. Wong,et al.  Evolutionary Monte Carlo for protein folding simulations , 2001 .

[17]  K. Dill,et al.  Modeling compact denatured states of proteins. , 1994, Biochemistry.

[18]  K Yue,et al.  Forces of tertiary structural organization in globular proteins. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[19]  D. Landau,et al.  Determining the density of states for classical statistical models: a random walk algorithm to produce a flat histogram. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Athanassios Z Panagiotopoulos,et al.  Generalization of the Wang-Landau method for off-lattice simulations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  D. Landau,et al.  Efficient, multiple-range random walk algorithm to calculate the density of states. , 2000, Physical review letters.

[22]  K. Dill.  Theory for the folding and stability of globular proteins. , 1985, Biochemistry.

[23]  D. Yee,et al.  Principles of protein folding — A perspective from simple exact models , 1995, Protein science : a publication of the Protein Society.

[24]  Alan D. Sokal,et al.  Nonergodicity of local, length-conserving Monte Carlo algorithms for the self-avoiding walk , 1987 .

[25]  T. Dandekar,et al.  Improving genetic algorithms for protein folding simulations by systematic crossover. , 1999, Bio Systems.

[26]  A. Sokal,et al.  The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk , 1988 .

[27]  K. Binder.  Monte Carlo and molecular dynamics simulations in polymer science , 1995 .

[28]  Walter Nadler,et al.  Testing a new Monte Carlo algorithm for protein folding , 1998 .

[30]  Jun S. Liu,et al.  Biopolymer structure simulation and optimization via fragment regrowth Monte Carlo. , 2007, The Journal of chemical physics.

[31]  R Unger,et al.  Genetic algorithms for protein folding simulations. , 1992, Journal of molecular biology.

[32]  K. Dill,et al.  A fast conformational search strategy for finding low energy structures of model proteins , 1996, Protein science : a publication of the Protein Society.

[33]  J. Skolnick,et al.  Reduced models of proteins and their applications , 2004 .

[34]  Mihalis Yannakakis,et al.  On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[35]  Wolfhard Janke,et al.  Multicanonical chain-growth algorithm. , 2003, Physical review letters.

[36]  Caldarelli,et al.  Putting proteins back into water , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[37]  F Seno,et al.  Simple model to study insertion of a protein into a membrane. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[38]  J. Pekny,et al.  A dynamic Monte Carlo algorithm for exploration of dense conformational spaces in heteropolymers , 1997 .

[39]  Wing Hung Wong,et al.  A study of density of states and ground states in hydrophobic-hydrophilic protein folding models by equi-energy sampling. , 2006, The Journal of chemical physics.

[40]  George Chikenji,et al.  MULTI-SELF-OVERLAP ENSEMBLE FOR PROTEIN FOLDING : GROUND STATE SEARCH AND THERMODYNAMICS , 1999, cond-mat/9903003.