{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T02:53:41Z","timestamp":1769396021613,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540126898","type":"print"},{"value":"9783540386827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12689-9_129","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:53:32Z","timestamp":1330192412000},"page":"487-495","source":"Crossref","is-referenced-by-count":59,"title":["On approximate string matching"],"prefix":"10.1007","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"41_CR1","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 10 (1966), 707\u2013710.","journal-title":"Sov. Phys. Dokl."},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"R. Lowrance","year":"1975","unstructured":"Lowrance, R. and R.A. Wagner: An extension of the string-to-string correction problem. J. ACM 22 (1975), 177\u2013183.","journal-title":"J. ACM"},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N. Nakatsu","year":"1982","unstructured":"Nakatsu, N., Y. Kambayashi and S. Yajima: A longest common subsequence algorithm suitable for similar text strings. Acta Informatica 18 (1982), 171\u2013179.","journal-title":"Acta Informatica"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B. and C.D. Wunsch: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48 (1970), 443\u2013453.","journal-title":"J. Mol. Biol."},{"key":"41_CR5","unstructured":"Peltola,H. & al.: SEQAID \u2014 A program package to support biopolymer sequencing. Department of Computer Science and Recombinant DNA Laboratory, University of Helsinki, 1983 (in preparation)."},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1073\/pnas.69.1.4","volume":"69","author":"D. Sankoff","year":"1972","unstructured":"Sankoff, D.: Matching sequences under deletion\/insertion constraints. Proc. Nat. Acad. Sci. 69 (1972), 4\u20136.","journal-title":"Proc. Nat. Acad. Sci."},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Sellers","year":"1980","unstructured":"Sellers, P.H.: The theory and computation of evolutionary distances: Pattern recognition. J. Alg. 1 (1980), 359\u2013373.","journal-title":"J. Alg."},{"key":"41_CR8","unstructured":"Ukkonen,E.: An algorithm for approximate string matching. In preparation."},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R. and M. Fisher: The string-to-string correction problem. J. ACM 21 (1974), 168\u2013178.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12689-9_129.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:25Z","timestamp":1619556625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12689-9_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540126898","9783540386827"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-12689-9_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983]]}}}