Stochastic protein folding simulation in the d-dimensional HP-model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4414 LNBI, Issue , 2007, Pages 381-394

  Stehihofel K ^a   Skaliotis, A ^a   Albrecht, A A ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONFORMATIONS; MARKOV PROCESSES; MATHEMATICAL MODELS;

MINIMUM ENERGY CONFORMATION; STOCHASTIC LOCAL SEARCH; TIME BOUND;

PROTEIN FOLDING;

EID: 34548086584     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (53)

1. Paterson, M., Przytycka, T.: On the complexity of string folding. Discrete Appl. Math. 71 (1996) 217-230.
2. Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol. 5 (1998) 27-40.
3. Nayak, A., Sinclair, A, Zwick, U.: Spatial codes and the hardness of string folding problems. J. Comput. Biol. 6 (1999) 13-36.
4. Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M.: D.P. Yee, P.D. Thomas, H.S. Chan, Principles of protein folding - A perspective from simple exact models. Protein Sci. 4 (1995) 561-602.
5. Aichholzer, O., Bremner, D., Demaine, E.D., Meijer, H., Sacristán, V., Soss, M.: Long proteins with unique optimal foldings in the H-P model. Comp. Geom.-Theor. Appl. 25 (2003) 139-159.
6. Greenberg, H.J., Hart, W.E., Lancia, G.: Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput. 16 (2004) 211-231.
7. Schiemann, R., Bachmann, M., Janke, W.: Exact sequence analysis for three-dimensional hydrophobic-polar lattice proteins. J. Chem. Phys. 122 (2005) 114705.
8. st International Colloquium on Automata, Languages and Programming, pp. 630-644. LNCS 3142, Springer-Verlag, Heidelberg, 2004.
9. Hart, W.E., Istrail, S.: Lattice and off-lattice side chain models of protein folding: Linear time structure prediction better than 86% of optimal. J. Comput. Biol. 4 (1997) 241-260
10. Heun, V. Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Appl. Math. 127 (2003) 163-177.
11. Finkelstein, A.V., Badretdinov, A.Y.: 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.
12. Bakk, A., Dommersnes, P.G., Hansen, A., Høye, J.S., Sneppen, K., Jensen, M.H.: Thermodynamics of proteins: Fast folders and sharp transitions. Comput. Phys. Commun. 147 (2002) 307-312.
13. Galzitskaya, O.V., Garbuzynskiy, S.O., Ivankov, D.N., Finkelstein, A.V.: Chain length is the main determinant of the folding rate for proteins with three-state folding kinetics. Proteins 51 (2003) 162-166.
14. Kubelka, J., Hofrichter, J., Eaton, W.A.: The protein folding 'speed limit'. Curr. Opin. Struc. Biol. 14 (2004) 76-88.
15. Zhu, Y., Fu, X., Wang, T., Tamura, A., Takada, S., Saven, J.G.: Guiding the search for a protein's maximum rate of folding. Chem. Phys. 307 (2004) 99-109.
16. Ivankov, D.N., Garbuzynskiy, S.O., Aim, E., Plaxco, K.W., Baker, D., Finkelstein, A.V.: Contact order revisited: Influence of protein size on the folding rate. Protein. Sci. 12 (2003) 2057-2062.
17. Li, M.S., Klimov, D.K., Thirumalai, D.: Thermal denaturation and folding rates of single domain proteins: size matters. Polymer 45 (2004) 573-579.
18. Li, Z., Scheraga, H.A.: Monte Carlo-minimization approach to the multiple-minima problem in protein folding. Proc. Natl. Acad. Sci. USA 84 (1987) 6611-6615.
19. Wilson, S.R., Cui, W., Moskowitz, J.W., Schmidt, K.E.: Conformational analysis of flexible molecules: Location of the global minimum energy conformation by the simulated annealing method. Tetrahedron Lett. 29 (1988) 4373-4376.
20. Kawai, H., Kikuchi, T., Okamoto, Y.: A prediction of tertiary structures of peptide by the Monte Carlo simulated annealing method, Protein Eng. 3 (1989) 85-94.
21. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220 (1983) 671-680.
22. Černý, V.: A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J. Optimiz. Theory App. 45 (1985) 41-51.
23. Paine, G.H., Scheraga, H.A.: Prediction of the native conformation of a polypeptide by a statistical-mechanical procedure. I. Backbone structure of enkephalin. Biopolymers 24 (1985) 1391-1436.
24. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21 (1953) 1087-1092.
25. Hansmann, U.H.E., Okamoto, Y.: Monte Carlo simulations in generalized ensemble: Multicanonical algorithm versus simulated tempering. Phys. Rev. E 54 (1996) 5863-5865.
26. Unger, R., Moult, J.: Genetic algorithms for protein folding simulations. J. Mol. Biol. 231 (1993) 75-81.
27. Rabow, A.A., Scheraga, H.A.: Improved genetic algorithm for the protein folding problem by use of a Cartesian combination operator. Protein Sci 5 (1996) 1800-1815.
28. Pardalos, P.M., Liu, X., Xue, G.: Protein conformation of a lattice model using tabu search. J. Global Optim. 11 (1997) 55-68.
29. Hansmann, U.H.E.: Generalized ensemble techniques and protein folding simulations, Comput. Phys. Commun. 147 (2002) 604-607.
30. Eisenmenger, F., Hansmann, U.H.E., Hayryan, S., Hu, C.K.: An enhanced version of SMMP-open-source software package for simulation of proteins. Comput. Phys. Commun. 174 (2006) 422-429.
31. Eastman, P., Grønbech-Jensen, N., Doniach, S.: Simulation of protein folding by reaction path annealing. J. Chem. Phys. 114 (2001) 3823-3841.
32. Klepeis, J.L., Pieja, M.J., Floudas, C.A.: A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids. Comput. Phys. Commun. 151 (2003) 121-140.
33. Aarts, E.H.L.: Local search in combinatorial optimization. John Wiley & Sons, New York, 1998.
34. Hajek, B.: Cooling schedules for optimal annealing. Mathem. Oper. Res. 13 (1988) 311-329.
35. Chiang, T.S., Chow, Y.Y.: A limit theorem for a class of inhomogeneous Markov processes. Ann. Probab. 17 (1989) 1483-1502.
36. Catoni, O.: Rough large deviation estimates for simulated annealing: applications to exponential schedules. Ann. Probab. 20 (1992) 1109-1146.
37. Löwe, M.: Simulated annealing with time dependent energy function via Sobolev inequalities. Stoch. Proc. Appl. 63 (1996) 221-233.
38. Locatelli, M.: Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math. Meth. Oper. Res. 54 (2001) 171-199.
39. Johnson, A.W., Jacobson, S.H.: On the convergence of generalized hill climbing algorithms. Discrete Appl. Math. 119 (2002) 37-57.
40. Chen, N., Liu, W., Feng, J.: Sufficient and necessary condition for the convergence of stochastic approximation algorithms. Stat. Probabil. Lett. 76 (2006) 203-210.
41. Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Rev. 44 (2002) 3-54.
42. Albrecht, A.A.: A stopping criterion for logarithmic simulated annealing. Computing 78 (2006) 55-79.
43. Backofen, R.: A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC). J. Discrete Algorithms 2 (2004) 161-206.
44. th Annual International Conference on Computational Biology, pp. 188-195. ACM Press, New York, 2003.
45. th Annual International Conference on Computational Biology, pp. 205-206. ACM Press, New York, 2003.
46. Blazewicz, J., Lukasiak, P., Milostan, M.: Application of tabu search strategy for finding low energy structure of protein. Artif. Intell. Med. 35 (2005) 135-145.
47. Beutler, T.C., Dill, K.A.: A fast conformational search strategy for finding low energy structures of model proteins. Protein Sci. 5 (1996) 2037-2043.
48. Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181 (1973) 223-230.
49. Neumaier, A.: Molecular modeling of proteins and mathematical prediction of protein structure. SIAM Rev. 39 (1997) 407-460.
50. th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, 2006; http://anytime.cs.umass.edu/ aimath06/
51. Eastwood, M.P., Hardin, C., Luthey-Schulten, Z., Wolynes, P.G.: Evaluating protein structure-prediction schemes using energy landscape theory. IBM J. Res. Develop. 45 (2001) 475-497.
52. Wales, D.: Energy landscapes. Cambridge University Press, Cambridge, 2003.
53. Carr, J.M., Trygubenko, S.A., Wales, D.J.: Finding pathways between distant local minima. J. Chem. Phys. 122 (2005) 234903.