Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Excluding Symmetries in Constraint-Based Search
Constraints
Kinetics analysis methods for approximate folding landscapes
Bioinformatics
Application of tabu search strategy for finding low energy structure of protein
Artificial Intelligence in Medicine
Protein Structure Prediction with Large Neighborhood Constraint Programming Search
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Computational Biology and Chemistry
On Lattice Protein Structure Prediction Revisited
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Memory-based local search for simplified protein structure prediction
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Random-walk: a stagnation recovery technique for simplified protein structure prediction
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
A new genetic algorithm for simplified protein structure prediction
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
Ab initio protein structure prediction is an important problem for which several algorithms have been developed. Algorithms differ by how they represent 3D protein conformations (on-lattice, off-lattice, coarse-grain or fine-grain model), by the energy model they consider, and whether they are heuristic or exact algorithms. This paper presents a local search algorithm to find the native state for the Hydrophobic-Polar (HP) model on the Face Centered Cubic (FCC) lattice; i.e. a self-avoiding walk on the FCC lattice with maximum number of H-H contacts. The algorithm relies on a randomized, structured initialization, a novel fitness function to guide the search, and efficient data structures to obtain self-avoiding walks. Experimental results on benchmark instances show the efficiency and excellent performance of our algorithm, and illustrate the biological pertinence of the FCC lattice.