{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:04Z","timestamp":1725558964933},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_5","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"43-54","source":"Crossref","is-referenced-by-count":2,"title":["Cycle Detection and Correction"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Estrella","family":"Eisenberg","sequence":"additional","affiliation":[]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[]},{"given":"Natalie","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM J. Comp.\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM J. Comp."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1221\u20131229 (2006)","DOI":"10.1145\/1109557.1109692"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jagm.2000.1120","volume":"37","author":"A. Amir","year":"2000","unstructured":"Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. Journal of Algorithms\u00a037, 247\u2013266 (2000); Preliminary version appeared at FOCS 97","journal-title":"Journal of Algorithms"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A. Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity and its application. SIAM J. Comp.\u00a027(1), 90\u2013106 (1998)","journal-title":"SIAM J. Comp."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-75520-3_11","volume-title":"Algorithms \u2013 ESA 2007","author":"A. Amir","year":"2007","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 99\u2013110. Springer, Heidelberg (2007)"},{"issue":"9","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.dam.2006.11.017","volume":"156","author":"A. Apostolico","year":"2008","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math.\u00a0156(9), 1389\u20131398 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF01955046","volume":"15","author":"A. Apostolico","year":"1996","unstructured":"Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica\u00a015(5), 481\u2013494 (1996)","journal-title":"Algorithmica"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. on Discrete Mathematics\u00a011, 221\u2013240 (1998)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"Combinatorial Pattern Matching","author":"P. Berman","year":"1996","unstructured":"Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Myers, E.W. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"5_CR10","first-page":"527","volume":"34","author":"A. Cayley","year":"1849","unstructured":"Cayley, A.: Note on the theory of permutations. Philosophical Magazine\u00a0(34), 527\u2013529 (1849)","journal-title":"Philosophical Magazine"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting by block-interchanges. Information Processing Letters\u00a060, 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"5_CR13","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation, SIAM-AMS Proceedings, vol.\u00a07, pp. 113\u2013125 (1974)"},{"issue":"5","key":"5_CR14","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z. Galil","year":"1996","unstructured":"Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comp.\u00a025(5), 907\u2013935 (1996)","journal-title":"SIAM J. Comp."},{"key":"5_CR15","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl.\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Phys. Dokl."},{"key":"5_CR16","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. SIAM J. Applied Mathematics\u00a08(2), 300\u2013304 (1960)","journal-title":"SIAM J. Applied Mathematics"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"R\u00e9gnier, M., Rostami, L.: A unifying look at d-dimensional periodicities and space coverings. In: Proc. 4th Symp. on Combinatorial Pattern Matching, vol.\u00a015, pp. 215\u2013227 (1993)","DOI":"10.1007\/BFb0029807"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Tiskin, A.: Fast distance multiplication of unit-monge matrices. In: Proc. of ACM-SIAM SODA, pp. 1287\u20131296 (2010)","DOI":"10.1137\/1.9781611973075.103"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:22Z","timestamp":1606168102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}