Analysis of tree edit distance algorithms

  • Dulucq S
  • 34


    Mendeley users who have this article in their library.
  • 22


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Serge Dulucq

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free