{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:53:28Z","timestamp":1773388408509,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00224-011-9322-y","type":"journal-article","created":{"date-parts":[[2011,3,31]],"date-time":"2011-03-31T04:04:46Z","timestamp":1301544286000},"page":"492-515","source":"Crossref","is-referenced-by-count":3,"title":["Faster Approximate String Matching for Short Patterns"],"prefix":"10.1007","volume":"50","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,1]]},"reference":[{"key":"9322_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S. Albers","year":"1997","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Inf. Comput. 136, 25\u201351 (1997)","journal-title":"Inf. Comput."},{"key":"9322_CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s00224-004-1155-5","volume":"37","author":"S. Alstrup","year":"2004","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory Comput. Syst. 37, 441\u2013456 (2004)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9322_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/jcss.1998.1580","volume":"57","author":"A. Andersson","year":"1998","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? J. Comput. Syst. Sci. 57(1), 74\u201393 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"9322_CR4","first-page":"487","volume":"194","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk. 194, 487\u2013488 (1970) (in Russian). English translation in Sov. Math. Dokl. 11, 1209\u20131210 (1975)","journal-title":"Dokl. Acad. Nauk."},{"issue":"10","key":"9322_CR5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"key":"9322_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0037393","volume-title":"Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Navarro, G.: A\u00a0faster algorithm for approximate string matching. In: Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol.\u00a01075, pp.\u00a01\u201323 (1996)"},{"key":"9322_CR7","first-page":"307","volume-title":"Proceedings of the AFIPS Spring Joint Computer Conference","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the AFIPS Spring Joint Computer Conference, pp.\u00a0307\u2013314 (1968)"},{"key":"9322_CR8","first-page":"88","volume-title":"Proceedings of the 4th Latin American Symposium on Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pp.\u00a088\u201394 (2000)"},{"key":"9322_CR9","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.tcs.2008.08.042","volume":"409","author":"P. Bille","year":"2008","unstructured":"Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theor. Comput. Sci. 409, 486\u2013496 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9322_CR10","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1137\/S0097539700370527","volume":"31","author":"R. Cole","year":"2002","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: a simpler faster algorithm. SIAM J. Comput. 31(6), 1761\u20131782 (2002)","journal-title":"SIAM J. Comput."},{"key":"9322_CR11","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, second edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"6","key":"9322_CR12","first-page":"987","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J.\u00a0ACM 47(6), 987\u20131011 (2000)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9322_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Galil, Z., Giancarlo, R.: Data structures and algorithms for approximate string matching. J. Complex. 4(1), 33\u201372 (1988)","journal-title":"J. Complex."},{"issue":"6","key":"9322_CR14","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z. Galil","year":"1990","unstructured":"Galil, Z., Park, K.: An improved algorithm for approximate string matching. SIAM J. Comput. 19(6), 989\u2013999 (1990)","journal-title":"SIAM J. Comput."},{"key":"9322_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"9322_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science","author":"T. Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol.\u00a01373, pp.\u00a0366\u2013398 (1998)"},{"issue":"2","key":"9322_CR17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9322_CR18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00453-004-1108-z","volume":"41","author":"H. Hyyr\u00f6","year":"2005","unstructured":"Hyyr\u00f6, H., Navarro, G.: Bit-parallel witnesses and their applications to approximate string matching. Algorithmica 41(3), 203\u2013231 (2005)","journal-title":"Algorithmica"},{"key":"9322_CR19","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2008","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a04 (2008). Pre-Fascicle 1a: Bitwise Tricks and Techniques (Art of Computer Programming)"},{"key":"9322_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J.\u00a0Algorithms 10, 157\u2013169 (1989)","journal-title":"J.\u00a0Algorithms"},{"key":"9322_CR21","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"key":"9322_CR22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. Masek","year":"1980","unstructured":"Masek, W., Paterson, M.: A\u00a0faster algorithm for computing string edit distances. J. Comput. Syst. Sci. 20, 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9322_CR23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E.W. Myers","year":"1986","unstructured":"Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica 1(2), 251\u2013266 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"9322_CR24","first-page":"395","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J.\u00a0ACM 46(3), 395\u2013415 (1999)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9322_CR25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A\u00a0guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"9322_CR26","first-page":"320","volume-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science","author":"S.C. Sahinalp","year":"1996","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp.\u00a0320\u2013328. IEEE Comput. Soc., Los Alamitos (1996)"},{"key":"9322_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. Sellers","year":"1980","unstructured":"Sellers, P.: The theory and computation of evolutionary distances: pattern recognition. J.\u00a0Algorithms 1, 359\u2013373 (1980)","journal-title":"J.\u00a0Algorithms"},{"issue":"1\u20133","key":"9322_CR28","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Inf. Control 64(1\u20133), 100\u2013118 (1985)","journal-title":"Inf. Control"},{"issue":"5","key":"9322_CR29","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E., Wood, D.: Approximate string matching with suffix automata. Algorithmica 10(5), 353\u2013364 (1993)","journal-title":"Algorithmica"},{"key":"9322_CR30","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21, 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"4","key":"9322_CR31","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/spe.4380240402","volume":"24","author":"A.H. Wright","year":"1994","unstructured":"Wright, A.H.: Approximate string matching using within-word parallelism. Softw. Pract. Exp. 24(4), 337\u2013362 (1994)","journal-title":"Softw. Pract. Exp."},{"issue":"10","key":"9322_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching: allowing errors. Commun. ACM 35(10), 83\u201391 (1992)","journal-title":"Commun. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9322-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9322-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9322-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:22Z","timestamp":1558698862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9322-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9322"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9322-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}