Memory-based local search for simplified protein structure prediction

Protein structure prediction is one of the most challenging problems in computational biology. Given a protein's amino acid sequence, a simplified version of the problem is to find an on-lattice self-avoiding walk that minimizes the interaction energy among the amino acids. In this paper, we present a memory-based local search method for the simplified problem using Hydrophobic-Polar energy model and Face Centered Cubic lattice. By memorizing local minima and then avoiding their neighbohood, our approach significantly improves the state-of-the-art local search method for protein structure prediction on a set of standard benchmark proteins.

[1]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[2]  D. Baker,et al.  Protein structure prediction in 2002. , 2002, Current opinion in structural biology.

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

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

[5]  Ron Unger,et al.  Genetic Algorithm for 3D Protein Folding Simulations , 1993, ICGA.

[6]  M. Slaney,et al.  Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes] , 2008, IEEE Signal Processing Magazine.

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

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

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

[10]  Kathleen Steinhöfel,et al.  A hybrid approach to protein folding problem integrating constraint programming with local search , 2010, BMC Bioinformatics.

[11]  Alessandro Dal Palù,et al.  A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction , 2007 .

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

[13]  Pascal Van Hentenryck,et al.  On Lattice Protein Structure Prediction Revisited , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[14]  Alessandro Dal Palù,et al.  A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction , 2007, Softw. Pract. Exp..

[15]  Ram Samudrala,et al.  Ab initio protein structure prediction using a combined hierarchical approach , 1999, Proteins.

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

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

[18]  William S. Havens,et al.  A Hybrid Schema for Systematic Local Search , 2004, Canadian Conference on AI.

[19]  Pascal Van Hentenryck,et al.  Protein Structure Prediction with Large Neighborhood Constraint Programming Search , 2008, CP.

[20]  Scott E. Decatur.  Protein Folding in the Generalized Hydrophobic-Polar Model on the Triangular Lattice , 1996 .

[21]  A. Sali,et al.  Protein Structure Prediction and Structural Genomics , 2001, Science.

[22]  William E. Hart,et al.  Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better Than 86% of Optimal (Extended Abstract) , 1996, RECOMB 1997.

[23]  Joe Marks,et al.  Human-guided tabu search , 2002, AAAI/IAAI.

[24]  Holger H. Hoos,et al.  An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem , 2005, BMC Bioinformatics.

[25]  S A Benner,et al.  Protein Structure Prediction , 1996, Science.

[26]  Kathleen Steinhöfel,et al.  Protein Folding Simulation by Two-Stage Optimization , 2009 .

[27]  Barry Cipra,et al.  Packing Challenge Mastered At Last , 1998, Science.

[28]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[29]  Lakhdar Sais,et al.  Tabu Search for SAT , 1997, AAAI/IAAI.

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

[31]  Rolf Backofen,et al.  CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies , 2008, BMC Bioinformatics.

[32]  R. Jernigan,et al.  Estimation of effective interresidue contact energies from protein crystal structures: quasi-chemical approximation , 1985 .

[33]  Abdul Sattar,et al.  Protein folding prediction in 3D FCC HP lattice model using genetic algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[34]  Erich Bornberg-Bauer,et al.  Chain growth algorithms for HP-type lattice proteins , 1997, RECOMB '97.

[35]  Sebastian Will.  Exact, constraint-based structure prediction in simple protein models , 2005 .

[36]  Pascal Van Hentenryck,et al.  Protein Structure Prediction on the Face Centered Cubic Lattice by Local Search , 2008, AAAI.

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

[38]  Songde Ma,et al.  Protein folding simulations of the hydrophobic–hydrophilic model by combining tabu search with genetic algorithms , 2003 .

[39]  Rolf Backofen,et al.  Algorithmic approach to quantifying the hydrophobic force contribution in protein folding , 1999, German Conference on Bioinformatics.

[40]  Alessandro Dal Palù,et al.  Constraint Logic Programming approach to protein structure prediction , 2004, BMC Bioinformatics.

[41]  Genke Yang,et al.  Extremal Optimization for protein folding simulations on the lattice , 2009, Comput. Math. Appl..

[42]  Rolf Backofen,et al.  A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods , 2003, ICLP.