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

Authors:
Tatsuya Akutsu;Daiji Fukagawa;Atsuhiro Takasu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto 611-0011, Japan;National Institute of Informatics, Tokyo 101-8430, Japan;National Institute of Informatics, Tokyo 101-8430, Japan
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 4

On the editing distance between unordered labeled trees

Information Processing Letters
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
Approximation and Special Cases of Common Subtrees and Editing Distance

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
A survey on tree edit distance and related problems

Theoretical Computer Science
An optimal decomposition algorithm for tree edit distance

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Efficient exponential time algorithms for edit distance between unordered trees

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Theoretical Computer Science
Efficient exponential-time algorithms for edit distance between unordered trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a polynomial time 1.5h-approximation algorithm for the problem of finding the largest common subtree between two rooted, labeled, and unordered trees of height at most h, where a tree S is called a subtree of a tree T if S is obtained from T by deletion of some nodes in T. This result improves the previous 2h-approximation algorithm.