A complete and effective move set for simplified protein folding
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Multimeme Algorithms for Protein Structure Prediction
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Real-coded memetic algorithms with crossover hill-climbing
Evolutionary Computation - Special issue on magnetic algorithms
A Novel Genetic Algorithm for HP Model Protein Folding
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Genetic algorithms with local search optimization for protein structure prediction problem
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Protein Structure Prediction Using Evolutionary Algorithms Hybridized with Backtracking
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Off-lattice protein structure prediction with homologous crossover
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Multi-Objective Stochastic Search for Sampling Local Minima in the Protein Energy Surface
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Hi-index | 0.00 |
The prediction of a minimum-energy protein structure from its amino-acid sequence represents one of the most important and challenging problems in computational biology. A new evolutionary model based on hill-climbing genetic operators is proposed to address the hydrophobic - polar model of the protein folding problem. The introduced model ensures an efficient exploration of the search space by implementing a problem-specific crossover operator and enforcing an explicit diversification stage during the evolution. The mutation operator engaged in the proposed model refers to the pull-move operation by which a single residue is moved diagonally causing the potential transition of connecting residues in the same direction in order to maintain a valid protein configuration. Both crossover and mutation are applied using a steepest-ascent hill-climbing approach. The resulting evolutionary algorithm with hill-climbing operators is successfully applied to the protein structure prediction problem for a set of difficult bidimensional instances from lattice models.