{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:46Z","timestamp":1759638286204},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0890-5401(02)00035-4","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T16:48:43Z","timestamp":1043945323000},"page":"57-74","source":"Crossref","is-referenced-by-count":48,"title":["Overlap matching"],"prefix":"10.1016","volume":"181","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Richard","family":"Cole","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Hariharan","sequence":"additional","affiliation":[]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(02)00035-4_BIB1","first-page":"144","article-title":"Pattern matching with swaps","author":"Amir","year":"1997","journal-title":"Proc. 38th IEEE Foundations of Computer Science"},{"issue":"2","key":"10.1016\/S0890-5401(02)00035-4_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/jagm.2000.1120","article-title":"Pattern matching with swaps","volume":"37","author":"Amir","year":"2000","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0890-5401(02)00035-4_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1047","article-title":"Efficient 2-dimensional approximate matching of half-rectangular figures","volume":"118","author":"Amir","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0890-5401(02)00035-4_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","article-title":"Alphabet dependence in parameterized matching","volume":"49","author":"Amir","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0890-5401(02)00035-4_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(98)00151-3","article-title":"Efficient special cases of pattern matching with swaps","volume":"68","author":"Amir","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0890-5401(02)00035-4_BIB6","series-title":"Proc. 11th ACM-SIAM Symposium on Discrete Algorithms","first-page":"794","article-title":"Faster algorithms for string matching with k mismatches","author":"Amir","year":"2000"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB7","series-title":"Pattern Matching Algorithms","year":"1997"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB8","series-title":"Proc. 25th Annual ACM Symposium on the Theory of Computation","first-page":"71","article-title":"A theory of parameterized pattern matching: algorithms and applications","author":"Baker","year":"1993"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB9","series-title":"Proc. 9th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"463","article-title":"Approximate string matching: a faster simpler algorithm","author":"Cole","year":"1998"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB10","unstructured":"R. Cole, R. Hariharan, Randomized swap matching in o(mlogmlog|\u03c3|) time, Technical Report TR1999-789, New York University, Courant Institute, September 1999"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB11","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB12","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB13","series-title":"Complexity of Computation","first-page":"113","article-title":"String matching and other products","volume":"vol. 7","author":"Fischer","year":"1974"},{"issue":"6","key":"10.1016\/S0890-5401(02)00035-4_BIB14","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\/S0890-5401(02)00035-4_BIB15","series-title":"Molecular Biology and Biotechnology","first-page":"438","article-title":"Human repetitive elements","author":"Jurka","year":"1995"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB16","series-title":"The Impact of Short Interspersed Elements (SINEs) on the Host Genome","first-page":"25","article-title":"Origin and evolution of alu repetitive elements","author":"Jurka","year":"1995"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB17","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."},{"issue":"2","key":"10.1016\/S0890-5401(02)00035-4_BIB18","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"},{"issue":"2","key":"10.1016\/S0890-5401(02)00035-4_BIB19","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/S0097539794264810","article-title":"Incremental string comparison","volume":"27","author":"Landau","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(02)00035-4_BIB20","first-page":"707","article-title":"Binary codes capable of correcting, deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Dokl."},{"key":"10.1016\/S0890-5401(02)00035-4_BIB21","first-page":"177","article-title":"An extension of the string-to-string correction problem","author":"Lowrance","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0890-5401(02)00035-4_BIB22","series-title":"Proc. 6th Combinatorial Pattern Matching Conference","first-page":"298","article-title":"New results and open problems related to non-standard stringology","volume":"vol. 937","author":"Muthukrishnan","year":"1995"},{"issue":"1","key":"10.1016\/S0890-5401(02)00035-4_BIB23","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1006\/inco.1995.1144","article-title":"String matching under a general matching relation","volume":"122","author":"Muthukrishnan","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0890-5401(02)00035-4_BIB24","series-title":"Proc. 7th ACM Symposium on the Theory of Computing","first-page":"218","article-title":"On the complexity of the extended string-to-string correction problem","author":"Wagner","year":"1975"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T05:57:47Z","timestamp":1553925467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0890540102000354"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00035-4","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}