Analysis of Tree Edit Distance Algorithms

  • Serge Dulucq
  • Hélène Touzet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2676)


In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. 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.


Cover Tree Recursive Call Edit Operation Special Forest Free Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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
  4. 4.
    K. Zhang and D. Shasha, “Simple fast algorithms for the editing distance between trees and related problems” SIAM Journal of Computing, Vol 18-6, (1989), p. 1245–1262.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Serge Dulucq
    • 1
  • Hélène Touzet
    • 2
  1. 1.LaBRI — Université Bordeaux ITalence cedexFrance
  2. 2.LIFL — Université Lille 1Villeneuve d’Ascq cedexFrance

Personalised recommendations