A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model

The protein folding problem (PFP) is an important issue in bioinformatics and biochemical physics. One of the most widely studied models of protein folding is the hydrophobic-polar (HP) model introduced by Dill. The PFP in the three-dimensional (3D) lattice HP model has been shown to be NP-complete; the proposed algorithms for solving the problem can therefore only find near-optimal energy structures for most long benchmark sequences within acceptable time periods. In this paper, we propose a novel algorithm based on the branch-and-bound approach to solve the PFP in the 3D lattice HP model. For 10 48-monomer benchmark sequences, our proposed algorithm finds the lowest energies so far within comparable computation times than previous methods.

[1]  Wen-Qi Huang,et al.  A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model , 2005, Genomics, proteomics & bioinformatics.

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

[3]  P. Grassberger,et al.  Growth algorithms for lattice heteropolymers at low temperatures , 2002, cond-mat/0208042.

[4]  Lena Jaeger,et al.  Introduction To Protein Structure , 2016 .

[5]  K. Dill,et al.  Modeling the effects of mutations on the denatured states of proteins , 1992, Protein science : a publication of the Protein Society.

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

[7]  Jun Yu,et al.  Heuristic energy landscape paving for protein folding problem in the three-dimensional HP lattice model , 2012, Comput. Biol. Chem..

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

[9]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

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

[12]  Jiaxing Cheng,et al.  Protein 3D HP model folding simulation based on ACO , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[13]  K. Dill,et al.  Cooperativity in protein-folding kinetics. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Andreas Alexander Albrecht,et al.  Stochastic protein folding simulation in the three-dimensional HP-model , 2008, Comput. Biol. Chem..

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

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[17]  Zhipeng Lü,et al.  Growth algorithm for finding low energy configurations of simple lattice proteins. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  K. Dill,et al.  ‘‘Sequence space soup’’ of proteins and copolymers , 1991 .

[19]  Andrea Tettamanzi,et al.  A Memetic Algorithm for Protein Structure Prediction in a 3D-Lattice HP Model , 2004, EvoWorkshops.

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

[21]  William E. Hart,et al.  Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials , 1997, J. Comput. Biol..