A Subquadratic Algorithm for Approximate Limited Expression Matching

Algorithmica (New York)

Volumn 15, Issue 1, 1996, Pages 50-67

  Wu, Sun ^a   Manber, U ^a   Myers, G ^a  

^a University of Arizona   (United States)

Author keywords

Approximate string matching; Edit distance; Four Russians paradigm

Indexed keywords

EID: 0002225727     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01942606     Document Type: Article

References (28)

1. K. Abrahamson, Generalized string matching, SIAM J. Comput., 16 (1987), 1039-1051.
2. A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Comm. ACM, 18 (1975), 333-340.
3. V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev, On economic construction of the transitive closure of a directed graph, Dokl. Akad. Nauk SSSR, 194 (1970), 487-488 (in Russian). English translation in Soviet Math. Dokl., 11 (1975), 1209-1210.
4. V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev, On economic construction of the transitive closure of a directed graph, Dokl. Akad. Nauk SSSR, 194 (1970), 487-488 (in Russian). English translation in Soviet Math. Dokl., 11 (1975), 1209-1210.
5. R. A. Baeza-Yates and G. H. Gonnet, A new approach to text searching, Comm. ACM, 35 (1992), 74-82.
6. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Comm. ACM, 20 (1977), 762-772.
7. W. I. Chang and E. L. Lawler, Approximate string matching in sublinear expected time, Proc. 31st Symp. on Foundations of Computer Science, 1990, pp. 116-124.
8. W. I. Chang and J. Lampe, Theoretical and empirical comparisons of approximate string matching algorithms, Proc. 3rd Symp. on Combinatorial Pattern Matching, Tucson, AZ, April 1992, pp. 172-181.
9. B. Commentz-Walter, A string matching algorithm fast on the average, Proc. 6th Internat. Colloq. on Automata, Languages, and Programming, 1979, pp. 118-132.
10. M. Fischev and M. Paterson, String matching and other products, Proc. 7th SIAM-AMS Symp. on Complexity of Computation, 1974, pp. 113-125.
11. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput., 19 (1990), 989-999.
12. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), 323-350.
13. G. M. Landau and U. Vishkin, Fast string matching with k differences, J. Comput. System Sci., 37 (1988), 63-78.
14. W. J. Masek and M. S. Paterson, A faster algorithm for computing string edit distances, J. Comput. System Sci., 20 (1980), 18-31.
15. E. W. Myers, Incremental Alignment Algorithms and their Applications, Technical Report 86-22, Department of Computer Science, University of Arizona, 1986.
16. E. W. Myers, A Sublinear Algorithm for Approximate Keywords Searching, Technical Report TR-90-25, Department of Computer Science, University of Arizona, 1990. Also in Algorithmica, 12 (1994), 345-374.
17. E. W. Myers, A Sublinear Algorithm for Approximate Keywords Searching, Technical Report TR-90-25, Department of Computer Science, University of Arizona, 1990. Also in Algorithmica, 12 (1994), 345-374.
18. E. W. Myers, A four-Russians algorithm for regular expression pattern matching, J. Assoc. Comput. Mach., 39 (1992), 430-448.
19. R. Pinter, Efficient string matching with don't-care patterns, in Combinatorial Algorithms on Words (A. Apostilico and Z. Galil, eds.), NATO ASI Series, Vol. F12, Springer-Verlag, New York, 1985, 11-29.
20. P. H. Sellers, The theory and computations of evolutionary distances: pattern recognition, J. Algorithms, 1 (1980), 359-373.
21. J. Tarhio and E. Ukkonen, Approximate Boyer-Moore string matching, SIAM J. Comput., 22(2) (1993), 243-260.
22. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms, 6 (1985), 132-137.
23. E. Ukkonen, Approximate string-matching with q-grams and maximal matches, Theoret. Comput. Sci., 92 (1992), 191-211.
24. E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica, 10 (1993), 353-364.
25. R. A. Wagner and M. J. Fisher, The string to string correction problem, J. Assoc. Comput. Mach., 21 (1974), 168-173.
26. S. Wu and U. Manber, Agrep - a fast approximate pattern-matching tool, Proc. Usenix Winter 1992 Technical Conference, San Francisco, January 1992, pp. 153-162.
27. S. Wu and U. Manber, Fast text searching allowing errors, Comm. ACM, 35 (1992), 83-91.
28. S. Wu, U. Manber, and E. W. Myers, A sub-quadratic algorithm for approximate regular expression matching, J. of Algorithms, to appear.