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
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Local Similarity in RNA Secondary Structures
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
RNA Secondary structure comparison: exact analysis of the Zhang--Shasha tree edit algorithm
Theoretical Computer Science
A fast algorithm for optimal alignment between similar ordered trees
Fundamenta Informaticae - Special issue on computing patterns in strings
Analysis of tree edit distance algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Local gapped subforest alignment and its application in finding RNA structural motifs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On approximate matching of programs for protecting libre software
CASCON '06 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Fast algorithms for computing tree LCS
Theoretical Computer Science
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Algorithms for forest pattern matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Forest alignment with affine gaps and anchors
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Algorithms for finding a most similar subforest
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Complexity of computing distances between geometric trees
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Forest alignment with affine gaps and anchors, applied in RNA structure comparison
Theoretical Computer Science
| Hi-index | 0.01 |
We describe a linear algorithm for comparing two similar ordered rooted trees with node labels. The method for comparing trees is the usual tree edit distance. We show that an optimal mapping which uses at most k insertions or deletions can then be constructed in O(nk3) where n is the size of the trees. The approach is inspired by the Zhang-Shasha algorithm for tree edit distance in combination with an adequate pruning of the search space.