A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Chain growth algorithms for HP-type lattice proteins
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Constraint Techniques for Solving the Protein Structure Prediction Problem
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
Lattice protein models are used for hierarchical approaches to protein structure prediction, as well as for investigating principles of protein folding. So far, one has the problem that there exists no lattice that can model real protein conformations with good quality and for which an efficient method to find native conformations is known.We present the first method for the FCC-HP-Model [3] that is capable of finding native conformations for real-sized HP-sequences. It has been shown [23] that the FCC lattice can model real protein conformations with coordinate root mean square deviation below 2 脜.Our method uses a constraint-based approach. It works by first calculating maximally compact sets of points (hydrophobic cores), and then threading the given HP-sequence to the hydrophobic cores such that the core is occupied by H-monomers.