Portal de Periódicos da CAPES

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

2003; Springer Science+Business Media; Linguagem: Inglês

10.1007/3-540-44886-1_30

1611-3349

Alena Shmygelska, Holger H. Hoos,

Advanced Multi-Objective Optimization Algorithms

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 and Mon 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 presentedhere establish our new ACO algorithm for 2D HP protein folding as a state-of-the-art methodf or this highly relevant problem from bioinformatics.