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,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 470; S. 10 - 22
Hauptverfasser:	Akutsu, Tatsuya, Fukagawa, Daiji, Halldórsson, Magnús M., Takasu, Atsuhiro, Tanaka, Keisuke
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 28.01.2013
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!