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
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
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
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |
We describe a linear-time 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 that uses at most k insertions or deletions can then be constructed in O(nk^3) 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 based on the tree edit graph.