{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:21:03Z","timestamp":1780330863930,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,18]],"date-time":"2009-02-18T00:00:00Z","timestamp":1234915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s00453-009-9286-3","type":"journal-article","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T14:19:43Z","timestamp":1234880383000},"page":"591-609","source":"Crossref","is-referenced-by-count":10,"title":["Approximate Boyer-Moore String Matching for Small Alphabets"],"prefix":"10.1007","volume":"58","author":[{"given":"Leena","family":"Salmela","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petri","family":"Kalsi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,2,18]]},"reference":[{"key":"9286_CR1","first-page":"487","volume":"194","author":"V. Arlazarov","year":"1970","unstructured":"Arlazarov, V., Dinic, E., Kronrod, M., Faradzev, I.: On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk SSSR 194, 487\u2013488 (1970) (in Russian). English translation in Sov. Math. Dokl. 11, 1209\u20131210 (1975)","journal-title":"Dokl. Acad. Nauk SSSR"},{"issue":"10","key":"9286_CR2","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.: A new approach to text searching. Commun. ACM 35(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"issue":"2","key":"9286_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/inco.1994.1007","volume":"108","author":"R. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R., Gonnet, G.: Fast string matching with mismatches. Inf. Comput. 108(2), 187\u2013199 (1994)","journal-title":"Inf. Comput."},{"issue":"1","key":"9286_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(96)00083-X","volume":"59","author":"R. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R., Perleberg, C.: Fast and practical approximate string matching. Inf. Process. Lett. 59(1), 21\u201327 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"20","key":"9286_CR5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"10","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Commun. ACM 10(20), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"9286_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-58094-8_23","volume-title":"Proceedings of the 5th Symposium on Combinatorial Pattern Matching","author":"W. Chang","year":"1994","unstructured":"Chang, W., Marr, T.: Approximate string matching and local similarity. In: Proceedings of the 5th Symposium on Combinatorial Pattern Matching. LNCS, vol. 807, pp. 259\u2013173. Springer, Berlin (1994)"},{"key":"9286_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-61258-0_2","volume-title":"Proceedings of 7th Symposium on Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"1996","unstructured":"El-Mabrouk, N., Crochemore, M.: Boyer-Moore strategy to efficient approximate string matching. In: Proceedings of 7th Symposium on Combinatorial Pattern Matching. LNCS, vol. 1075, pp. 24\u201338. Springer, Berlin (1996)"},{"key":"9286_CR8","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithm. 9(4) (2004)","DOI":"10.1145\/1005813.1041513"},{"key":"9286_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"N. Horspool","year":"1980","unstructured":"Horspool, N.: Practical fast searching in strings. Softw. Pract. Experience 10, 501\u2013506 (1980)","journal-title":"Softw. Pract. Experience"},{"key":"9286_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/11496656_8","volume-title":"Proceedings of 16th Symposium on Combinatorial Pattern Matching","author":"Z. Liu","year":"2005","unstructured":"Liu, Z., Chen, X., Borneman, J., Jiang, T.: A fast algorithm for approximate string matching on gene sequences. In: Proceedings of 16th Symposium on Combinatorial Pattern Matching. LNCS, vol. 3537, pp. 79\u201390. Springer, Berlin (2005)"},{"key":"9286_CR11","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 faster algorithm for computing string edit distances. J. Comput. Syst. Sci. 20, 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9286_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46(3), 395\u2013415 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"9286_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"9286_CR14","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM J. Exp. Algorithm. 5(4) (2000)","DOI":"10.1145\/351827.384246"},{"key":"9286_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Proceedings of 11th Symposium on Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Proceedings of 11th Symposium on Combinatorial Pattern Matching. LNCS, vol. 1848, pp. 350\u2013363. Springer, Berlin (2000)"},{"issue":"6","key":"9286_CR16","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/S0168-9525(00)02024-2","volume":"16","author":"P. Rice","year":"2000","unstructured":"Rice, P., Longden, I., Bleasby, A.: EMBOSS: The European molecular biology open software suite. Trends Genet. 16(6), 276\u2013277 (2000)","journal-title":"Trends Genet."},{"key":"9286_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/0222018","volume":"22","author":"J. Tarhio","year":"1993","unstructured":"Tarhio, J., Ukkonen, E.: Approximate Boyer-Moore string matching. SIAM J. Comput. 22, 243\u2013260 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9286_CR18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01942606","volume":"15","author":"S. Wu","year":"1996","unstructured":"Wu, S., Manber, U., Myers, E.: A subquadratic algorithm for approximate limited expression matching. Algorithmica 15(1), 50\u201367 (1996)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9286-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9286-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9286-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:03Z","timestamp":1559123103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9286-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,18]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9286"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9286-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,18]]}}}