{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:32Z","timestamp":1725456632035},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647393"},{"type":"electronic","value":"9783540690542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030791","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T07:49:24Z","timestamp":1133423364000},"page":"209-220","source":"Crossref","is-referenced-by-count":0,"title":["Efficient special cases of pattern matching with swaps"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Lewensteint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"issue":"6","key":"15_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 J. Computing, 16(6):1039\u20131051, 1987.","journal-title":"SIAM J. Computing"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir, Y. Aumann, G. Landau, M. Lewenstein, and N. Lewenstein.Pattern matching with swaps. Proc. 38th IEEE FOCS, pages 144\u2013153, 1997.","DOI":"10.1109\/SFCS.1997.646103"},{"issue":"1","key":"15_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1047","volume":"118","author":"A. Amir","year":"1995","unstructured":"A. Amir and M. Farach. Efficient 2-dimensional approximate matching of halfrectangular figures. Information and Computation, 118(1):1\u201311, April 1995.","journal-title":"Information and Computation"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762\u2013772, 1977.","journal-title":"Comm. ACM"},{"key":"15_CR5","unstructured":"M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113\u2013125, 1974."},{"key":"15_CR6","first-page":"125","volume":"4","author":"R. Karp","year":"1972","unstructured":"R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing, 4:125\u2013136, 1972.","journal-title":"Symposium on the Theory of Computing"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Computing, 6:323\u2013350, 1977.","journal-title":"SIAM J. Computing"},{"key":"15_CR8","unstructured":"S. Rao Kosaraju. Efficient string matching. Manuscript, 1987."},{"key":"15_CR9","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 Phys. Dokl., 10:707\u2013710, 1966.","journal-title":"Soviet Phys. Dokl."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"R. Lowrance and R. A. Wagner. An extension of the string-to-string correction problem. J. of the ACM, pages 177\u2013183, 1975.","DOI":"10.1145\/321879.321880"},{"issue":"1","key":"15_CR11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1006\/inco.1995.1144","volume":"122","author":"S. Muthukrishnan","year":"1995","unstructured":"S. Muthukrishnan and H. Ramesh. String matching under a general matching relation. Information and Computation, 122(1):140\u2013148, 1995.","journal-title":"Information and Computation"},{"key":"15_CR12","unstructured":"A. Pentland. Invited talk. NSF Institutional Infrastructure Workshop, 1992."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"R. Y. Pinter. Efficient string matching with don't care patterns. In Z. Galil A. Apostolico, editor, Combinatorial Algorithms on Words, volume 12, pages 11\u201329. NATO ASI Series F, 1985.","DOI":"10.1007\/978-3-642-82456-2_2"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:25:48Z","timestamp":1586593548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647393","9783540690542"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0030791","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}