{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:21Z","timestamp":1775281221211,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1016\/0196-6774(85)90023-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"132-137","source":"Crossref","is-referenced-by-count":269,"title":["Finding approximate patterns in strings"],"prefix":"10.1016","volume":"6","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90023-9_BIB1","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/359842.359859","article-title":"A fast string matching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90023-9_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90023-9_BIB3","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\/0196-6774(85)90023-9_BIB4","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\/0196-6774(85)90023-9_BIB5","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":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:34Z","timestamp":1548725194000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0196677485900239"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90023-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}