{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:42:01Z","timestamp":1768585321169,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075655","type":"print"},{"value":"9783319075662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_3","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"21-29","source":"Crossref","is-referenced-by-count":0,"title":["Approximate On-line Palindrome Recognition, and Applications"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"3_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.jcss.2009.03.001","volume":"75","author":"A. Amir","year":"2009","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. J. Comp. Syst. Sci.\u00a075(6), 359\u2013370 (2009)","journal-title":"J. Comp. Syst. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. Journal of Algorithms 37, 247\u2013266 (2000) (Preliminary version appeared at FOCS 1997)","DOI":"10.1006\/jagm.2000.1120"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A. Amir","year":"2003","unstructured":"Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and Computation\u00a0181, 57\u201374 (2003)","journal-title":"Information and Computation"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00151-3","volume":"68","author":"A. Amir","year":"1998","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Lewenstein, N.: Efficient special cases of pattern matching with swaps. Information Processing Letters\u00a068(3), 125\u2013132 (1998)","journal-title":"Information Processing Letters"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-12476-1_1","volume-title":"Algorithms and Applications","author":"A. Amir","year":"2010","unstructured":"Amir, A., Levy, A.: String rearrangement metrics: A survey. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Ukkonen Festschrift. LNCS, vol.\u00a06060, pp. 1\u201333. Springer, Heidelberg (2010)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-45030-3_6","volume-title":"Algorithms and Computation","author":"A. Amir","year":"2013","unstructured":"Amir, A., Porat, B.: Pattern matching with non overlapping reversals - approximation and on-line algorithms. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol.\u00a08283, pp. 55\u201365. Springer, Heidelberg (2013)"},{"key":"3_CR7","doi-asserted-by":"publisher","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":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms - ESA 2002","author":"P. Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 200\u2013210. Springer, Heidelberg (2002)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual International Conference on Research in Computational Biology (RECOMB), pp. 75\u201383. ACM Press (1997)","DOI":"10.1145\/267521.267531"},{"key":"3_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"},{"key":"3_CR12","unstructured":"Christie, D.A.: A 3\/2-approximation algorithm for sorting by reversals. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 244\u2013252 (1998)"},{"key":"3_CR13","unstructured":"Cole, R., Hariharan, R.: Randomized swap matching in o(m logm log|\u03c3|) time, Tech. Report TR1999-789, New York University, Courant Institute (September 1999)"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R. Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. The Annals of Mathematical Statistics\u00a014(4), 436\u2013440 (1943)","journal-title":"The Annals of Mathematical Statistics"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial group testing and its applications, 2nd edn. Series on Applied Mathematics, vol.\u00a012. World Scientific (2000)","DOI":"10.1142\/4252"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Galil, Z.: On converting on-line algorithms into real-time and on real-time algorithms for string matching and palindrome recognition. SIGACT News, 26\u201330 (1975)","DOI":"10.1145\/990502.990505"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comp.\u00a029(3), 880\u2013892 (1999)","journal-title":"SIAM J. Comp."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Res. and Dev., 249\u2013260 (1987)","DOI":"10.1147\/rd.312.0249"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. Journal of the ACM\u00a022(3), 346\u2013351 (1975)","journal-title":"Journal of the ACM"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-60044-2_50","volume-title":"Combinatorial Pattern Matching","author":"S. Muthukrishnan","year":"1995","unstructured":"Muthukrishnan, S.: New results and open problems related to non-standard stringology. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 298\u2013317. Springer, Heidelberg (1995)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: Proc. 50th IEEE Symposium on the Foundation of Computer Science (FOCS), pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T21:11:08Z","timestamp":1649365868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}