Faster algorithms for string matching with k mismatches

Journal of Algorithms

Volumn 50, Issue 2, 2004, Pages 257-275

  Amir, Amihood ^a,b   Lewenstein, Moshe ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

Author keywords

Approximate string matching; Combinatorial algorithms on words; Design and analysis of algorithms; Hamming distance

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; ERROR ANALYSIS; PROBLEM SOLVING; SYSTEMS ANALYSIS;

APPROXIMATE STRING MATCHING; COMBINATORIAL ALGORITHMS ON WORDS; DESIGN AND ANALYSIS OF ALGORITHMS; HAMMING DISTANCE;

PATTERN MATCHING;

EID: 1442263887     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00097-X     Document Type: Article

References (28)

1. K. Abrahamson, Generalized string matching, SIAM J. Computing 16 (6) (1987) 1039-1051.
2. A.V. Aho, M.J. Corasick, Efficient string matching, Commun. ACM 18 (6) (1975) 333-340.
3. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, J. Algorithms 37 (2000) 247-266.
4. A. Amir, A. Butman, M. Lewenstein, Real scaled matching, Inform. Process. Lett. 68 (3) (1999) 125-132.
5. A. Amir, M. Farach, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. and Comput. 118 (1) (April 1995) 1-11.
6. B.S. Baker, A theory of parameterized pattern matching: algorithms and applications, in: Proc. 25th Annual ACM Symposium on the Theory of Computation, 1993, pp. 71-80.
7. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, U. Vishkin, Highly parallelizable problems, in: Proc. 21st ACM Symposium on Theory of Computation, 1989, pp. 309-319.
8. R.S. Boyer, J.S. Moore, A fast string searching algorithm, Commun. ACM 20 (1977) 762-772.
9. R. Cole, R. Hariharan, Approximate string matching: A faster simpler algorithm, in: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, pp. 462-472.
10. M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, in SIAM-AMS Proceedings, vol. 7, 1974, pp. 113-125.
11. Z. Galil, R. Giancarlo, Improved string matching with k mismatches, SIGACT News 17 (4) (1986) 52-54.
12. Z. Galil, K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (6) (1990) 989-999.
13. D. Harel, R. E. Tarjan, Fast algorithms for finding nearest common ancestor, Comput. Syst. Science 13 (1984) 338-355.
14. H. Karloff, Fast algorithms for approximately counting mismatches, Inform. Process. Lett. 48 (2) (1993) 53-60.
15. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
16. G.M. Landau, U. Vishkin, Efficient string matching with k mismatches, Theoret. Comput. Sci. 43 (1986) 239-249.
17. G.M. Landau, U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (2) (1989) 157-169.
18. G.M. Landau, E.W. Myers, J.P. Schmidt, Incremental string comparison, SIAM J. Comput. 27 (2) (1998) 557-582.
19. G.M. Landau, U. Vishkin, Efficient string matching in the presence of errors, in: Proc. 26th IEEE FOCS, 1985, pp. 126-136.
20. V.I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1996) 707-710.
21. R. Lowrance, R.A. Wagner, An extension of the string-to-string correction problem, J. ACM 22 (1975) 177-183.
22. E.M, McCreigth, A space-economical suffix tree construction algorithm, J. ACM 23 (1976) 262-272.
23. M.V. Olson, A time to sequence, Science 270 (1995) 394-396.
24. A. Pentland, Invited talk, NSF Institutional Infrastructure Workshop, 1992.
25. E. Ukkonen, Algorithms for approximate string matching, Inform. and Control 64 (1985) 100-118.
26. U. Vishkin, Deterministic sampling - a new technique for fast pattern matching, SIAM J. Comput. 20 (1991) 303-314.
27. R.A. Wagner, On the complexity of the extended string-to-string correction problem, in: Proc. 7th Annual ACM Symposium on the Theory of Computation, 1975, pp. 218-223.
28. P. Weiner, Linear pattern matching algorithm, in: Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.