Tree edit distance: Robust and memory-efficient

Hierarchical data are often modelled as trees. An interesting query identifies pairs of similar trees. The standard approach to tree similarity is the tree edit distance, which has successfully been applied in a wide range of applications. In terms of runtime, the state-of-the-art algorithm for the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information systems (Oxford) 2016-03, Vol.56, p.157-173
Hauptverfasser:	Pawlik, Mateusz, Augsten, Nikolaus
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximate matching Computation Information systems Run time (computers) Shape memory Similarity Similarity search Strategy Tree edit distance Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!