All common embedded subtrees for measuring tree similarity

Proceedings of the 2008 International Symposium on Computational Intelligence and Design, ISCID 2008

Volumn 1, Issue , 2008, Pages 29-32

  Lin, Zhiwei ^a   Wang, Hui ^a   McClean, Sally ^a   Liu, Chang ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON INFORMATIONS; EFFECTIVE ALGORITHMS; EXPERIMENTAL EVALUATIONS; INHERENT COMPLEXITY; SEARCH SPACES; SIMILARITY MEASUREMENTS; SUBTREE; SUBTREES; TREE EDIT DISTANCES;

ARTIFICIAL INTELLIGENCE; INFORMATION MANAGEMENT; INTELLIGENT CONTROL;

TREES (MATHEMATICS);

EID: 61349127272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCID.2008.20     Document Type: Conference Paper

References (8)

1. T. Akutsu and M. M. Halldorsson. On the approximation of largest common point sets and largest common subtrees. In Proc. of 5th Ann. Int. Symp. on Algorithms and Computation, pages 405-413, 1994.
2. P. Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1-3), 2005.
3. S.S. Chawathe, A. Rajaraman, H. Garcia-Molina, J. Widom, Change Detection in Hierarchically Structured Information. In Proceedings of the ACM SIG-MOD Conference, USA, Pages 493-504, 1996,
4. S.S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the VLDB Conference, pages 90-101, Edinburgh, UK 1999.
5. Y. Chi. R.R. Muntz. S. Nijssen. J.N. Kok. Frequent subtree mining-an overview. Fundamenta Informat-icae, Pages 161-198, 66(l-2),2005.
6. S. Khanna, R. Motwani, and F. F. Yao. Approximation algorithms for the largest common subtree problem. Technical report, Stanford University, 1995.
7. S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6:184-186, Dec 1977.
8. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18:1245-1262, Dec 1989.