Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Combinatorial Pattern Matching

CPM 2003: Combinatorial Pattern Matching pp 83–95Cite as

Analysis of Tree Edit Distance Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2676))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI — Université Bordeaux I, 33 405, Talence cedex, France

    Serge Dulucq

  2. LIFL — Université Lille 1, 59 655, Villeneuve d’Ascq cedex, France

    Hélène Touzet

Authors
  1. Serge Dulucq
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hélène Touzet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Depto. de Ciencias de la Computación, Universidad de Chile, Blanco Encalada 2120, Santiago, 6511224, Chile

    Ricardo Baeza-Yates

  2. Escuela de Ciencias Físico-Matemáticas, Universidad Michoacana, Edificio “B”, ciudad universitaria, Morelia Michoacán, Mexico

    Edgar Chávez

  3. Université de Marne-la-Vallée, 77454, Marne-la-Vallée Cedex 2, France

    Maxime Crochemore

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dulucq, S., Touzet, H. (2003). Analysis of Tree Edit Distance Algorithms. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds) Combinatorial Pattern Matching. CPM 2003. Lecture Notes in Computer Science, vol 2676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44888-8_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44888-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40311-1

  • Online ISBN: 978-3-540-44888-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation