{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:19:10Z","timestamp":1794381550611,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163203","type":"print"},{"value":"9783642163210","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_41","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"395-405","source":"Crossref","is-referenced-by-count":1,"title":["Approximate String Matching with Stuck Address Bits"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Estrella","family":"Eisenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Orgad","family":"Keller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A.: Asynchronous pattern matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 1\u201310. Springer, Heidelberg (2006) (invited talk)","DOI":"10.1007\/11780441_1"},{"key":"41_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 Symp. on Discrete Algorithms, SODA (2006)","DOI":"10.1145\/1109557.1109692"},{"issue":"6","key":"41_CR3","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. Journal of Computer and System Sciences\u00a075(6), 359\u2013370 (2009)","journal-title":"Journal of Computer and System Sciences"},{"issue":"43","key":"41_CR4","doi-asserted-by":"publisher","first-page":"4382","DOI":"10.1016\/j.tcs.2009.07.019","volume":"410","author":"A. Amir","year":"2009","unstructured":"Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of \u21131 and \u2113\u2009\u221e\u2009 rearrangement distances. Theoretical Computer Science\u00a0410(43), 4382\u20134390 (2009)","journal-title":"Theoretical Computer Science"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-69068-9_13","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2008","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 118\u2013129. Springer, Heidelberg (2008)"},{"key":"#cr-split#-41_CR6.1","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. Theoretical Computer Science??410(51), 5334???5346 (2009);","DOI":"10.1016\/j.tcs.2009.09.010"},{"key":"#cr-split#-41_CR6.2","unstructured":"Special Issue of CPM 2008 Best Papers"},{"issue":"1","key":"41_CR7","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"},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-005-1192-8","volume":"45","author":"A. Amir","year":"2006","unstructured":"Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica\u00a045(1), 109\u2013120 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1137\/080712969","volume":"39","author":"A. Amir","year":"2009","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. SIAM Journal on Computing\u00a039(4), 1444\u20131461 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Amir, A., Levy, A.: String rearrangement metrics: A survey. In: Algorithms and Applications, pp. 1\u201333 (2010)","DOI":"10.1007\/978-3-642-12476-1_1"},{"issue":"1","key":"41_CR11","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":"41_CR12","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":"41_CR13","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., Myers, E.W. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"41_CR14","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":"41_CR15","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":"41_CR16","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A. Goldberg","year":"1998","unstructured":"Goldberg, A., Rao, S.: Beyond the flow decomposition barrier. J. of the ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"J. of the ACM"},{"key":"41_CR17","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":"4","key":"41_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"issue":"43","key":"41_CR19","doi-asserted-by":"publisher","first-page":"4315","DOI":"10.1016\/j.tcs.2009.07.013","volume":"410","author":"O. Kapah","year":"2009","unstructured":"Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. Theoretical Computer Science\u00a0410(43), 4315\u20134326 (2009)","journal-title":"Theoretical Computer Science"},{"key":"41_CR20","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"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T03:13:15Z","timestamp":1559704395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_41","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}