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á bibliografia

Vydané v:	Theoretical computer science Ročník 470; s. 10 - 22
Hlavní autori:	Akutsu, Tatsuya, Fukagawa, Daiji, Halldórsson, Magnús M., Takasu, Atsuhiro, Tanaka, Keisuke
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 28.01.2013
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!