Identifying approximately common substructures in trees based on a restricted edit distance

Information sciences

Volumn 121, Issue 3, 1999, Pages 367-386

  Wang, Jason T L ^a   Zhang, Kaizhong ^b   Chang, Chia Yo ^a  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

LARGEST APPROXIMATELY COMMON SUBSTRUCTURES (LACS); TWO ORDERED LABELED TREES;

TREES (MATHEMATICS);

EID: 0033361356     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00100-0     Document Type: Article

References (22)

1. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
2. G.J.S. Chang, G. Patel, L. Relihan, J.T.L. Wang, A graphical environment for change detection in structured documents, in: Proceedings of the 21st Annual International Computer Software and Application Conference, Washington DC, August 1997, pp. 536-541.
3. Cheng Y.C., Lu S.Y. Waveform correlation by tree matching. IEEE Trans. Pattern Anal. Machine Intell. 7:1985;299-305.
4. Fox E.A., Heath L.S., Chen Q.F., Daoud A.M. Practical minimal perfect hash functions for large databases. Commun. ACM. 35(1):1992;105-121.
5. R. Grishman, Computational Linguistics, Cambridge University Press, New York, 1986.
6. Hein J., Jiang T., Wang L., Zhang K. On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71:1996;153-169.
7. T. Jiang, L. Wang, K. Zhang, Alignment of trees - an alternative to tree edit, in: M. Crochemore, D. Gusfield (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 75-86.
8. D. Keselman, A. Amir, Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms, in: Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, Santa Fe, NM, 1994, pp. 758-769.
9. A.S. Noetzel, S.M. Selkow, An analysis of the general tree-editing problem, in: D. Sankoff, J. B. Kruskal (Eds.), Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983, pp. 237-252.
10. Ramamoorthy C.V., Tsai W.T. Advances in software engineering. IEEE Comput. 29(10):1996;47-58.
11. Selkow S.M. The tree-to-tree editing problem. Inform. Process. Lett. 6(6):1977;184-186.
12. Smith T.F., Waterman M.S. Identification of common molecular subsequences. J. Mol. Biol. 147(1):1981;195-197.
13. Tai K.-C. The tree-to-tree correction problem. J. ACM. 26(3):1979;422-433.
14. Tanaka E., Tanaka K. The tree-to-tree editing problem. Int. J. Pattern Recog. Artificial Intell. 2(2):1988;221-240.
15. J.T.L. Wang, G.-W. Chirn, C.-Y. Chang, G. Chang, A. Noriega, K. Pysniak, An integrated toolkit for pattern matching and pattern discovery in scientific, program and document databases, in: Proceedings of the 7th International Conference on Software Engineering and Knowledge Engineering, Rockville, MD, June 1995, p. 497.
16. J.T.L. Wang, D. Shasha, G.J.S. Chang, L. Relihan, K. Zhang, G. Patel, Structural matching and discovery in document databases, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, AZ, May 1997, pp. 560-563.
17. Wang J.T.L., Zhang K., Jeong K., Shasha D. A system for approximate tree matching. IEEE Trans. Knowledge and Data Eng. 6(4):1994;559-571.
18. J.T.L. Wang, K. Zhang, D. Shasha, Pattern matching and pattern discovery in scientific, program, and document databases, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 1995, p. 487.
19. Yang W. Identifying syntactic differences between two programs. Software - Practice and Experience. 21(7):1991;739-755.
20. Zhang K. Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recog. 28(3):1995;463-474.
21. Zhang K., Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6):1989;1245-1262.
22. Zhang K., Shasha D., Wang J.T.L. Approximate tree matching in the presence of variable length don't cares. J. Algorithms. 16(1):1994;33-66.