{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:40:18Z","timestamp":1737006018129,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_4","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"45-58","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for String Folding Problems"],"prefix":"10.1007","author":[{"given":"Giancarlo","family":"Mauri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Pavesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1021\/bi00327a032","volume":"24","author":"K.A. Dill","year":"1985","unstructured":"K.A. Dill, Dominant forces in protein folding. Biochemistry, 24 (1985), 1501.","journal-title":"Biochemistry"},{"key":"4_CR2","first-page":"86","volume":"3","author":"B. Hayes","year":"1998","unstructured":"B. Hayes, Prototeins. American Scientist, 3(1998), 86.","journal-title":"American Scientist"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0166-218X(96)00065-0","volume":"71","author":"M. Paterson","year":"1996","unstructured":"M. Paterson, T. Przytycka, On the Complexity of String Folding. Discrete and Applied Maths, 71 (1996), 217\u2013230.","journal-title":"Discrete and Applied Maths"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, M. Yannakakis, On the Complexity of Protein Folding. Proc. of the Second Annual International Conference on Computational Biology (RECOMB\u2019 98), 61\u201362, New York, 1998.","DOI":"10.1089\/cmb.1998.5.423"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"B. Berger, T. Leighton, Protein Folding in the HP Model is NP Complete. Proc. of the Second Annual International Conference on Computational Biology (RECOMB\u2019 98), 30\u201339, New York, 1998.","DOI":"10.1145\/279069.279080"},{"key":"4_CR6","unstructured":"A. Nayak, A. Sinclair, U. Zwick, Spatial Codes and the Hardness of String Folding Problems. Proceedings of the 9 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 98), 639\u2013648, San Francisco, 1998."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1089\/cmb.1996.3.53","volume":"3","author":"W.E. Hart","year":"1996","unstructured":"W.E. Hart, S.C. Istrail, Fast Protein Folding in the Hydrophobic-Hydrophilic Model. Journal of computational biology, 3(1), 53\u201396, 1996.","journal-title":"Journal of computational biology"},{"key":"4_CR8","unstructured":"G. Mauri, G. Pavesi, A. Piccolboni, Approximation Algorithms for Protein Folding Prediction. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 99), S945\u2013S946, Baltimore, 1999."},{"key":"4_CR9","first-page":"451","volume":"6","author":"J. Earley","year":"1970","unstructured":"J. Earley, An Efficient Context-Free Parsing Algorithm. Communications of the ACM, 6 (1970), 451\u2013455.","journal-title":"Communications of the ACM"},{"issue":"2","key":"4_CR10","first-page":"165","volume":"21","author":"A. St\u00f6lcke","year":"1995","unstructured":"A. St\u00f6lcke, An Efficient Probabilistic Context-Free Parsing Algorithm That Computes Prefix Probabilities. Computational Linguistics, 21(2), 165\u2013201, 1995.","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:14:56Z","timestamp":1736993696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}