Efficient exponential time algorithms for edit distance between unordered trees

Authors:
Tatsuya Akutsu;Takeyuki Tamura;Daiji Fukagawa;Atsuhiro Takasu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan;Faculty of Culture and Information Science, Doshisha University, Kyoto, Japan;National Institute of Informatics, Tokyo, Japan
Venue:
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Year:
2012

Citing 13
Cited 2

On the editing distance between unordered labeled trees

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

Information Processing Letters
Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
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
Improved approximation of the largest common subtree of two unordered trees of bounded height

Information Processing Letters
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
An optimal decomposition algorithm for tree edit distance

ACM Transactions on Algorithms (TALG)
Exact algorithms for computing the tree edit distance between unordered trees

Theoretical Computer Science
Improved MAX SNP-hard results for finding an edit distance between unordered trees

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On tree-constrained matchings and generalizations

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures

CISIS '11 Proceedings of the 2011 International Conference on Complex, Intelligent, and Software Intensive Systems

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Theoretical Computer Science
On the complexity of finding a largest common subtree of bounded degree

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known to be NP-hard. For a general case, an $O(1.26^{n_1+n_2})$ time algorithm is presented, where n1 and n2 are the numbers of nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in $O((1+\epsilon)^{n_1+n_2})$ time for any fixed ε0. This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees.