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

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!