Skip to main content
SpringerLink
Log in

Edit Distance between Unlabelled Ordered Trees

  • Conference paper
Mathematics and Computer Science III

Part of the book series: Trends in Mathematics ((TM))

  • 595 Accesses

Abstract

We introduce sorted permutations [1, 2] and show that they are in one-to-one correspondence with ordered trees.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. M. Bousquet-Mélou. Sorted and/or sortable permutations.Disc. Math.225:25–50, 2000.

    Article  MATH  Google Scholar 

  2. J. West.Permutations and restricted subsequences and Stack-sortable permutations.PhD thesis, M.I.T., 1990.

    Google Scholar 

  3. D.E. Knuth.The Art of Computer Programming: Fundamental Algorithmspage 533. Addison-Wesley, 1973.

    Google Scholar 

  4. P. Bose, J.F. Buss, and A. Lubiw. Pattern matching for permutations.Inf. Proc. Letters65:277–283, 1998.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. N.G. De Bruijn, D.E. Knuth, and S.O. Rice.Graph theory and Computationchapter The average height of planted plane trees. Academic Press, 1972.

    Google Scholar 

  7. E. Roblet and X.G. Viennot. Théorie combinatoire des t-fractions et approximants de Padé en deux points.Disc. Math.153:271–288, 1996.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIAFA, Université Paris 7, 2 Place Jussieu, Paris, 75251, Cedex 05, France

    Anne Micheli & Dominique Rossin

Authors
  1. Anne Micheli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominique Rossin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, Wien, 1040, Austria

    Michael Drmota  & Bernhard Gittenberger  & 

  2. INRIA Rocquencourt, Le Chesnay, 78153, France

    Philippe Flajolet

  3. PRISM, Université de Versailles-St-Quentin, Bâtiment Descartes 45 avenue des Etats-Unis, Versailles Cedex, 78035, France

    Danièle Gardy

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Basel AG

About this paper

Cite this paper

Micheli, A., Rossin, D. (2004). Edit Distance between Unlabelled Ordered Trees. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds) Mathematics and Computer Science III. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7915-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7915-6_26

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9620-7

  • Online ISBN: 978-3-0348-7915-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation