A subquadratic algorithm for approximate regular expression matching

Journal of Algorithms

Volumn 19, Issue 3, 1995, Pages 346-360

  Wu, Sun ^a,b   Manber, Udi ^a   Myers, eugene ^a  

^a UNIVERSITY OF ARIZONA   (United States)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344005044     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.1041     Document Type: Article

References (17)

1. 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. Acad. Nauk SSSR 194 (1970), 487-488. [in Russian] English translation in Soviet Math Dokl. 11 (1975), 1209-1210.
2. A. V. Aho, R. Sethi, and J. D. Ullman, "Compilers: Principles, Techniques, and Tools, " Addison-Wesley, 1985.
3. D. S. Hirschberg, A linear space algorithm for computing longest common subsequences, Commun. ACM 18 (1975), 341-343.
4. J. W. Hunt and T. G. Szymanski, A fast algorithm for computing longest common subsequences, Commun. ACM 20 (1977), 350-353.
5. J. E. Hepcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation, " Addison-Wesley, 1979.
6. W. J. Masek and M. S. Paterson. A faster algorithm for computing string edit distances, J. Comput. System Sci. 20 (1980), 18-31.
7. E. W. Myers, An O(ND) difference algorithm and its variations, Algorithmica 1 (1986), 251-266.
8. E. W. Myers, A four-Russian algorithm for regular expression pattern matching, J. Assoc. Comput. Mach. 39(2) (1992). 430-448.
9. E. W. Myers and W. Miller, Approximate matching of regular expressions, Bull. Math. Biol. 51 (1989), 5-37.
10. N. Nakatsu, Y. Kambayashi, and S. Yajima, A longest common subsequence algorithm suitable for similar text string. Acta Inform. 18 (1982), 171-179.
11. K. Thompson, Regular expression search algorithm, Commun. ACM 11 (June 1968), 419-422.
12. E. Ukkonen, Algorithms for approximate string matching, Inform. Control 64 (1985), 100-118.
13. R. A. Wagner and M. J. Fischer, The string to string correction problem. J. Assoc. Comput. Mach. 21 (1974), 168-173.
14. R. A. Wagner and J. I. Seiferas, Correcting counter-automaton-recognizable languages, SIAM J. Comput. 7 (1978), 357-375.
15. S. Wu, U. Manber, E. W. Myers, and W. Miller, An O(NP) sequence comparison algorithm, Inform. Process. Lett. 35 (1990), 317-323.
16. S. Wu. U. Manber, and E. W. Myers, A sub-quadratic algorithm for approximate limited expression matching, Technical Report 92-36, Department of Computer Science, University of Arizona (Dec. 1992), Algorithmica, in press.
17. S. Wu and U. Manber, Fast text searching allowing errors. Comm. ACM 35 (Oct. 1992), 83-91.