Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
On distances between phylogenetic trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
A survey on tree edit distance and related problems
Theoretical Computer Science
Melody Recognition with Learned Edit Distances
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Tree Representation in Combined Polyphonic Music Comparison
Computer Music Modeling and Retrieval. Genesis of Meaning in Sound and Music
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
New partially labelled tree similarity measure: a case study
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
| Hi-index | 0.01 |
In a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.