Approximate boyer-moore string matching for small alphabets

Algorithmica (New York)

Volumn 58, Issue 3, 2010, Pages 591-609

  Salmela, Leena ^a   Tarhio, Jorma ^a   Kalsi, Petri ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Approximate string matching; Biological sequences; Complexity of algorithms; Edit distance; Hamming distance

Indexed keywords

APPROXIMATE STRING MATCHING; BIOLOGICAL SEQUENCES; BOYER-MOORE; COMPLEXITY OF ALGORITHM; EDIT DISTANCE; MISMATCH PROBLEMS; SEARCHING TIME; STATE-OF-THE-ART ALGORITHMS; STRING MATCHING; TIME COMPLEXITY;

ALGORITHMS;

HAMMING DISTANCE;

EID: 77955665521     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9286-3     Document Type: Article

References (18)

1. V. Arlazarov E. Dinic M. Kronrod I. Faradzev 1970 On economic construction of the transitive closure of a directed graph Dokl. Acad. Nauk SSSR 194 487 488 269546 (in Russian). English translation in Sov. Math. Dokl. 11, 1209-1210 (1975)
2. R. Baeza-Yates G. Gonnet 1992 A new approach to text searching Commun. ACM 35 10 74 82 10.1145/135239.135243
3. R. Baeza-Yates G. Gonnet 1994 Fast string matching with mismatches Inf. Comput. 108 2 187 199 0804.68064 10.1006/inco.1994.1007 1265849
4. R. Baeza-Yates C. Perleberg 1996 Fast and practical approximate string matching Inf. Process. Lett. 59 1 21 27 1046.68514 10.1016/0020-0190(96)00083-X 1418731 (Pubitemid 126375569)
5. R. Boyer J. Moore 1977 A fast string searching algorithm Commun. ACM 10 20 762 772 10.1145/359842.359859 (Pubitemid 8554622)
6. 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-173. Springer, Berlin (1994)
7. 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-38. Springer, Berlin (1996)
8. Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithm. 9(4) (2004)
9. N. Horspool 1980 Practical fast searching in strings Softw. Pract. Experience 10 501 506 10.1002/spe.4380100608
10. 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-90. Springer, Berlin (2005)
11. W. Masek M. Paterson 1980 A faster algorithm for computing string edit distances J. Comput. Syst. Sci. 20 18 31 0436.68044 10.1016/0022-0000(80)90002-1 566639 (Pubitemid 10476340)
12. G. Myers 1999 A fast bit-vector algorithm for approximate string matching based on dynamic programming J. ACM 46 3 395 415 1065.68663 10.1145/316542.316550 1815739
13. G. Navarro 2001 A guided tour to approximate string matching ACM Comput. Surv. 33 1 31 88 10.1145/375360.375365 (Pubitemid 33768480)
14. Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM J. Exp. Algorithm. 5(4) (2000)
15. 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-363. Springer, Berlin (2000)
16. P. Rice I. Longden A. Bleasby 2000 EMBOSS: The European molecular biology open software suite Trends Genet. 16 6 276 277 10.1016/S0168-9525(00)02024-2
17. J. Tarhio E. Ukkonen 1993 Approximate Boyer-Moore string matching SIAM J. Comput. 22 243 260 0770.68074 10.1137/0222018 1207782
18. S. Wu U. Manber E. Myers 1996 A subquadratic algorithm for approximate limited expression matching Algorithmica 15 1 50 67 0960.68592 10.1007/BF01942606 1362619