{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:42:32Z","timestamp":1725468152238},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055106","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"832-843","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of deriving score functions from examples for problems in molecular biology"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Mutsunori","family":"Yagiura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akutsu, T., Miyano, S.: On the approximation of protein threading. Proc. Int. Conf. on Computational Molecular Biology, ACM (1997) 3\u20138","key":"71_CR1","DOI":"10.1145\/267521.267523"},{"unstructured":"Akutsu, T., Tashimo, H.: Linear programming based approach to the derivation of a contact potential for protein threading. Proc. Pacific Symp. Biocomputing'98, World Scientific (1998) 413\u2013424","key":"71_CR2"},{"key":"71_CR3","first-page":"521","volume":"775","author":"E. Amaldi","year":"1994","unstructured":"Amaldi, E., Kann, V.: On the approximability of finding maximum feasible subsystems of linear systems. LNCS, Vol. 775 (1994) 521\u2013532","journal-title":"LNCS"},{"key":"71_CR4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1126\/science.1853201","volume":"253","author":"J. U. Bowie","year":"1991","unstructured":"Bowie, J. U., L\u00fcthy, R., Eisenberg, D.: A method to identify protein sequences that fold into a known three-dimensional structures. Science 253 (1991) 164\u2013170","journal-title":"Science"},{"key":"71_CR5","first-page":"345","volume":"5","author":"M. O. Dayhoff","year":"1978","unstructured":"Dayhoff, M. O., Schwartz, R. M. and Orcutt, B C.: A model of evolutionary change in proteins. Atlas of protein sequence and structure 5 (1978) 345\u2013352","journal-title":"Atlas of protein sequence and structure"},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0092-8240(05)80066-7","volume":"55","author":"D. Gusfield","year":"1993","unstructured":"Gusfield, D.: Efficient method for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55 (1993) 141\u2013154","journal-title":"Bull. Math. Biol."},{"doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge Univ. Press (1997)","key":"71_CR7","DOI":"10.1017\/CBO9780511574931"},{"key":"71_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01185430","volume":"12","author":"D. Gusfield","year":"1994","unstructured":"Gusfield, D., Balasubramanian, K., Naor, D.: Parametric optimization of sequence alignment. Algorithmica 12 (1994) 312\u2013326","journal-title":"Algorithmica"},{"key":"71_CR9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. K. Karmarkar","year":"1984","unstructured":"Karmarkar, N. K.: A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373\u2013395","journal-title":"Combinatorica"},{"key":"71_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-2836(82)90515-0","volume":"157","author":"J. Kyte","year":"1982","unstructured":"Kyte, J., Doolittle, R. F.: A simple method of displaying the hydropathic character of a protein. J. Mol. Biol. 157 (1982) 105\u2013132","journal-title":"J. Mol. Biol."},{"doi-asserted-by":"crossref","unstructured":"Laird, P. D.: Learning from Good and Bad Data. Kluwer Academic Publishers (1988).","key":"71_CR11","DOI":"10.1007\/978-1-4613-1685-5"},{"key":"71_CR12","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1093\/protein\/7.9.1059","volume":"7","author":"R. H. Lathrop","year":"1994","unstructured":"Lathrop, R. H.: The protein threading problem with sequence amino acid interaction preferences is NP-complete. Protein Eng. 7 (1994) 1059\u20131068","journal-title":"Protein Eng."},{"key":"71_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1006\/jmbi.1996.0053","volume":"255","author":"R. H. Lathrop","year":"1996","unstructured":"Lathrop, R. H., Smith, T. F.: Global optimum protein threading with gapped alignment and empirical pair score functions. J. Mol. Biol. 255 (1996) 641\u2013665","journal-title":"J. Mol. Biol."},{"key":"71_CR14","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/0022-2836(92)90228-C","volume":"277","author":"V. N. Maiorov","year":"1992","unstructured":"Maiorov, V. N., Crippen, G. M.: Contact potential that recognizes the correct folding of globular proteins. J. Mol. Biol. 277 (1992) 876\u2013888","journal-title":"J. Mol. Biol."},{"key":"71_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","volume":"125","author":"M. Middendorf","year":"1994","unstructured":"Middendorf, M.: More on the complexity of common superstring and supersequence problems. Theoretical Computer Science 125 (1994) 205\u2013228","journal-title":"Theoretical Computer Science"},{"unstructured":"Natarajan, B. K.: Machine Learning \u2014 A Theoretical Approach. Morgan Kaufmann (1991)","key":"71_CR16"},{"key":"71_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L. Wang","year":"1994","unstructured":"Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. J. Comp. Biol. 1 (1994) 337\u2013348","journal-title":"J. Comp. Biol."},{"key":"71_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M. Zuker","year":"1981","unstructured":"Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research 9 (1981) 133\u2013148","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T15:10:19Z","timestamp":1549897819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0055106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}