A faster algorithm for approximate string matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 1-23

  Baeza Yates, Ricardo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

APPROXIMATE STRING MATCHING; BIT-OPERATIONS; HYBRID ALGORITHMS; NONDETERMINISTIC FINITE AUTOMATON; RUNNING TIME; SUB-PROBLEMS; TEXT-SEARCHING; WORD LENGTH;

ALGORITHMS;

EID: 0346012989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_1     Document Type: Conference Paper

References (26)

1. A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. CACM, 18(6):333-340, June 1975.
2. R. Baeza-Yates. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, volume I: Algorithms, Software, Architecture, pages 465-476. Elsevier Science, September 1992.
3. R. Baeza-Yates. A unified view to pattern-matching problems. Dept, of Computer Science, Univ. of Chile, ftp://sunsite.dcc.uchile.cl/pub/users/rbaeza/-unified.ps.gz, 1995.
4. R. Baeza-Yates and G. Gonnet. A new approach to text searching. CACM, 35(10):74-82, October 1992.
5. R. Baeza-Yates and C. Perleberg. Fast and practical approximate pattern matching. In Proc. CPM’92, pages 185-192. Springer-Verlag, 1992. LNCS 644.
6. W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. CPM’92, pages 172-181. Springer-Verlag, 1992. LNCS 644.
7. W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. Algorithmica, 12(4/5):327-344, Oct/Nov 1994.
8. W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. of CPM’94, pages 259-273. Springer-Verlag, 1994. LNCS 807.
9. Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM J. of Computing, 19(6):989-999, 1990.
10. G. Landau and U. Vishkin. Fast string matching with k differences. J. of Computer Systems Science, 37:63-78, 1988.
11. G. Landau and U. Vishkin. Fast parallel and serial approximate string matching. J. of Algorithms, 10:157-169, 1989.
12. E. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, Oct/Nov 1994.
13. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. of Molecular Biology, 48:444-453, 1970.
14. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
15. D. Sunday. A very fast substring search algorithm. CACM, 33(8):132-142, August 1990.
16. E. Suntinen and J. Tarhio. On using g-gram locations in approximate string matching. In Proc. of ESA’95. Springer-Verlag, 1995. LNCS 979.
17. T. Takaoka. Approximate pattern matching with samples. In Proc. of ISAAC’94, pages 234-242. Springer-Verlag, 1994. LNCS 834.
18. J. Tarhio and E. Ukkonen. Boyer-Moore approach to approximate string matching. In Proc. of SWAT’90, pages 348-359. Springer-Verlag, 1990. LNCS 447.
19. E. Ukkonen. Approximate string matching with g-grams and maximal matches. Theoretical Computer Science, 1:191-211, 1992.
20. Esko Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
21. Esko Ukkonen. Finding approximate patterns in strings. J. of Algorithms, 6:132-137, 1985.
22. A. Wright. Approximate string matching using within-word parallelism. Software Practice and Experience, 24(4):337-362, April 1994.
23. S. Wu and U. Manber. Agrep-a fast approximate pattern-matching tool. In Proc. of USENIX Technical Conference, pages 153-162, 1992.
24. S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83-91, October 1992.
25. S. Wu, U. Manber, and E. Myers. A subquadratic algorithm for approximate regular expression matching. J. of Algorithms, 19:346-360, 1995.
26. S. Wu, U. Manber, and E. Myers. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica, 15(1):50-67, 1996.