Journal of Computational Chemistry
Chain growth algorithms for HP-type lattice proteins
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
IBM Systems Journal - Deep computing for the life sciences
Constraint-Based Local Search
Protein structure prediction on the face centered cubic lattice by local search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Parallelizing constraint programs transparently
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clp-based protein fragment assembly*
Theory and Practice of Logic Programming
On Lattice Protein Structure Prediction Revisited
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Memory-based local search for simplified protein structure prediction
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Hi-index | 0.00 |
Protein structure predictions is regarded as a highly challenging problem both for the biology and for the computational communities. Many approaches have been developed in the recent years, moving to increasingly complex lattice models or even off-lattice models. This paper presents a Large Neighborhood Search (LNS) to find the native state for the Hydrophobic-Polar (HP) model on the Face Centered Cubic (FCC) lattice or, in other words, a self- avoiding walk on the FCC lattice having a maximum number of H-H contacts. The algorithm starts with a tabu-search algorithm, whose solution is then improved by a combination of constraint programming and LNS. This hybrid algorithm improves earlier approaches in the literature over several well-known instances and demonstrates the potential of constraint-programming approaches for ab initiomethods.