{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:23:24Z","timestamp":1768109004007,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438625","type":"print"},{"value":"9783540454526","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_18","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"203-224","source":"Crossref","is-referenced-by-count":21,"title":["Faster Bit-Parallel Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Heikki","family":"Hyyr\u00f6","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"18_CR1","first-page":"465","volume":"I","author":"R. Baeza-Yates","year":"1992","unstructured":"R. Baeza-Yates. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, volume I, pages 465\u2013476. Elsevier Science, 1992.","journal-title":"12th IFIP World Computer Congress"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0037393","volume-title":"Proc. Theory and Practice of Informatics (SOFSEM\u201996)","author":"R. Baeza-Yates","year":"1996","unstructured":"R. Baeza-Yates. A unified view of string matching algorithms. In Proc. Theory and Practice of Informatics (SOFSEM\u201996), LNCS 1175, pages 1\u201315, 1996."},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R. Baeza-Yates","year":"1999","unstructured":"R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127\u2013158, 1999.","journal-title":"Algorithmica"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","first-page":"172","volume-title":"Proc. 3rd Combinatorial Pattern Matching (CPM\u201992)","author":"W. Chang","year":"1992","unstructured":"W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. 3rd Combinatorial Pattern Matching (CPM\u201992), LNCS 644, pages 172\u2013181, 1992."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-58094-8_23","volume-title":"Proc. 5th Combinatorial Pattern Matching (CPM\u201994)","author":"W. Chang","year":"1994","unstructured":"W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. 5th Combinatorial Pattern Matching (CPM\u201994), LNCS 807, pages 259\u2013273, 1994."},{"key":"18_CR6","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994."},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z. Galil","year":"1990","unstructured":"Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM Journal on Computing, 19(6):989\u2013999, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR8","volume-title":"Technical Report A-2001-10","author":"H. Hyyr\u00f6","year":"2001","unstructured":"H. Hyyr\u00f6. Explaining and extending the bit-parallel algorithm of Myers. Technical Report A-2001-10, University of Tampere, Finland, 2001."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. Landau","year":"1989","unstructured":"G. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms, 10:157\u2013169, 1989.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395\u2013415, 1999.","journal-title":"Journal of the ACM"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31\u201388, 2001.","journal-title":"ACM Computing Surveys"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0020-0190(99)00121-0","volume":"72","author":"G. Navarro","year":"1999","unstructured":"G. Navarro and R. Baeza-Yates. Very fast and simple approximate string matching. Information Processing Letters, 72:65\u201370, 1999.","journal-title":"Information Processing Letters"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00453-001-0034-6","volume":"30","author":"G. Navarro","year":"2001","unstructured":"G. Navarro and R. Baeza-Yates. Improving an algorithm for approximate string matching. Algorithmica, 30(4):473\u2013502, 2001.","journal-title":"Algorithmica"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000.","DOI":"10.1145\/351827.384246"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings-Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. To appear.","DOI":"10.1017\/CBO9781316135228"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. Sellers","year":"1980","unstructured":"P. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1:359\u2013373, 1980.","journal-title":"Journal of Algorithms"},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-60313-1_153","volume-title":"Proc. European Symposium on Algorithms (ESA\u201995)","author":"E. Sutinen","year":"1995","unstructured":"E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proc. European Symposium on Algorithms (ESA\u201995), LNCS 979, pages 327\u2013340, 1995."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/0222018","volume":"22","author":"J. Tarhio","year":"1993","unstructured":"J. Tarhio and E. Ukkonen. Approximate Boyer-Moore string matching. SIAM Journal on Computing, 22(2):243\u2013260, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100\u2013118, 1985.","journal-title":"Information and Control"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132\u2013137, 1985.","journal-title":"Journal of Algorithms"},{"issue":"10","key":"18_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83\u201391, 1992.","journal-title":"Comm. of the ACM"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01942606","volume":"15","author":"S. Wu","year":"1996","unstructured":"S. Wu, U. Manber, and G. Myers. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica, 15(1):50\u201367, 1996.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:51:09Z","timestamp":1550321469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}