Exact algorithms for computing the tree edit distance between unordered trees

Authors:
Tatsuya Akutsu;Daiji Fukagawa;Atsuhiro Takasu;Takeyuki Tamura
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan;National Institute of Informatics, Tokyo 101-8430, Japan;National Institute of Informatics, Tokyo 101-8430, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan
Venue:
Theoretical Computer Science
Year:
2011

Citing 11
Cited 7

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
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
On an algorithm of Zemlyachenko for subtree isomorphism

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
Parameterized Complexity

Parameterized Complexity

Efficient exponential time algorithms for edit distance between unordered trees

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Tree Echo State Networks

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

Theoretical Computer Science
An input-output hidden Markov model for tree transductions

Neurocomputing
Neighborhood-Preserving mapping between trees

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
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
Efficient exponential-time algorithms for edit distance between unordered trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents a fixed-parameter algorithm for the tree edit distance problem for unordered trees under the unit cost model that works in O(2.62^k@?poly(n)) time and O(n^2) space, where the parameter k is the maximum bound of the edit distance and n is the maximum size of input trees. This paper also presents polynomial-time algorithms for the case where the maximum degree of the largest common subtree is bounded by a constant.