{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:55:54Z","timestamp":1773924954669,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00083-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"21-27","source":"Crossref","is-referenced-by-count":61,"title":["Fast and practical approximate string matching"],"prefix":"10.1016","volume":"59","author":[{"given":"Ricardo A.","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris H.","family":"Perleberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00083-X_BIB1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","article-title":"Generalized string matching","volume":"16","author":"Abrahamson","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00083-X_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: An aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(96)00083-X_BIB3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","article-title":"A new approach to text searching","volume":"35","author":"Baeza-Yates","year":"1992","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(96)00083-X_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/inco.1994.1007","article-title":"Fast string matching with mismatches","volume":"108","author":"Baeza-Yates","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(96)00083-X_BIB5","series-title":"Proc. Combinatorial Pattern Matching (CPM'96)","article-title":"A faster algorithm for approximate string matching","author":"Baeza-Yates","year":"1996"},{"key":"10.1016\/0020-0190(96)00083-X_BIB6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(93)90250-D","article-title":"Fast two dimensional pattern matching","volume":"45","author":"Baeza-Yates","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00083-X_BIB7","series-title":"Combinatorial Pattern Matching","first-page":"185","article-title":"Fast and practical approximate pattern matching","volume":"644","author":"Baeza-Yates","year":"1992"},{"key":"10.1016\/0020-0190(96)00083-X_BIB8","series-title":"Combinatorial Pattern Matching","first-page":"172","article-title":"Theoretical and empirical comparisons of approximate string matching algorithms","volume":"644","author":"Chang","year":"1992"},{"key":"10.1016\/0020-0190(96)00083-X_BIB9","series-title":"Proc. 31st Annual IEEE Symp. on Foundations of Computer Science","first-page":"116","article-title":"Approximated string matching in sublinear expected time","author":"Chang","year":"1990"},{"key":"10.1016\/0020-0190(96)00083-X_BIB10","series-title":"ICALP","first-page":"118","article-title":"A string matching algorithm fast on the average","volume":"6","author":"Commentz-Walter","year":"1979"},{"key":"10.1016\/0020-0190(96)00083-X_BIB11","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/0020-0190(96)00083-X_BIB12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/8307.8309","article-title":"Improved string matching with k mismatches","volume":"17","author":"Galil","year":"1986","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(96)00083-X_BIB13","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","article-title":"An improved algorithm for approximate string matching","volume":"19","author":"Galil","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00083-X_BIB14","author":"Gonnet","year":"1991"},{"key":"10.1016\/0020-0190(96)00083-X_BIB15","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\/0020-0190(96)00083-X_BIB16","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(88)90233-5","article-title":"On saving space in parallel computation","volume":"29","author":"Hagerup","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00083-X_BIB17","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1002\/spe.4380211105","article-title":"Fast string searching","volume":"21","author":"Hume","year":"1991","journal-title":"Software \u2014 Practice and Experience"},{"key":"10.1016\/0020-0190(96)00083-X_BIB18","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\/0020-0190(96)00083-X_BIB19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","article-title":"Efficient string matching with k mismatches","volume":"43","author":"Landau","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00083-X_BIB20","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\/0020-0190(96)00083-X_BIB21","article-title":"An algorithm for approximate string matching with non uniform costs","author":"Manber","year":"1989"},{"key":"10.1016\/0020-0190(96)00083-X_BIB22","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","article-title":"An O(ND) difference algorithm and its variants","volume":"1","author":"Myers","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(96)00083-X_BIB23","first-page":"12","article-title":"Three longest substring algorithms","volume":"1","author":"Perleberg","year":"1995","journal-title":"J. Brazilian Comput. Soc."},{"key":"10.1016\/0020-0190(96)00083-X_BIB24","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1002\/spe.4380211006","article-title":"Experiments with a very fast substring search algorithm","volume":"21","author":"Smith","year":"1991","journal-title":"Software \u2014 Practice and Experience"},{"key":"10.1016\/0020-0190(96)00083-X_BIB25","article-title":"Efficient algorithms for multiple pattern matching","author":"Sridhar","year":"1986"},{"key":"10.1016\/0020-0190(96)00083-X_BIB26","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/79173.79184","article-title":"A very fast substring search algorithm","volume":"33","author":"Sunday","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(96)00083-X_BIB27","series-title":"Proc. 2nd Scandinavian Workshop in Algorithmic Theory, SWAT'90","first-page":"348","article-title":"Boyer-Moore approach to approximate string matching","volume":"447","author":"Tarhio","year":"1990"},{"key":"10.1016\/0020-0190(96)00083-X_BIB28","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\/0020-0190(96)00083-X_BIB29","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01769703","article-title":"Approximate string matching with suffix automata","volume":"10","author":"Ukkonen","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(96)00083-X_BIB30","unstructured":"S. Wu, Personal communication, 1992."},{"key":"10.1016\/0020-0190(96)00083-X_BIB31","series-title":"Proc. USENIX 1992 Winter Technical Conf.","first-page":"153","article-title":"Agrep \u2014 A fast approximate pattern matching tool","author":"Wu","year":"1992"},{"key":"10.1016\/0020-0190(96)00083-X_BIB32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","article-title":"Fast text searching allowing errors","volume":"35","author":"Wu","year":"1992","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(96)00083-X_BIB33","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01942606","article-title":"A sub-quadratic algorithm for approximate limited expression matching","volume":"15","author":"Wu","year":"1996","journal-title":"Algorithmica"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600083X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600083X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:24:07Z","timestamp":1556043847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909600083X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["002001909600083X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00083-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}