On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallel execution of prolog programs: a survey
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new algorithm for protein folding in the HP model
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computational studies of protein folding
Computing in Science and Engineering
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Principles of Constraint Programming
Principles of Constraint Programming
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Logic Programming Techniques in Protein Structure Determination: Methodologies and Results
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
25 years of applications of logic programming in Italy
A 25-year perspective on logic programming
A new constraint solver for 3d lattices and its application to the protein folding problem
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Specification and verification of agent interaction using abductive reasoning
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices---a biologically meaningful approximation of the general protein folding problem. The paper improves the results presented in [15] and introduces new ideas for improving efficiency: (i) proper reorganization of the constraint structure; (ii) development of novel, both general and problem-specific, heuristics; (iii) exploitation of parallelism. Globally, we obtain a speed up in the order of 60 w.r.t. [15]. We show how these results can be employed to solve the folding problem for large proteins containing subsequences whose conformation is already known.