2013
DOI: 10.1109/tcbb.2013.125
|View full text |Cite
|
Sign up to set email alerts
|

Protein Structure Optimization with a "Lamarckian"' Ant Colony Algorithm

Abstract: We describe the LamarckiAnt algorithm: a search algorithm that combines the features of a "Lamarckian" genetic algorithm and ant colony optimization. We have implemented this algorithm for the optimization of BLN model proteins, which have frustrated energy landscapes and represent a challenge for global optimization algorithms. We demonstrate that LamarckiAnt performs competitively with other state-of-the-art optimization algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…The representation of the memory is equivalent to pheromones trails in the Ant Colony Optimization (ACO) algorithms 9 . The concept of ACO has been exploited recently in the computational chemistry context 10,41 . In MERA, every ligand leaves the pheromone trail during simulation and that trail is used as information for the next ligands positions on the dissociation pathway.…”
Section: Memory Enhanced Random Acceleration Molecular Dynamicsmentioning
confidence: 99%
“…The representation of the memory is equivalent to pheromones trails in the Ant Colony Optimization (ACO) algorithms 9 . The concept of ACO has been exploited recently in the computational chemistry context 10,41 . In MERA, every ligand leaves the pheromone trail during simulation and that trail is used as information for the next ligands positions on the dissociation pathway.…”
Section: Memory Enhanced Random Acceleration Molecular Dynamicsmentioning
confidence: 99%
“…Compared to traditional gradientbased optimization algorithms, which suffer from both low efficiency and accuracy, Swarm Intelligence (SI) algorithms have proven effective and robust [20][21]. The Ant Colony Optimization (ACO) [22] algorithm draws inspiration from the foraging behavior of ants to find the optimal path. While robust, the algorithm suffers from slow convergence.…”
Section: Introductionmentioning
confidence: 99%
“…Those algorithms have been successfully applied to a wide range of problems in many different areas 24 . Particularly, they have proved to be a powerful tool solving biological problems related to protein folding 25 , genetic interactions detection 26 , RNA sequence design 27 , protein-protein interaction inhibitors design 28 , protein structure optimization 29 and protein-ligand docking 30 . Moreover, they have outperformed genetic algorithms in a wide range of combinatorial optimization problems 31 35 .…”
Section: Introductionmentioning
confidence: 99%