{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:59Z","timestamp":1725491879710},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_16","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"173-183","source":"Crossref","is-referenced-by-count":0,"title":["Tuning Approximate Boyer-Moore for Gene Sequences"],"prefix":"10.1007","author":[{"given":"Petri","family":"Kalsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leena","family":"Salmela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"487","volume":"194","author":"V. Arlazarova","year":"1970","unstructured":"Arlazarova, V., Dinic, E., Kronrod, M., Faradzev, I.: On economic construction of the transitive closure of a directed graph. Doklady Academi Nauk SSSR\u00a0194, 487\u2013488 (1970) (in Russian) (English translation in Soviet Mathematics Doklady 11, 1209\u20131210 (1975))","journal-title":"Doklady Academi Nauk SSSR"},{"issue":"10","key":"16_CR2","doi-asserted-by":"publisher","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. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","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. Information and Computation\u00a0108(2), 187\u2013199 (1994)","journal-title":"Information and Computation"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(96)00083-X","volume":"59","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Perleberg, C.H.: Fast and practical approximate string matching. Information Processing Letters\u00a059(1), 21\u201327 (1996)","journal-title":"Information Processing Letters"},{"issue":"20","key":"16_CR5","doi-asserted-by":"publisher","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. Communications of the ACM\u00a010(20), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-61258-0_2","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"1996","unstructured":"El-Mabrouk, N., Crochemore, M.: Boyer-Moore strategy to efficient approximate string matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 24\u201338. Springer, Heidelberg (1996)"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1005813.1041513","volume":"9","author":"K. Fredriksson","year":"2004","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics\u00a09, 1\u201347 (2004)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"N. Horspool","year":"1980","unstructured":"Horspool, N.: Practical fast searching in strings. Software Practice & Experience\u00a010, 501\u2013506 (1980)","journal-title":"Software Practice & Experience"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/11496656_8","volume-title":"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: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 79\u201390. Springer, Heidelberg (2005)"},{"key":"16_CR10","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a020, 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","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. Journal of the ACM\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","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 Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 350\u2013363. Springer, Heidelberg (2000)"},{"key":"16_CR14","doi-asserted-by":"publisher","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 Journal on Computing\u00a022, 243\u2013260 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","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\u00a015(1), 50\u201367 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T23:39:12Z","timestamp":1629761952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_16","relation":{},"subject":[]}}