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

Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 470; s. 10 - 22
Hlavní autoři: Akutsu, Tatsuya, Fukagawa, Daiji, Halldórsson, Magnús M., Takasu, Atsuhiro, Tanaka, Keisuke
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 28.01.2013
Témata:
Approximation algorithms
Dynamic programming
Parameterized algorithms
Tree edit distance
Unordered trees
Approximation algorithms
Tree edit distance
Parameterized algorithms
Dynamic programming
Unordered trees
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions, deletions and substitutions that converts a tree into another given tree. Both problems are known to be hard to approximate within some constant factor in general. We tackle these problems from two perspectives: giving exact algorithms, either for special cases or in terms of some parameters; and approximation algorithms and hardness of approximation. We present a parameterized algorithm in terms of the number of branching nodes that solves both problems and yields polynomial algorithms for several special classes of trees. This is complemented with a tighter APX-hardness proof that holds when the trees are of height one and two, respectively. Furthermore, we present the first approximation algorithms for both problems. In particular, for the common subtree problem for t trees, we present an algorithm achieving a tlog2(bOPT+1) ratio, where bOPT is the number of branching nodes in the optimal solution. We also present constant factor approximation algorithms for both problems in the case of bounded height trees.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.11.017