{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:33Z","timestamp":1725544773343},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_11","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"68-79","source":"Crossref","is-referenced-by-count":0,"title":["Scoring Matrices That Induce Metrics on Sequences"],"prefix":"10.1007","author":[{"given":"El\u00f3i","family":"Ara\u00fajo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Soares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Pattern matching algorithms","year":"1997","key":"11_CR1","unstructured":"Apostolico, A., Galil, Z. (eds.): Pattern matching algorithms. Oxford University Press, Oxford (1997)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(97)00023-6","volume":"182","author":"V. Bafna","year":"1997","unstructured":"Bafna, V., Lawler, E., Pevzner, P.A.: Approximation algorithms for multiple sequence alignment. Theoretical Computer Science\u00a0182, 233\u2013244 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02460299","volume":"55","author":"D. Gusfield","year":"1993","unstructured":"Gusfield, D.: Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology\u00a055(1), 141\u2013154 (1993)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"8","key":"11_CR6","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady\u00a010(8), 707\u2013710 (1965)","journal-title":"Soviet Physics Doklady"},{"issue":"9","key":"11_CR7","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/34.232078","volume":"15","author":"A. Marzal","year":"1993","unstructured":"Marzal, A., Vidal, E.: Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a015(9), 926\u2013932 (1993)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1137\/0152101","volume":"52","author":"P.A. Pevzner","year":"1992","unstructured":"Pevzner, P.A.: Multiple alignment, communication cost, and graph matching. SIAM Journal on Applied Mathematics\u00a052(6), 1763\u20131779 (1992)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/34.682181","volume":"20","author":"E.S. Ristad","year":"1998","unstructured":"Ristad, E.S., Yianilos, P.N.: Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a020(5), 522\u2013532 (1998)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/0126070","volume":"26","author":"P.H. Sellers","year":"1974","unstructured":"Sellers, P.H.: On the theory and computation of evolutionary distances. SIAM Journal on Applied Mathematics\u00a026(4), 787\u2013793 (1974)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:20:56Z","timestamp":1552375256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11682462_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}