A Linear Tree Edit Distance Algorithm for Similar Ordered Trees

  • Hélène Touzet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hélène Touzet
    • 1
  1. 1.LIFL – UMR CNRS 8022, Université Lille 1Villeneuve d’Ascq cedexFrance

Personalised recommendations