{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T20:24:46Z","timestamp":1775161486639,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7868,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90143-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"191-211","source":"Crossref","is-referenced-by-count":385,"title":["Approximate string-matching with q-grams and maximal matches"],"prefix":"10.1016","volume":"92","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90143-4_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90143-4_BIB2","series-title":"Proc. IEEE 1990 Ann. Symp. on Foundations of Computer Science","first-page":"116","article-title":"Approximate string matching in sublinear expected time","author":"Chang","year":"1990"},{"key":"10.1016\/0304-3975(92)90143-4_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(92)90143-4_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetitions","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90143-4_BIB5","series-title":"Proc. MFCS'88 Symp.","first-page":"44","article-title":"String matching with constraints","volume":"Vol. 324","author":"Crochemore","year":"1988"},{"key":"10.1016\/0304-3975(92)90143-4_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","article-title":"Approximate string matching","volume":"12","author":"Dowling","year":"1980","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(92)90143-4_BIB7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(88)90076-5","article-title":"A new distance metric on strings computable in linear time","volume":"20","author":"Ehrenfeucht","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(92)90143-4_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","article-title":"Data structures and algorithms for approximate string matching","volume":"4","author":"Galil","year":"1988","journal-title":"J. Complexity"},{"key":"10.1016\/0304-3975(92)90143-4_BIB9","series-title":"Automata, Languages, and Programming (ICALP'89)","first-page":"394","article-title":"An improved algorithm for approximate string-matching","volume":"Vol. 372","author":"Galil","year":"1989"},{"key":"10.1016\/0304-3975(92)90143-4_BIB10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(89)90188-9","article-title":"Simple and efficient string matching with k mismatches","volume":"33","author":"Grossi","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90143-4_BIB11","unstructured":"P. Jokinen, J. Tarhio, and E. Ukkonen, A comparison of approximate string-matching algorithms, submitted."},{"key":"10.1016\/0304-3975(92)90143-4_BIB12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern matching","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(92)90143-4_BIB13","series-title":"Proc. 4th Joint Conf. on Pattern Recognition","first-page":"807","article-title":"A very fast associative method for the recognition and correction of misspelt words, based on redundant hash-addressing","author":"Kohonen","year":"1978"},{"key":"10.1016\/0304-3975(92)90143-4_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","article-title":"Fast string matching with k differences","volume":"37","author":"Landau","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90143-4_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","article-title":"Fast parallel and serial approximate string matching","volume":"10","author":"Landau","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(92)90143-4_BIB16","first-page":"707","article-title":"Binary codes of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0304-3975(92)90143-4_BIB17","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90143-4_BIB18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/spe.4380180407","article-title":"Fast approximate string matching","volume":"18","author":"Owolabi","year":"1988","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/0304-3975(92)90143-4_BIB19","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\/0304-3975(92)90143-4_BIB20","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communications","volume":"27","author":"Shannon","year":"1948","journal-title":"The Bell Systems Tech. J."},{"key":"10.1016\/0304-3975(92)90143-4_BIB21","series-title":"Proc. 2nd Scand. Workshop on Algorithm Theory (SWAT'90)","first-page":"348","article-title":"Boyer-Moore approach to approximate string matching","volume":"Vol. 447","author":"Tarhio","year":"1990"},{"key":"10.1016\/0304-3975(92)90143-4_BIB22","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(92)90143-4_BIB23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90143-4_BIB24","series-title":"Approximate string matching with suffix automata","author":"Ukkonen","year":"1990"},{"key":"10.1016\/0304-3975(92)90143-4_BIB25","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. ACM"},{"key":"10.1016\/0304-3975(92)90143-4_BIB26","series-title":"Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:28Z","timestamp":1555127788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901434"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90143-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}