{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:49:20Z","timestamp":1773694160148,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10425,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/s0019-9958(85)80046-2","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T18:48:44Z","timestamp":1115405324000},"page":"100-118","source":"Crossref","is-referenced-by-count":404,"title":["Algorithms for approximate string matching"],"prefix":"10.1016","volume":"64","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80046-2_bib1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/S0019-9958(85)80046-2_bib2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","article-title":"An extension of the string-to-string correction problem","volume":"22","author":"Lowrance","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80046-2_bib3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","article-title":"A longest common subsequence algorithm suitable for similar text strings","volume":"18","author":"Nakatsu","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(85)80046-2_bib4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Molecular Biol."},{"key":"10.1016\/S0019-9958(85)80046-2_bib5","series-title":"Information Processing 83","first-page":"59","article-title":"Algorithms for some string matching problems arising in molecular genertics","author":"Peltola","year":"1983"},{"key":"10.1016\/S0019-9958(85)80046-2_bib6","first-page":"4","article-title":"Matching sequences under deletion\/insertion constraints","volume":"69","author":"Sankoff","year":"1972"},{"key":"10.1016\/S0019-9958(85)80046-2_bib7","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0126070","article-title":"On the theory and computation of evolutionary distances","volume":"26","author":"Sellers","year":"1974","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0019-9958(85)80046-2_bib8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","article-title":"The theory and computation of evolutionary distances: Pattern recognition","volume":"1","author":"Sellers","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0019-9958(85)80046-2_bib9","first-page":"81","article-title":"Speech discrimination by dynamic programming","volume":"4","author":"Vintsyuk","year":"1968","journal-title":"Kibernetika (Kiev)"},{"key":"10.1016\/S0019-9958(85)80046-2_bib10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T12:27:43Z","timestamp":1548505663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["S0019995885800462"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80046-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}