{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:40:09Z","timestamp":1725514809799},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540690665"},{"type":"electronic","value":"9783540690689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69068-9_13","type":"book-chapter","created":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T01:54:28Z","timestamp":1212803668000},"page":"118-129","source":"Crossref","is-referenced-by-count":12,"title":["Approximate String Matching with Address Bit Errors"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonatan","family":"Aumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Kapah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","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":"1","key":"13_CR2","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":"13_CR3","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":"13_CR4","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":"13_CR5","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":"13_CR6","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":"13_CR7","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":"13_CR8","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: Proc. 34st Annual Symposium on the Theory of Computing (STOC), pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"13_CR9","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"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. In: Symposium on the Theory of Computing, vol.\u00a04, pp. 125\u2013136 (1972)","DOI":"10.1145\/800152.804905"},{"key":"13_CR11","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":"13_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. of the ACM\u00a027, 701\u2013717 (1980)","journal-title":"J. of the ACM"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R. Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol.\u00a072, pp. 216\u2013226. Springer, Heidelberg (1979)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69068-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:24:45Z","timestamp":1620001485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69068-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540690665","9783540690689"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69068-9_13","relation":{},"subject":[]}}