A tabu search strategy for finding low energy structures of proteins in HP - model

HP-model is one of the most successful and well-studied simplified lattice models of protein folding. It uses mathematical abstraction of proteins for hiding many aspects of the folding process and works as hypothesis generator. Due to the NP-hardness results of the protein folding problem many approximation algorithms, have been used to solve it. In the paper, the method for finding low energy conformations of proteins, based on the tabu search strategy, has been proposed. The algorithm has been extensively tested and the tests showed its very good performance.

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

[2]  William E. Hart,et al.  Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal , 1995, STOC '95.

[3]  F. Glover.  Tabu Search Fundamentals and Uses , 1995 .

[4]  Mihalis Yannakakis,et al.  On the complexity of protein folding (abstract) , 1998, RECOMB '98.

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

[6]  William E. Hart,et al.  Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal , 1996, J. Comput. Biol..

[7]  C. Levinthal.  Are there pathways for protein folding , 1968 .

[8]  E. O'Toole,et al.  Monte Carlo simulation of folding transitions of simple model proteins using a chain growth algorithm , 1992 .

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

[10]  Joe Marks,et al.  Computational Complexity, Protein Structure Prediction, and the Levinthal Paradox , 1994 .

[11]  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.

[12]  C. Anfinsen,et al.  The kinetics of formation of native ribonuclease during oxidation of the reduced polypeptide chain. , 1961, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Yue,et al.  Sequence-structure relationships in proteins and copolymers. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[15]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[16]  E I Shakhnovich,et al.  A test of lattice protein folding algorithms. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[17]  K. Dill.  Polymer principles and protein folding , 1999, Protein science : a publication of the Protein Society.

[18]  Ron Unger,et al.  Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications , 1993 .

[19]  S. Toma,et al.  Contact interactions method: A new algorithm for protein folding simulations , 1996, Protein science : a publication of the Protein Society.

[20]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

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

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

[23]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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