Approximate tree matching in the presence of variable length don′t cares

Journal of Algorithms

Volumn 16, Issue 1, 1994, Pages 33-66

  Zhang, Kaizhong ^a   Shasha, Dennis ^b   Wang, Jason T L ^c  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b NEW YORK UNIVERSITY   (United States)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (27)

1. A. V. Aho, M. Ganapathi, and S. W. K. Tjiang, Code generation using tree matching and dynamic programing, ACM Trans. Programming Languages Systems 11, No. 4 (1989), 491-516.
2. R. Byrd, "User Notes: An Informal Guide to the Lexical Query Language, " Technical report, IBM T. J. Watson Research Center, New York, 1990.
3. M. Chodorow and J. L. Klavans, "Locating Syntactic Patterns in Text Corpora, " Technical report, IBM T. J. Watson Research Center, New York, 1990.
4. M. S. Chodorow, R. J. Byrd, and G. E. Heidorn, Extracting semantic hierarchies from a large on-line dictionary, " in "Proceedings, Annual Meetings of the Association for Computational Linguistics, 1985, " pp. 299-304.
5. M. Dubiner, Z. Galil, and E. Magen, Faster tree pattern matching, in "Proceedings, 31st Annual Symp. on Foundations of Computer Science, Oct. 1990, " pp. 145-150.
6. Z. Galil and K. Park, An improved algorithm for approximate string matching, " SIAM J. Comput. 19, No. 6 (1990), 989-999.
7. C. M. Hoffmann and M. J. O'Donnell, Pattern matching in trees, J. Assoc. Comput. Mach. 29 (1982), 68-95.
8. S. R. Kosaraju, Efficient tree pattern matching, in "Proceedings, 30th Annual Symp. on Foundations of Computer Science, Oct. 1989, " pp. 178-183.
9. G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10(1989), 157-169.
10. J. Markowitz, T. Ahlswede, and M. Evans, Semantically significant patterns in dictionary definitions, in "Proceedings, Annual Meeting of the Association for Computational Linguistics, 1986, " pp. 112-119.
11. B. Moayer and K. S. Fu, A tree system approach for fingerprint pattern recognition, IEEE Trans. Pattern Anal. Mach. Intell 8 (1986) 376-387.
12. E. W. Myers and W. Miller, Approximate matching of regular expressions, Bull. Math. Biol. 51, No. 1 (1989), 5-37.
13. M. Neff and B. K. Boguraev, Dictionaries, dictionary grammars and dictionary entry parsing, in "Proceedings, 27th Annual Meeting of the Association for Computational Linguistics, June 1989."
14. M. Neff, R. Byrd, and O. Rizk, Creating and querying hierarchical lexical data bases, in "Proceedings, 2nd Conf. Applied Natural Language Processing, 1988, " pp. 84-93.
15. H. Samet, Distance transform for images represented by quadtrees, IEEE Trans. Pattern Anal. Mach. Intell. 4 No. 3 (1982), 298-303.
16. P. H. Sellers, The theory and computation of evolutionary distances, J. Algorithms 1 (1980), 359-373.
17. B. A. Shapiro and K. Zhanc;, Comparing multiple RNA secondary structures using three comparisons, Comput. Appl. Biosci. 6, No. 4 (1990), 309-318.
18. D. Shasha and K. Zhang. Fast algorithms for the unit cost editing distance between trees, J. Algorithms 11, No. 4 (1990), 581-621.
19. T. F. Smith and W. A. Beyer, Some biological sequence metrics, Adr. in Math. 20 (1976), 367-387.
20. J. L. Sussman and S. H. Kim, Three-dimensional structure of a transfer RNA in two crystal forms, Science 192 (1976), 853.
21. K.-C. Tai, The tree-to-tree correction problem, J. Assoc. Comput. Mach. 26, No. 3 (1979), 422-433.
22. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms 6 (1985), 132-137.
23. J. T. L. Wang, K. Jeong, K. Zhang, and D. Shasha, "Reference Manual for ATBE: A Tool for Approximate Tree Matching, " Technical Report TR-551, Courant Institute of Mathematical Sciences, New York University, Mar. 1991.
24. J. T. L. Wang, K. Zhang, K. Jeong, and D. Shasha, A system for approximate tree matching, IEEE Trans. Knowledge Data Eng., in press (1994).
25. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18, No. 6 (1989), 1245-1262.
26. K. Zhang, D. Shasha, and J. T. L. Wang, "Approximate Tree Matching in the Presence of Variable Length Don't Cares, " Technical Report TR-328, Department of Computer Science, The University of Western Ontario, 1992.
27. K. Zhang, D. Shasha, and J. T. L. Wang, Fast serial and parallel algorithms for approximate tree matching with VLDCs, in "Proceedings, 3rd Annual Symp. on Combinatorial Pattern Matching, Tucson, AZ, April 1992, pp. 148-158.