{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T04:09:11Z","timestamp":1745554151698},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s00453-005-1192-8","type":"journal-article","created":{"date-parts":[[2006,3,17]],"date-time":"2006-03-17T18:00:21Z","timestamp":1142618421000},"page":"109-120","source":"Crossref","is-referenced-by-count":15,"title":["Swap and mismatch edit distance"],"prefix":"10.1007","volume":"45","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Estrella","family":"Eisenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"1192_CR1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized string matching.SIAM Journal on Computing, 16(6):1039\u20131051, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"1192_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A. Amir","year":"2003","unstructured":"A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching.Information and Computation, 181(1):57\u201374, 2003.","journal-title":"Information and Computation"},{"key":"1192_CR3","unstructured":"A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching withk mismatches. InProc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 794\u2013803, 2000."},{"issue":"1","key":"1192_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0020-0190(01)00302-7","volume":"83","author":"A. Amir","year":"2002","unstructured":"A. Amir, M. Lewenstein, and E. Porat. Approximate swapped matching.Information Processing Letters, 83(1):33\u201339, 2002.","journal-title":"Information Processing Letters"},{"key":"1192_CR5","unstructured":"R. Cole and R. Hariharan. Approximate string matching: a faster simpler algorithm. InProc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 463\u2013472, 1998."},{"key":"1192_CR6","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1992","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest.Introduction to Algorithms. MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1992."},{"key":"1192_CR7","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter.Text Algorithms. Oxford University Press, Oxford, 1994."},{"key":"1192_CR8","first-page":"113","volume-title":"Complexity of Computation","author":"M. J. Fischer","year":"1974","unstructured":"M. J. Fischer and M. S. Paterson. String matching and other products. InComplexity of Computation, (R. M. Karp, editor), pages 113\u2013125. SIAM-AMS Proceedings, Volume 7. American Mathematical Society, Providence, RI, 1974."},{"key":"1192_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G. M. Landau","year":"1986","unstructured":"G. M. Landau and U. Vishkin. Efficient string matching withk mismatches.Theoretical Computer Science, 43:239\u2013249, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"1192_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching.Journal of Algorithms, 10(2):157\u2013169, 1989.","journal-title":"Journal of Algorithms"},{"key":"1192_CR11","first-page":"707","volume":"10","author":"V. I. Levenshtein","year":"1966","unstructured":"V. I. Levenshtein. Binary codes capable of correcting, deletions, insertions and reversals.Soviet Physics Doklady, 10:707\u2013710, 1966.","journal-title":"Soviet Physics Doklady"},{"issue":"2","key":"1192_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"R. Lowrance","year":"1975","unstructured":"R. Lowrance and R. A. Wagner. An extension of the string-to-string correction problem.Journal of the ACM, 22(2):177\u2013183, 1975.","journal-title":"Journal of the ACM"},{"key":"1192_CR13","doi-asserted-by":"crossref","unstructured":"R. A. Wagner. On the complexity of the extended string-to-string correction problem. InProc. 7th ACM STOC, pages 218\u2013223, 1975.","DOI":"10.1145\/800116.803771"},{"key":"1192_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithm.Proc. 14IEEE Symposium on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-005-1192-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-005-1192-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-005-1192-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:58Z","timestamp":1559137498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-005-1192-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["1192"],"URL":"https:\/\/doi.org\/10.1007\/s00453-005-1192-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}