Skip to main content
SpringerLink
Log in

Suffix Tree Based Data Compression

  • Conference paper
SOFSEM 2005: Theory and Practice of Computer Science (SOFSEM 2005)

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

Abstract

Suffix tree is a widely studied data structure with a range of applications. Although originally developed for string matching algorithms, it has proved to be useful for implementation of various lossless data compression methods. This interesting fact inspired us to explore the possibilities of creating new data compression methods, based entirely on properties of suffix trees. Resulting from a thorough study of existing suffix tree construction algorithms and their modifications, we propose and evaluate several variants of suffix tree based compression.

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. Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11 (1973)

    Google Scholar 

  2. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Research Report 124, Digital Systems Research Center, Palo Alto, California, USA (1994)

    Google Scholar 

  3. Cleary, J.G., Witten, I.H.: Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications COM-32, 396–402 (1984)

    Article  Google Scholar 

  4. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory IT-23, 337–343 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the Association for Computing Machinery 23, 262–272 (1976)

    MATH  MathSciNet  Google Scholar 

  6. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249–260 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pp. 137–143 (1997)

    Google Scholar 

  8. Fiala, E.R., Greene, D.H.: Data compression with finite windows. Communications of the Association for Computing Machinery 32, 490–505 (1989)

    Google Scholar 

  9. Larsson, N.J.: Structures of String Matching and Data Compression. PhD thesis, Department of Computer Science, Lund University, Sweden (1999)

    Google Scholar 

  10. Harary, F.: Graph Theory. Addison-Wesley, New York (1969)

    Google Scholar 

  11. Balkenhol, B., Kurtz, S., Shtarkov, Y.M.: Modifications of the Burrows and Wheeler data compression algorithm. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference, pp. 188–197 (1999)

    Google Scholar 

  12. Hoang, D.T., Long, P.M., Vitter, J.S.: Dictionary selection using partial matching. Information Sciences 119, 57–72 (1999)

    Article  Google Scholar 

  13. Bloom, C.R.: LZP: A new data compression algorithm. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference, p. 425 (1996), http://www.cbloom.com/src/index_lz.html

  14. Stuiver, L., Moffat, A.: Piecewise integer mapping for arithmetic coding. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference, pp. 3–12 (1998)

    Google Scholar 

  15. Schindler, M.: Byte oriented arithmetic coding. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference (1998) (Poster presentation)

    Google Scholar 

  16. Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Transactions on Information Systems 16, 256–294 (1998)

    Article  Google Scholar 

  17. Bell, T., Witten, I.H., Cleary, J.G.: Modelling for text compression. ACM Computing Surveys 21, 557–591 (1989)

    Article  Google Scholar 

  18. Senft, M.: Lossless data compression using suffix trees. Master’s thesis, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic (2003) (in czech)

    Google Scholar 

  19. Seward, J.: BZip2, http://sources.redhat.com/bzip2/

  20. Willems, F.M.J., Shtarkov, Y.M., Tjalkens, T.J.: The context-tree weighting method: Basic properties. IEEE Transactions on Information Theory IT-41, 653–664 (1995)

    Article  MATH  Google Scholar 

  21. Franken, E., Peeters, M., Tjalkens, T.J.: CTW 0.1b2, http://www.ele.tue.nl/ctw

  22. Gailly, J.L.: GZip, http://www.gzip.org/

  23. Arnold, R., Bell, T.: A corpus for the evaluation of lossless compression algorithms. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference, pp. 201–210 (1997), http://corpus.canterbury.ac.cz/

  24. Torvalds, L., et al.: Linux, ftp://ftp.cz.kernel.org/pub/linux/

  25. Shkarin, D.: PPM: One step to practicality. In: Storer, J., Cohn, M. (eds.) IEEE Data Compression Conference, pp. 202–211 (2002)

    Google Scholar 

  26. Inenaga, S., et al.: On-line construction of compact directed acyclic word graph. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 169–180. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Inenaga, S., Shinohara, A., Takeda, M., Arikawa, S.: Compact directed acyclic word graphs for a sliding window. Journal of Discrete Algorithms 2, 25–51 (2004) (special issue for SPIRE 2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 118 00, Praha, Czech Republic

    Martin Senft

Authors
  1. Martin Senft
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Peter Vojtáš

  2. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava,  

    Mária Bieliková

  3. STIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  4. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Senft, M. (2005). Suffix Tree Based Data Compression. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24302-1

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation