An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem

The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational biology. In the current work, we focus on a widely studied abstraction of this problem, the 2-dimensional hydrophobic-polar (2D HP) protein folding problem. We present an improvedv ersion of our recently proposed Ant Colony Optimisation (ACO) algorithm for this NP-hardcom binatorial problem and demonstrate its ability to solve standard benchmark instances substantially better than the original algorithm; the performance of our new algorithm is comparable with state-of-the-art Evolutionary andMon te Carlo algorithms for this problem. The improvements over our previous ACO algorithm include long range moves that allows us to perform modification of the protein at high densities, the use of improving ants, ands elective local search. Overall, the results presented here establish our new ACO algorithm for 2D HP protein folding as a state-of-the-art methodf or this highly relevant problem from bioinformatics.

[1]  Holger H. Hoos,et al.  An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem , 2002, Ant Algorithms.

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

[3]  Hsiao-Ping Hsu,et al.  Growth-based optimization algorithm for lattice heteropolymers. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  F M Richards,et al.  Areas, volumes, packing and protein structure. , 1977, Annual review of biophysics and bioengineering.

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

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

[7]  M. Karplus,et al.  How does a protein fold? , 1994, Nature.

[8]  G. Rose,et al.  Hierarchic organization of domains in globular proteins. , 1979, Journal of molecular biology.

[9]  Thomas Stützle,et al.  On the empirical evaluation of Las Vegas algorithms , 1999 .

[10]  J. Pekny,et al.  A dynamic Monte Carlo algorithm for exploration of dense conformational spaces in heteropolymers , 1997 .

[11]  Walter Nadler,et al.  Testing a new Monte Carlo algorithm for protein folding , 1998 .

[12]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[13]  T. Dandekar,et al.  Improving genetic algorithms for protein folding simulations by systematic crossover. , 1999, Bio Systems.

[14]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[15]  W. Wong,et al.  Evolutionary Monte Carlo for protein folding simulations , 2001 .

[16]  William E. Hart,et al.  Protein structure prediction with evolutionary algorithms , 1999 .

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

[18]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

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

[20]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[21]  George Chikenji,et al.  MULTI-SELF-OVERLAP ENSEMBLE FOR PROTEIN FOLDING : GROUND STATE SEARCH AND THERMODYNAMICS , 1999, cond-mat/9903003.

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