{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T15:22:21Z","timestamp":1790004141436,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428633","type":"print"},{"value":"9783540455783","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_34","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"494-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Backofen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Will","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1006\/jmbi.1995.0511","volume":"252","author":"V. I. Abkevich","year":"1995","unstructured":"V. I. Abkevich, A. M. Gutin, and E. I. Shakhnovich. Impact of local and nonlocal interactions on thermodynamics and kinetics of protein folding. Journal of Molecular Biology, 252:460\u2013471, 1995.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR2","unstructured":"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\u201997, pages 27\u201338, 1997."},{"issue":"2","key":"34_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1089\/cmb.1997.4.275","volume":"4","author":"R. Agarwala","year":"1997","unstructured":"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\u2013296, 1997.","journal-title":"Journal of Computational Biology"},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","first-page":"72","volume-title":"Constraint techniques for solving the protein structure prediction problem","year":"1998","unstructured":"Rolf Backofen. Constraint techniques for solving the protein structure prediction problem. In Michael Maher and Jean-Francois Puget, editors, Proceedings of 4\nthInternational Conference on Principle and Practice of Constraint Programming (CP\u201998), volume 1520 of Lecture Notes in Computer Science, pages 72\u201386. Springer Verlag, 1998."},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","first-page":"277","volume-title":"An upper bound for number of contacts in the HP-model on the face-centered-cubic lattice (FCC)","year":"2000","unstructured":"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\u2013292, Berlin, 2000. Springer-Verlag."},{"key":"34_CR6","series-title":"Lect Notes Comput Sci","first-page":"257","volume-title":"Optimally compact finite sphere packings \u2014 hydrophobic cores in the FCC","year":"2001","unstructured":"Rolf Backofen and Sebastian Will. Optimally compact finite sphere packings \u2014 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\u2013271, Berlin, 2001. Springer-Verlag."},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1093\/bioinformatics\/15.3.234","volume":"15","author":"R. Backofen","year":"1999","unstructured":"Rolf Backofen, Sebastian Will, and Erich Bornberg-Bauer.Application of constraint programming techniques for structure prediction of lattice proteins with extended alphabets. J. Bioinformatics, 15(3):234\u2013242, 1999.","journal-title":"J. Bioinformatics"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013103, 2000.","DOI":"10.1142\/9789814447331_0010"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/(SICI)1097-0134(19980701)32:1<52::AID-PROT7>3.0.CO;2-G","volume":"32","author":"U. Bastolla","year":"1998","unstructured":"U Bastolla, H Frauenkron, E Gerstner, P Grassberger, and W Nadler. Testing a new monte carlo algorithm for protein folding. Proteins, 32(1):52\u201366, 1998.","journal-title":"Proteins"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"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\u201339, New York, 1998.","DOI":"10.1145\/279069.279080"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Erich Bornberg-Bauer. Chain growth algorithms for HP-type lattice proteins. In Proc. of the 1\nstAnnual International Conference on Computational Molecular Biology (RECOMB), pages 47\u201355. ACM Press, 1997.","DOI":"10.1145\/267521.267528"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding. In Proc. of STOC, pages 597\u2013603, 1998. Short version in Proc. of RECOMB\u201998, pages 61-62.","DOI":"10.1145\/279069.279089"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/pro.5560040401","volume":"4","author":"K.A. Dill","year":"1995","unstructured":"K.A. Dill, S. Bromberg, K. Yue, K.M. Fiebig, D.P. Yee, P.D. Thomas, and H.S. Chan. Principles of protein folding-a perspective of simple exact models. Protein Science, 4:561\u2013602, 1995.","journal-title":"Protein Science"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Ken A. Dill, Klaus M. Fiebig, and Hue Sun Chan. Cooperativity in protein-folding kinetics. Proc. Natl. Acad. Sci. USA, 90:1942\u20131946, 1993.","DOI":"10.1073\/pnas.90.5.1942"},{"key":"34_CR15","unstructured":"Aaron R. Dinner, Andreaj \u0160ali, and Martin Karplus. The folding mechanism of larger model proteins: Role of native structure. Proc. Natl. Acad. Sci. USA, 93:8356\u20138361, 1996."},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. C. Freuder","year":"1982","unstructured":"Eugene C. Freuder. A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery, 29(1):24\u201332, 1982.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"34_CR17","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/(SICI)1097-0282(19971005)42:4<427::AID-BIP6>3.0.CO;2-S","volume":"42","author":"S. Govindarajan","year":"1997","unstructured":"S. Govindarajan and R. A. Goldstein. The foldability landscape of model proteins. Biopolymers, 42(4):427\u2013438, 1997.","journal-title":"Biopolymers"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1038\/5794","volume":"6","author":"P. Koehl","year":"1999","unstructured":"Patrice Koehl and Michael Levitt. A brighter future for protein structure prediction. Nature Structural Biology, 6:108\u2013111, 1999.","journal-title":"Nature Structural Biology"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"3986","DOI":"10.1021\/ma00200a030","volume":"22","author":"K. F. Lau","year":"1989","unstructured":"Kit Fun Lau and Ken A. Dill. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules, 22:3986\u20133997, 1989.","journal-title":"Macromolecules"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1126\/science.273.5275.666","volume":"273","author":"H. Li","year":"1996","unstructured":"Hao Li, Robert Helling, Chao Tnag, and Ned Wingreen. Emergence of preferred structures in a simple model of protein folding. Science, 273:666\u2013669, 1996.","journal-title":"Science"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Neil Madras and Gordon Slade. The Self-Avoiding Walk. Probability and Its Applications. Springer, 1996.","DOI":"10.1007\/978-1-4612-4132-4"},{"key":"34_CR22","unstructured":"Tobias M\u00fcller and J\u00f6rg W\u00fcrtz. 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\u2013206, 1996."},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1006\/jmbi.1995.0311","volume":"249","author":"B. H. Park","year":"1995","unstructured":"Britt H. Park and Michael Levitt. The complexity and accuracy of discrete state models of protein structure. Journal of Molecular Biology, 249:493\u2013507, 1995.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR24","unstructured":"J.-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. 12th Conf. American Assoc. Artificial Intelligence, volume 1, pages 362\u2013367. Amer. Assoc. Artificial Intelligence, 1994."},{"key":"34_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324\u2013343. Springer-Verlag, Berlin, 1995."},{"key":"34_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1006\/jmbi.1993.1258","volume":"231","author":"R. Unger","year":"1993","unstructured":"R. Unger and J. Moult. Genetic algorithms for protein folding simulations. Journal of Molecular Biology, 231:75\u201381, 1993.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR27","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1006\/jmbi.1996.0375","volume":"259","author":"R. Unger","year":"1996","unstructured":"Ron Unger and John Moult. Local interactions dominate folding in a simple protein model. Journal of Molecular Biology, 259:988\u2013994, 1996.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR28","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1006\/jmbi.1994.1110","volume":"235","author":"A. \u0160ali","year":"1994","unstructured":"A. \u0160ali, E. Shakhnovich, and M. Karplus. Kinetics of protein folding. Journal of Molecular Biology, 235:1614\u20131636, 1994.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/jmbi.2000.3835","volume":"300","author":"Y. Xia","year":"2000","unstructured":"Yu Xia, Enoch S. Huang, Michael Levitt, and Ram Samudrala. Ab initio construction of protein tertiary structures using a hierarchical approach. Journal of Molecular Biology, 300:171\u2013185, 2000.","journal-title":"Journal of Molecular Biology"},{"key":"34_CR30","doi-asserted-by":"crossref","unstructured":"Kaizhi Yue and Ken A. Dill. Forces of tertiary structural organization in globular proteins. Proc. Natl. Acad. Sci. USA, 92:146\u2013150, 1995.","DOI":"10.1073\/pnas.92.1.146"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:09:11Z","timestamp":1585602551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}