An efficient bottom-up distance between trees

Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001

Volumn , Issue , 2001, Pages 212-219

  Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Combinatorial problems; Design and analysis of algorithms; Edit distance; Graph algorithms; Largest common forest; Metric space; Pattern matching; Subtree isomorphism; Tree isomorphism; Tree pattern matching

Indexed keywords

INFORMATION RETRIEVAL; PATTERN MATCHING; SET THEORY;

COMBINATORIAL PROBLEM; DESIGN AND ANALYSIS OF ALGORITHMS; EDIT DISTANCE; GRAPH ALGORITHMS; LARGEST COMMON FOREST; METRIC SPACES; SUBTREE ISOMORPHISM; TREE ISOMORPHISM; TREE-PATTERN MATCHING;

FORESTRY;

EID: 84963877855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2001.989761     Document Type: Conference Paper

References (33)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. J.-I. Aoe, editor. Computer Algorithms: String Pattern Matching Strategies. IEEE Computer Science Press, 1994.
3. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett., 18(8):689-694, 1997.
4. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett., 19(3-4):255-259, 1998.
5. Y. C. Cheng and S. Y. Lu. Waveform correlation by tree matching. IEEE Trans. Pattern Anal. Machine Intell., 7(3):299-305, 1985.
6. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
7. Y. Dinitz, A. Itai, and M. Rodeh. On an algorithm of Zemlyachenko for subtree isomorphism. Inform. Process. Lett., 70(3):141-146, 1999.
8. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. J. ACM, 27(4):758-771, 1980.
9. M.-L. Fernández and G. Valiente. A graph distance measure combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett., 22(6-7):753-758, 2001.
10. P. Flajolet, P. Sipala, and J.-M. Steyaert. Analytic variations on the common subexpression problem. In Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Science, pages 220-234. Springer-Verlag, 1990.
11. P. Flajolet and J.-M. Steyaert. A complexity calculus for recursive tree algorithms. Math. Syst. Theory, 19(4):301-331, 1987.
12. R. Grossi. On finding common subtrees. Theor. Comput. Sci., 108(2):345-356, 1993.
13. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
14. T. Jiang, L. Wang, and K. Zhang. Alignment of trees - an alternative to tree edit. Theor. Comput. Sci., 143(1):137-148, 1995.
15. P. Kilpeläinen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proc. 16th Annual ACM Conf. Research and Development in Information Retrieval, pages 214-222, 1993.
16. B. Moayer and K. S. Fu. A tree system approach for fingerprint pattern recognition. IEEE Trans. Pattern Anal. Machine Intell., 8(3):376-387, 1986.
17. G. Rozenberg, editor. Foundations, volume 1 of Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific, 1997.
18. H. Samet. Distance transform for images represented by quadtrees. IEEE Trans. Pattern Anal. Machine Intell., 4(3):298-303, 1982.
19. S. M. Selkow. The tree-to-tree editing problem. Inform. Process. Lett., 6(6):184-186, 1977.
20. B. A. Shapiro and K. Zhang. Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci., 6(4):309-318, 1990.
21. D. Shasha and K. Zhang. Fast algorithms for the unit cost editing distance between trees. J. Algorithms, 11(4):581-621, 1990.
22. R. Sleep, R. Plasmeijer, and M. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley & Sons, 1993.
23. G. A. Stephen. String Searching Algorithms. World Scientific Press, 1994.
24. R. E. Stobaugh. Chemical substructure searching. J. Chem. Inf. Comp. Sci., 25(3):271-275, 1985.
25. K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
26. E. Tanaka and K. Tanaka. The tree-to-tree editing problem. Int. J. Pattern Recogn. and Artif. Intell., 2(2):221-240. 1988.
27. G. Valiente. Simple and efficient subtree isomorphism. Technical Report LSI-00-72-R, Technical University of Catalonia, Department of Software, 2000.
28. G. Valiente. Simple and efficient tree comparison. Technical Report LSI-01-1-R, Technical University of Catalonia, Department of Software, 2001.
29. J. T.-L. Wang and K. Zhang. Finding similar consensus between trees: An algorithm and a distance hierarchy. Pattern Recogn., 34(1):127-137, 2001.
30. W. Yang. Identifying syntactic differences between two programs. Software - Practice and Experience, 21(7):739-755, 1991.
31. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245-1262, 1989.
32. K. Zhang and D. Shasha. Tree pattern matching. In A. Apostolico and Z. Galil, editors, Pattern Matching Algorithms, chapter 11. Oxford University Press, 1997.
33. K. Zhang, R. Statman, and D. Shasha. On the editing distance between unordered labeled trees. Inform. Process. Lett., 42(3):133-139, 1992.