An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem.

ABSTRACT:

Background

The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to formulations of the ab-initio folding problem that are based on reduced models of protein structure, including Monte Carlo methods, Evolutionary Algorithms, Tabu Search and hybrid approaches. In our work, we have introduced an ant colony optimisation (ACO) algorithm to address the non-deterministic polynomial-time hard (NP-hard) combinatorial problem of predicting a protein's conformation from its amino acid sequence under a widely studied, conceptually simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar (HP) model.

Results

We present an improvement of our previous ACO algorit

SUBMITTER: Shmygelska A 

PROVIDER: S-EPMC555464 | biostudies-literature | 2005 Feb

REPOSITORIES: biostudies-literature