Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1998: Algorithms — ESA’ 98 pp 91–102Cite as

Computing the Edit-Distance Between Unrooted Ordered Trees

  • Conference paper
  • First Online:

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

Abstract

An ordered tree is a tree in which each node’s incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n 3 log n) algorithm to compute the edit distance between two ordered trees.

research supported by NSF Grant CCR-9700146

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. J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, 1987.

    Google Scholar 

  2. M. Maes, “On a cyclic string-to-string correction problem,” Information Processing Letters 35 (1990), pp. 73–78.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. A. Shapiro, “An algorithm for comparing multiple RNA secondary structures,” Computer Applications in the Biosciences (1988), pp. 387–393.

    Google Scholar 

  4. D. D. Sleator and R. E. Tarjan, “A data structure for dynamic trees,” Journal of Computer and System Sciences 26 (1983), pp. 362–391.

    Article  MATH  MathSciNet  Google Scholar 

  5. K.-C. Tai, “The tree-to-tree correction problem”, Journal of the Association for Computing Machinery 26 (1979), pp. 422–433.

    MATH  MathSciNet  Google Scholar 

  6. Srikanta Tirthapura, personal communication, 1998.

    Google Scholar 

  7. R. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” Journal of the Association for Computing Machinery 21, (1974), pp. 168–173.

    MATH  MathSciNet  Google Scholar 

  8. J. T.-L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A system for approximate tree matching,” IEEE Transactions on Knowledge and Data Engineering 6 (1994), pp. 559–571. 5

    Article  Google Scholar 

  9. K. Zhang, “A constrained edit distance between unordered labeled trees,” Algorithmica 15 (1996), pp. 205–222.

    Article  MATH  MathSciNet  Google Scholar 

  10. K. Zhang and D. Shasha, “Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal on Computing 18 (1989), pp. 1245–1262.

    Article  MATH  MathSciNet  Google Scholar 

  11. K. Zhang and D. Shasha, “Approximate tree pattern matching,” Chapter 14 of Pattern Matching Algorithms, Oxford University Press (1997)

    Google Scholar 

  12. K. Zhang, R. Statman and D. Shasha, “On the editing distance between unordered labeled trees,” Information Processing Letters 42 (1992), pp. 133–139

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brown University, USA

    Philip N. Klein

Authors
  1. Philip N. Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klein, P.N. (1998). Computing the Edit-Distance Between Unrooted Ordered Trees. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation