{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:45Z","timestamp":1725484305201},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_15","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"168-177","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Deriving Position Specific Score Matrices from Examples"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sascha","family":"Ott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/BFb0055106","volume-title":"Proc. ICALP\u201998","author":"T. Akutsu","year":"1998","unstructured":"Akutsu, T., Yagiura, M.: On the complexity of deriving score functions from examples for problems in molecular biology. Proc. ICALP\u201998. Lecture Notes in Computer Science, Vol. 1443. Springer-Verlag, Berlin Heidelberg New York (1998) 832\u2013843"},{"key":"15_CR2","unstructured":"Akutsu, T., Arimura, H., Shimozono, S.: On approximation algorithms for local multiple alignment. Proc. 4th ACM Int. Conf. Computational Molecular Biology (2000) 1\u20137"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (1998)","DOI":"10.1017\/CBO9780511790492"},{"key":"15_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin Heidelberg New York (1987)"},{"key":"15_CR5","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability. Freeman (1979)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S. Henikoff","year":"1992","unstructured":"Henikoff, S., Henikoff, J. G.: Amino acid substitution matrices from protein blocks. Proc. National Academy of Sciences of the USA 89 (1992) 10915\u201310919","journal-title":"Proc. National Academy of Sciences of the USA"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, T., Li, M.: On the complexity of learning strings and sequences. Proc. 4th ACM Workshop on Computational Learning Theory (1991) 367\u2013274","DOI":"10.1016\/B978-1-55860-213-7.50036-5"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1002\/1097-0134(20001201)41:4<498::AID-PROT70>3.0.CO;2-3","volume":"41","author":"M. Kann","year":"2000","unstructured":"Kann, M., Qian, B., Goldstein, R. A.: Optimization of a new score function for detection of remote homologs. Proteins 41 (2000) 498\u2013503","journal-title":"Proteins"},{"key":"15_CR9","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 for displaying the hydropathic character of a protein. J. Molecular Biology 157 (1982) 105\u2013132","journal-title":"J. Molecular Biology"},{"key":"15_CR10","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Proc. 10th ACM-SIAM Symp. Discrete Algorithms (1999) 633\u2013642"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. Proc. 31st ACM Symp. Theory of Computing (1999) 473\u2013482","DOI":"10.1145\/301250.301376"},{"key":"15_CR12","unstructured":"Miyano, S., Shinohara, A., Shinohara, T.: Which classes of elementary formal systems are polynomial-time learnable. Proc. 2nd Workshop on Algorithmic Learning Theory (1991) 139\u2013150"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:53:39Z","timestamp":1550321619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}