Relating time complexity of protein folding simulation to approximations of folding time

Finkelstein and Badretdinov [A.V. Finkelstein, A.Y. Badretdinov, Rate of protein folding near the point of thermodynamic equilibrium between the coil and the most stable chain fold, Fold. Des. 2 (1997) 115–121] approximated the folding time of protein sequences of length n by exp(λ⋅n2/3±χ⋅n1/2/2)ns, where λ and χ are constants close to unity. Recently, Fu and Wang [B. Fu, W. Wang, A 2O(n1−1/d⋅logn) time algorithm for d-dimensional protein folding in the HP-model, in: J. Daz, J. Karhumaki, A. Lepisto, D. Sannella (Eds.), Proceedings of the 31st International Colloquium on Automata, Languages and Programming, in: Lecture Notes in Comput. Sci., vol. 3142, Springer-Verlag, Heidelberg, 2004, pp. 630–644] published an exp(O(n1−1/d)⋅lnn) algorithm for d-dimensional protein folding simulation in the HP-model, which is close to the folding time approximation by Finkelstein and Badretdinov and can be seen as a justification of the HP-model for investigating general complexity issues of protein folding. We propose a stochastic local search procedure that is based on logarithmic simulated annealing. We obtain that after (m/δ)a⋅D Markov chain transitions the probability to be in a minimum energy conformation is at least 1−δ, where m⩽b(d)⋅n is the maximum neighbourhood size (b(d) small integer), a is a small constant, and D is the maximum value of the minimum escape height from local minima of the underlying energy landscape. We note that the time bound is instance-specific, and we conjecture D

[1]  Xin Liu,et al.  Protein Conformation of a Lattice Model Using Tabu Search , 1997, J. Glob. Optim..

[2]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[3]  Ulrich H. E. Hansmann,et al.  An enhanced version of SMMP - open-source software package for simulation of proteins , 2006, Comput. Phys. Commun..

[4]  Kathleen Steinhöfel,et al.  Run-time Estimates for Protein Folding Simulation in the H-P Model , 2006, AI&M.

[5]  David J Wales,et al.  Finding pathways between distant local minima. , 2005, The Journal of chemical physics.

[6]  Uri Zwick,et al.  Spatial codes and the hardness of string folding problems , 1998, SODA '98.

[7]  Andreas Alexander Albrecht,et al.  A Stopping Criterion for Logarithmic Simulated Annealing , 2006, Computing.

[8]  Stephen R. Wilson,et al.  Conformational Analysis of Flexible Molecules: Location of the Global Minimum Energy Conformation by the Simulated Annealing Method , 1988 .

[9]  Zaida Luthey-Schulten,et al.  Evaluating protein structure-prediction schemes using energy landscape theory , 2001, IBM J. Res. Dev..

[10]  Jacek Blazewicz,et al.  Application of tabu search strategy for finding low energy structure of protein , 2005, Artif. Intell. Medicine.

[11]  Harvey J. Greenberg,et al.  Opportunities for Combinatorial Optimization in Computational Biology , 2004, INFORMS J. Comput..

[12]  H A Scheraga,et al.  Improved genetic algorithm for the protein folding problem by use of a Cartesian combination operator , 1996, Protein science : a publication of the Protein Society.

[13]  Y. Okamoto,et al.  A prediction of tertiary structures of peptide by the Monte Carlo simulated annealing method. , 1989, Protein engineering.

[14]  P. Wolynes,et al.  Folding funnels and energy landscapes of larger proteins within the capillarity approximation. , 1997, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Hansmann,et al.  Monte Carlo simulations in generalized ensemble: Multicanonical algorithm versus simulated tempering. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

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

[18]  U. Hansmann.  Generalized ensemble techniques and protein folding simulations , 2002 .

[19]  José N Onuchic,et al.  Probing the kinetics of single molecule protein folding. , 2004, Biophysical journal.

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[22]  Mike Paterson,et al.  On the Complexity of String Folding , 1996, Discret. Appl. Math..

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

[24]  O. Catoni.  Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules , 1992 .

[25]  A V Finkelstein,et al.  Rate of protein folding near the point of thermodynamic equilibrium between the coil and the most stable chain fold. , 1997, Folding & design.

[26]  Jeffery G. Saven,et al.  Guiding the search for a protein's maximum rate of folding , 2004 .

[27]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[28]  J. Hofrichter,et al.  The protein folding 'speed limit'. , 2004, Current opinion in structural biology.

[29]  Rolf Backofen.  A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC) , 2004, J. Discrete Algorithms.

[30]  Wolfhard Janke,et al.  Exact sequence analysis for three-dimensional hydrophobic-polar lattice proteins. , 2004, The Journal of chemical physics.

[31]  C. Anfinsen.  Principles that govern the folding of protein chains. , 1973, Science.

[32]  Arnold Neumaier,et al.  Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure , 1997, SIAM Rev..

[33]  Dmitry N Ivankov,et al.  Chain length is the main determinant of the folding rate for proteins with three‐state folding kinetics , 2003, Proteins.

[34]  D. Thirumalai,et al.  Thermal denaturation and folding rates of single domain proteins: size matters , 2003, q-bio/0310020.

[35]  George Stell,et al.  First-passage time distribution and non-Markovian diffusion dynamics of protein folding , 2002, cond-mat/0206395.

[36]  Jin Wang,et al.  The complex kinetics of protein folding in wide temperature ranges. , 2004, Biophysical journal.

[37]  Volker Heun,et al.  Approximate protein folding in the HP side chain model on extended cubic lattices , 1999, Discret. Appl. Math..

[38]  William E. Hart,et al.  Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal , 1997, J. Comput. Biol..

[39]  H. Scheraga,et al.  Monte Carlo-minimization approach to the multiple-minima problem in protein folding. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[40]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

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

[42]  H. Scheraga,et al.  Prediction of the native conformation of a polypeptide by a statistical‐mechanical procedure. I. Backbone structure of enkephalin , 1985, Biopolymers.

[43]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[44]  John L. Klepeis,et al.  A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids , 2003 .

[45]  Sebastian Doniach,et al.  Simulation of protein folding by reaction path annealing , 2001 .

[46]  Erik D. Demaine,et al.  Long proteins with unique optimal foldings in the H-P model , 2002, Comput. Geom..

[47]  Kevin W Plaxco,et al.  Contact order revisited: Influence of protein size on the folding rate , 2003, Protein science : a publication of the Protein Society.

[48]  Ken Dill,et al.  A tabu search strategy for finding low energy structures of proteins in HP - model , 2004 .

[49]  Kim Sneppen,et al.  Thermodynamics of proteins: Fast folders and sharp transitions , 2002 .