Skip to main content
SpringerLink
Log in

Approximating Tree Edit Distance Through String Edit Distance

  • Conference paper
Algorithms and Computation (ISAAC 2006)

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

Included in the following conference series:

Abstract

This paper presents an O(n 2) time algorithm for approximating the unit cost edit distance for ordered and rooted trees of bounded degree within a factor of O(n 3/4), where n is the maximum size of two input trees, and the algorithm is based on transformation of an ordered and rooted tree into a string.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Akutsu, T.: A relation between edit distance for ordered trees and edit distance for Euler strings. Information Processing Letters 100, 105–109 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Batu, T., Ergun, F., Sahinalp, C.: Oblivious string embeddings and edit distance approximations. In: Proc. 17th ACM-SIAM Symp. Discrete Algorithms, pp. 792–801 (2006)

    Google Scholar 

  3. Bille, P.: A survey on tree edit distance and related problem. Theoretical Computer Science 337, 217–239 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, W.: New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms 40, 135–158 (2001)

    Article  MATH  Google Scholar 

  5. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pp. 667–676 (2002)

    Google Scholar 

  6. Demaine, E., Mozes, S., Rossman, B., Weimann, O.: An O(n3)-time algorithm for tree edit distance. Preprint cs.DS/0604037 (2006)

    Google Scholar 

  7. Fukagawa, D., Akutsu, T.: Fast algorithms for comparison of similar unordered trees. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 452–463. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Garofalakis, M., Kumar, A.: XML stream processing using tree-edit distance embedding. ACM Trans. Database Systems 30, 279–332 (2005)

    Article  Google Scholar 

  9. Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML joins. In: Proc. ACM SIGMOD, pp. 287–298 (2002)

    Google Scholar 

  10. Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. In: Proc. 46th IEEE Symp. Foundations on Computer Science, pp. 101–110 (2005)

    Google Scholar 

  11. Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proc. 6th European Symp. Algorithms, pp. 91–102 (1998)

    Google Scholar 

  12. Krauthgamer, R., Rabani, R.: Improved lower bounds for embeddings into L 1. In: Proc. 17th ACM-SIAM Symp. Discrete Algorithms, pp. 1010–1017 (2006)

    Google Scholar 

  13. Ostrovsky, R., Rabani, Y.: Low distortion embeddings for edit distance. In: Proc. 37th ACM Symp. Theory of Computing, pp. 218–224 (2005)

    Google Scholar 

  14. Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  16. Yang, R., Kalnis, P., Tang, A.K.H.: Similarity evaluation on tree-structured data. In: Proc. ACM SIGMOD, pp. 754–765 (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan

    Tatsuya Akutsu

  2. National Institute of Informatics, Chiyoda-ku, Tokyo, 101-8430, Japan

    Daiji Fukagawa & Atsuhiro Takasu

Authors
  1. Tatsuya Akutsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daiji Fukagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Atsuhiro Takasu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Japan

    Tetsuo Asano

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akutsu, T., Fukagawa, D., Takasu, A. (2006). Approximating Tree Edit Distance Through String Edit Distance. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_11

Download citation

  • DOI: https://doi.org/10.1007/11940128_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49694-6

  • Online ISBN: 978-3-540-49696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation