Two local search methods for protein folding simulation in the HP and the MJ lattice models

Communications in Computer and Information Science

Volumn 13, Issue , 2008, Pages 167-179

  Kapsokalivas, L ^a   Gan, X ^a   Albrecht, A ^b   Steinhofel K ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BIOINFORMATICS; BIRDS; INTELLIGENT SYSTEMS; LOCAL SEARCH (OPTIMIZATION); SIMULATED ANNEALING;

BENCH-MARK PROBLEMS; COOLING SCHEDULE; ENERGY LANDSCAPE; GUIDED LOCAL SEARCH; LOCAL SEARCH METHOD; OBJECTIVE FUNCTIONS; OPTIMUM SOLUTION; PROTEIN FOLDING SIMULATION;

MONTE CARLO METHODS;

EID: 84885728093     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-70600-7_13     Document Type: Article

References (41)

1. Campbell, P.N., Smith, A.D., Peters, T.J.: Biochemistry Illustrated: Biochemistry and Molecular Biology in the Psost-genomic Era. 5th edn., Churchill Livingstone, Edinburgh (2005)
2. Anfinsen, C.B.: Principles that govern the folding of protein chains. Science 181, 223-230 (1973)
3. Levinthal, C.: Are there pathways for protein folding? J. de Chimie Physique et de Physico-Chimie Biologique 65, 44-45 (1968)
4. Govindarajan, S., Goldstein, R.A.: On the thermodynamic hypothesis of protein folding. Proc. Natl. Acad. Sci. USA 95, 5545-5549 (1998)
5. Greenberg, H.J., Hart, W.E., Lancia, G.: Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput. 16, 211-231 (2004)
6. Paterson, M., Przytycka, T.: On the complexity of string folding. Discrete Appl. Math. 71, 217-230 (1996)
7. Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol. 5, 27-40 (1998)
8. Saibil, H.R., Ranson, N.A.: The chaperonin folding machine. Trends Biochem. Sci. 27, 627-632 (2002)
9. Spiess, C., Meyer, A.S., Reissmann, S., Frydman, J.: Mechanism of the eukaryotic chaperonin: protein folding in the chamber of secrets. Trends Cell Biol. 14, 598-604 (2004)
10. Homer, S., Selman, A.L.: Computability and Complexity Theory. Springer, New York (2001)
11. Zahrani, M.S., Loomes, M.J., Malcolm, J.A., Ullah, A.Z.M.D., Steinhöfel, K., Albrecht, A.A.: Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing. Comput. Oper. Res. 35, 2049-2070 (2008)
12. th World Congress on Intelligent Control and Automation., vol. 3, pp. 1822-1826 (2002)
13. Rogers, A., Prügel-Bennett, A., Jennings, N.R.: Phase transitions and symmetry breaking in genetic algorithms with crossover. Theor. Comput. Sci. 358, 121-141 (2006)
14. Steinhöfel, K., Skaliotis, A., Albrecht, A.A.: Stochastic Protein Folding Simulation in the d-dimensional HP-Model. In: Hochreiter, S., Wagner, R. (eds.) BIRD 2007. LNCS (LNBI), vol. 4414, pp. 381-394. Springer, Heidelberg (2007)
15. Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M., Yee, D.P., Thomas, P.D., Chan, H.S.: Principles of protein folding-A perspective from simple exact models. Protein Sci. 4, 561-602 (1995)
16. Miyazawa, S., Jernigan, R.L.: Estimation of effective interresidue contact energies from protein crystal structures: quasi-chemical approximation. Macromolecules 18, 534-552 (1985)
17. th Annual International Conference on Computational Biology, pp. 188-195. ACM Press, New York (2003)
18. th Annual International Conference on Computational Biology, pp. 205-206. ACM Press, New York (2003)
19. Blazewicz, J., Lukasiak, P., Milostan, M.: Application of tabu search strategy for finding low energy structure of protein. Artif. Intell. Med. 35, 135-145 (2005)
20. Unger, R., Moult, J.: Genetic algorithms for protein folding simulations. J. Mol. Biol. 231, 75-81 (1993)
21. Faisca, P., Plaxco, K.: Cooperativity and the origins of rapid, single-exponential kinetics in protein folding. Protein Sci. 15, 1608-1618 (2006)
22. Shakhnovich, E.I.: Protein design: a perspective from simple tractable models. Fold. Design 3, R45-R58 (1998)
23. Fan, K., Wang, W.: What is the minimum number of letters required to fold a protein? J. Mol. Biol. 328, 921-926 (2003)
24. Li, H., Tang, C., Wingreen, N.S.: Designability of protein structures: a lattice-model study using the Miyazawa-Jernigan matrix. PROTEINS: Structure, Function, and Genetics 49, 403-412 (2002)
25. Shell, M.S., Debenedetti, P.G., Panagiotopoulos, A.Z.: Computational characterization of the sequence landscape in simple protein alphabets. PROTEINS: Structure, Function, and Bioinformatics 62, 232-243 (2006)
26. Mirny, L.A., Shakhnovich, E.I.: Protein structure prediction by threading. why it works and why it does not. J. Mol. Biol. 283, 507-526 (1998)
27. Khimasia, M., Coveney, P.: Protein structure prediction as a hard optimization problem: The genetic algorithm approach. Mol. Sim. 19, 205-226 (1997)
28. Konig, R., Dandekar, T.: Improving genetic algorithms for protein folding simulations by systematic crossover. Biosystems 50, 17-25 (1999)
29. Cotta, C.: Protein structure prediction using evolutionary algorithms hybridized with backtracking. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2687, pp. 321-328. Springer, Heidelberg (2003)
30. th International Conference on Genetic Algorithms, pp. 574-581. ACM Press, New York (1995)
31. Hoque, M.T., Chetty, M., Dooley, L.S.: A new guided genetic algorithm for 2D hydrophobic-hydrophilic model to predict protein folding. In: IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, pp. 259-266 (2005) ISBN 0-7803-9364-3
32. Liang, F., Wong, W.H.: Evolutionary Monte Carlo for protein folding simulations. J. Chem. Phys. 115, 3374-3380 (2001)
33. Liang, F., Wong, W.H.: Protein folding simulations of the hydrophobic-hydrophilic model by combining tabu search with genetic algorithms. J. Chem. Phys. 119, 4592-4596 (2003)
34. Hsu, H.P., Mehra, V., Nadler, W., Grassberger, P.: Growth-based optimization algorithm for lattice heteropolymers. Phys. Rev. E 68, 21113 (2003)
35. Zhang, J.L., Liu, J.S.: A new sequential importance sampling method and its application to the two-dimensional hydrophobic-hydrophilic model. J. Chem. Phys. 117, 3492-3498 (2002)
36. Shmygelska, A., Hoos, H.: An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem. BMC Bioinformatics 6 (2005)
37. Thachuk, C., Shmygelska, A., Hoos, H.: A replica exchange Monte Carlo algorithm for protein folding in the HP model. BMC Bioinformatics 8 (2007)
38. Steinhöfel, K., Skaliotis, A., Albrecht, A.A.: Relating Time Complexity of Protein Folding Simulation to Approximations of Folding Time. Comp. Phys. Comm. 176, 465-470 (2007)
39. Shakhnovich, E.I., Gutin, A.M.: Engineering of stable and fast-folding sequences of model proteins. Proc. Natl. Acad. Sci. USA 90, 7195-7199 (1993)
40. Landau, D.P., Binder, K.A.: A guide to Monte Carlo simulations in statistical physics, pp. 122-123. Cambridge University Press, Cambridge (2000)
41. Wyman, J., Allen, D.W.: The problem of the heme interactions in hemoglobin and the basis of the Bohr effect. J. Polym. Sci. 7, 499-518 (1951)