{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:20Z","timestamp":1725544040467},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_1","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["Asynchronous Pattern Matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"1_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":"1_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, A., Levy, A.: Pattern matching with address bit errors (submitted for publication, 2006)","DOI":"10.1145\/1109557.1109692"},{"key":"1_CR3","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"},{"issue":"1","key":"1_CR4","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(1), 57\u201374 (2003)","journal-title":"Information and Computation"},{"key":"1_CR5","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A.: Interchange and weighted-interchange rearrangement distances in strings (submitted for publication, 2006)"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(01)00302-7","volume":"83","author":"A. Amir","year":"2002","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Information Processing Letters\u00a083(1), 33\u201339 (2002)","journal-title":"Information Processing Letters"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms (2004)","DOI":"10.1016\/S0196-6774(03)00097-X"},{"key":"1_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":"1_CR9","unstructured":"Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 912\u2013921 (2004)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-27801-6_3","volume-title":"Combinatorial Pattern Matching","author":"M.A. Bender","year":"2004","unstructured":"Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Swidan, F.: Sorting by length-weighted reversals: Dealing with signs and circularity. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"1_CR11","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., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"1_CR12","first-page":"75","volume-title":"Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB)","author":"A. Carpara","year":"1997","unstructured":"Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pp. 75\u201383. ACM Press, New York (1997)"},{"key":"1_CR13","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":"1_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1007352.1007374","volume-title":"Proc. 36th Annual ACM Symposium on the Theory of Computing (STOC)","author":"R. Cole","year":"2004","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proc. 36th Annual ACM Symposium on the Theory of Computing (STOC), pp. 91\u2013100. ACM Press, New York (2004)"},{"key":"1_CR15","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: A faster simpler algorithm. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 463\u2013472 (1998)"},{"key":"1_CR16","unstructured":"Ferragina, P., Grossi, R.: Fast incremental text editing. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 531\u2013540 (1995)"},{"key":"1_CR17","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) SIAM-AMS Proceedings on Complexity of Computation, vol.\u00a07, pp. 113\u2013125 (1974)"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z. Galil","year":"1986","unstructured":"Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News\u00a017(4), 52\u201354 (1986)","journal-title":"SIGACT News"},{"key":"1_CR19","unstructured":"Gu, M., Farach, M., Beigel, R.: An efficient algorithm for dynamic text indexing. In: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697\u2013704 (1994)"},{"key":"1_CR20","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"2002","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco (2002)","edition":"3"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(93)90177-B","volume":"48","author":"H. Karloff","year":"1993","unstructured":"Karloff, H.: Fast algorithms for approximately counting mismatches. Information Processing Letters\u00a048(2), 53\u201360 (1993)","journal-title":"Information Processing Letters"},{"key":"1_CR22","first-page":"125","volume":"4","author":"R. Karp","year":"1972","unstructured":"Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing\u00a04, 125\u2013136 (1972)","journal-title":"Symposium on the Theory of Computing"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G.M. Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science\u00a043, 239\u2013249 (1986)","journal-title":"Theoretical Computer Science"},{"key":"1_CR24","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":"1_CR25","doi-asserted-by":"crossref","unstructured":"Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177\u2013183 (1975)","DOI":"10.1145\/321879.321880"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. 37th FOCS, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T01:11:03Z","timestamp":1627521063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11780441_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}