Skip to main content
SpringerLink
Log in

Tight Bounds for Top Tree Compression

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2017)

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

Included in the following conference series:

Abstract

We consider compressing labeled, ordered and rooted trees using DAG compression and top tree compression. We show that there exists a family of trees such that the size of the DAG compression is always a logarithmic factor smaller than the size of the top tree compression (even for an alphabet of size 1). The result settles an open problem from Bille et al. (Inform. and Comput., 2015).

P. Bille and I.L. Gørtz—Partially supported by the Danish Research Council (DFF - 4005-00267).

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 EPUB and 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

References

  1. Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Proceedings of 24th ICALP, pp. 270–280 (1997)

    Google Scholar 

  2. Alstrup, S., Holm, J., Thorup, M.: Maintaining center and median in dynamic trees. In: Proceedings of 7th SWAT, pp. 46–56 (2000)

    Google Scholar 

  3. Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inform. Comput. 243, 166–177 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27(4), 758–771 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hübschle-Schneider, L., Raman, R.: Tree compression with top trees revisited. In: Proceedings of 14th SEA, pp. 15–27 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DTU Compute, Technical University of Denmark, Richard Petersens Plads, 2800, Kgs. Lyngby, Denmark

    Philip Bille, Finn Fernstrøm & Inge Li Gørtz

Authors
  1. Philip Bille
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Finn Fernstrøm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Inge Li Gørtz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Philip Bille .

Editor information

Editors and Affiliations

  1. Università di Palermo, Palermo, Italy

    Gabriele Fici

  2. Università di Palermo, Palermo, Italy

    Marinella Sciortino

  3. Università di Pisa, Pisa, Italy

    Rossano Venturini

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bille, P., Fernstrøm, F., Gørtz, I.L. (2017). Tight Bounds for Top Tree Compression. In: Fici, G., Sciortino, M., Venturini, R. (eds) String Processing and Information Retrieval. SPIRE 2017. Lecture Notes in Computer Science(), vol 10508. Springer, Cham. https://doi.org/10.1007/978-3-319-67428-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67428-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67427-8

  • Online ISBN: 978-3-319-67428-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation