Analysis of Tree Edit Distance Algorithms
- 513 Downloads
In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as  and . We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.
KeywordsCover Tree Recursive Call Edit Operation Special Forest Free Node
Unable to display preview. Download preview PDF.
- 1.S. Chawathe, “Comparing hierarchical data in external memory” Proceedings of the Twenty-fifth International Conference on Very Large Data Bases (1999), Edinburgh, Scotland, p. 90–101.Google Scholar
- 2.P. Klein, “Computing the edit-distance between unrooted ordered trees” Proceeding of 6th European Symposium on Algorithms (1998), p. 91–102.Google Scholar
- 3.B. Shapiro and K. Zhang, “Comparing multiple RNA secondary structures using tree comparisons”, Comput. Appl. Biosciences, Vol.4, 3 (1988), p. 387–393.Google Scholar