Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores
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  that is capable of finding native conformations for real-sized HP-sequences. It has been shown  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.
KeywordsHydrophobic Core Native Conformation Protein Structure Prediction Path Constraint Structure Prediction Problem
Unable to display preview. Download preview PDF.
- 2.V.I. Abkevich, A.M. Gutin, and E.I. Shakhnovich. Computer simulations of prebiotic evolution. In Russ B. Altman, A. Keith Dunker, Lawrence Hunter, and Teri E. Klein, editors, PSB’97, pages 27–38, 1997.Google Scholar
- 3.Richa Agarwala, Serafim Batzoglou, Vlado Dancik, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, and Steven Skiena. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP-model. Journal of Computational Biology, 4(2):275–296, 1997.CrossRefGoogle Scholar
- 4.Rolf Backofen. Constraint techniques for solving the protein structure prediction problem. In Michael Maher and Jean-Francois Puget, editors, Proceedings of 4 th International Conference on Principle and Practice of Constraint Programming (CP’98), volume 1520 of Lecture Notes in Computer Science, pages 72–86. Springer Verlag, 1998.Google Scholar
- 5.Rolf Backofen. An upper bound for number of contacts in the HP-model on the face-centered-cubic lattice (FCC). In Raffaele Giancarlo and David Sanko., editors, Proc. of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM2000), volume 1848 of Lecture Notes in Computer Science, pages 277–292, Berlin, 2000. Springer-Verlag.Google Scholar
- 6.Rolf Backofen and Sebastian Will. Optimally compact finite sphere packings — hydrophobic cores in the FCC. In Amihood Amir and Gad Landau, editors, Proc. of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001), volume 2089 of Lecture Notes in Computer Science, pages 257–271, Berlin, 2001. Springer-Verlag.Google Scholar
- 8.Rolf Backofen, Sebastian Will, and Peter Clote. Algorithmic approach to quantifying the hydrophobic force contribution in protein folding. In Russ B. Altman, A. Keith Dunker, Lawrence Hunter, and Teri E. Klein, editors, Pacific Symposium on Biocomputing (PSB 2000), volume 5, pages 92–103, 2000.Google Scholar
- 10.B. Berger and T. Leighton. Protein folding in the hydrophobic-hydrophilic (HP) modell is NP-complete. In Proc. of the Second Annual International Conferences on Compututational Molecular Biology (RECOMB98), pages 30–39, New York, 1998.Google Scholar
- 11.Erich Bornberg-Bauer. Chain growth algorithms for HP-type lattice proteins. In Proc. of the 1 st Annual International Conference on Computational Molecular Biology (RECOMB), pages 47–55. ACM Press, 1997.Google Scholar
- 12.P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding. In Proc. of STOC, pages 597–603, 1998. Short version in Proc. of RECOMB’98, pages 61-62.Google Scholar
- 14.Ken A. Dill, Klaus M. Fiebig, and Hue Sun Chan. Cooperativity in protein-folding kinetics. Proc. Natl. Acad. Sci. USA, 90:1942–1946, 1993.Google Scholar
- 15.Aaron R. Dinner, Andreaj Šali, and Martin Karplus. The folding mechanism of larger model proteins: Role of native structure. Proc. Natl. Acad. Sci. USA, 93:8356–8361, 1996.Google Scholar
- 21.Neil Madras and Gordon Slade. The Self-Avoiding Walk. Probability and Its Applications. Springer, 1996.Google Scholar
- 22.Tobias Müller and Jörg Würtz. Interfacing propagators with a concurrent constraint language. In JICSLP96 Post-conference workshop and Compulog Net Meeting on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, pages 195–206, 1996.Google Scholar
- 24.J.-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. 12th Conf. American Assoc. Artificial Intelligence, volume 1, pages 362–367. Amer. Assoc. Artificial Intelligence, 1994.Google Scholar
- 30.Kaizhi Yue and Ken A. Dill. Forces of tertiary structural organization in globular proteins. Proc. Natl. Acad. Sci. USA, 92:146–150, 1995.Google Scholar