Skip to main content
SpringerLink
Log in

A Linear Tree Edit Distance Algorithm for Similar Ordered Trees

  • Conference paper
Combinatorial Pattern Matching (CPM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3537))

Included in the following conference series:

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(nk 3) 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.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chawathe, S.: Comparing hierarchical data in external memory. In: Twenty-fifth International Conference on Very Large Data Bases, pp. 90–101 (1999)

    Google Scholar 

  2. Dulucq, S., Tichit, L.: RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. Theoretical Computer Science 306(1- 3), 471–484 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dulucq, S., Touzet, H.: Analysis of tree edit distance algorithms. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 83–95. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Höchsmann, M., Töller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: IEEE Bioinformatics Conference, pp. 159–168 (2003)

    Google Scholar 

  5. Jansson, J., Trung Hieu, N., Sung, W.-K.: Local gapped subforest alignment and its application in finding RNA structural motifs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 569–580. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Jansson, J., Lingas, A.: A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae 56(1,2), 105–120 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoretical Computer Science 143(1), 137–148 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91–102. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Setubal, J., Meidanis, J.: Sequence Comparison and Database Search. In: Introduction to computational biology, International Thomson Publishing Company (1997)

    Google Scholar 

  10. Tai, K.C.: The tree-to-tree correction problem. Journal of the Association for Comput. Machi. 26, 422–433 (1979)

    MATH  MathSciNet  Google Scholar 

  11. Valiente, G.: Algorithms on Trees and Graphs. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  12. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing 18(6), 1245–1262 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL – UMR CNRS 8022, Université Lille 1, 59 655, Villeneuve d’Ascq cedex, France

    Hélène Touzet

Authors
  1. Hélène Touzet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Université Paris-Est, France

    Maxime Crochemore

  3. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Touzet, H. (2005). A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. In: Apostolico, A., Crochemore, M., Park, K. (eds) Combinatorial Pattern Matching. CPM 2005. Lecture Notes in Computer Science, vol 3537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496656_29

Download citation

  • DOI: https://doi.org/10.1007/11496656_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26201-5

  • Online ISBN: 978-3-540-31562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation