Improved approximation of the largest common subtree of two unordered trees of bounded height

Information Processing Letters

Volumn 109, Issue 2, 2008, Pages 165-170

  Akutsu, Tatsuya ^a   Fukagawa, Daiji ^b   Takasu, Atsuhiro ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Approximation algorithms; Common subtrees; Edit distance; Unordered trees

Indexed keywords

POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

COMMON SUBTREES; EDIT DISTANCE; POLYNOMIAL TIMES; SUB TREES; UNORDERED TREES;

APPROXIMATION ALGORITHMS;

EID: 56049086000     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.09.025     Document Type: Article

References (8)

1. Bille P. A survey on tree edit distance and related problem. Theoretical Computer Science 337 (2005) 217-239
2. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), The MIT Press
3. Demaine E., Mozes S., Rossman B., and Weimann O. An optimal decomposition algorithm for tree edit distance. Proc. 34th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science vol. 4596 (2007) 146-157
4. Halldórsson M.M., and Tanaka K. Approximation and special cases of common subtrees and editing distance. Proc. 7th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 1178 (1996) 75-84
5. Tai K.-C. The tree-to-tree correction problem. J. ACM 26 (1979) 422-433
6. Zhang K., Statman R., and Shasha D. On the editing distance between unordered labeled trees. Information Processing Letters 42 (1992) 133-139
7. Zhang K., and Jiang T. Some MAX SNP-hard results concerning unordered labeled trees. Information Processing Letters 49 (1994) 249-254
8. Zhang K. A constrained edit distance between unordered labeled trees. Algorithmica 15 (1996) 205-222