Skip to main content
Springer Nature Link
Log in

Burrows-Wheeler Transform of Words Defined by Morphisms

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2019)

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

Included in the following conference series:

Abstract

The Burrows-Wheeler transform (BWT) is a popular method used for text compression. It was proved that BWT has optimal performance on standard words, i.e. the building blocks of Sturmian words. In this paper, we study the application of BWT on more general morphic words: the Thue-Morse word and to generalizations of the Fibonacci word to alphabets with more than two letters; then, we study morphisms obtained as composition of the Thue-Morse morphism with a Sturmian one. In all these cases, the BWT efficiently clusters the iterates of the morphisms generating prefixes of these infinite words, for which we determine the compression clustering ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, New York (2008). https://doi.org/10.1007/978-0-387-78909-5

    Book  Google Scholar 

  2. Barcucci, E., Bélanger, L., Brlek, S.: On Tribonacci sequences. Fibonacci Quart. 42, 314–319 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Berstel, J.: Axel Thue’s papers on repetitions in words: a translation, Publications du LaCIM 20, Montreal (1995)

    Google Scholar 

  4. Burrows, M., Wheeler, D.J.: A Block-Sorting Lossless Data Compression Algorithm. Digital Systems Research Center Research Reports (1995)

    Google Scholar 

  5. Crochemore, M., Désarménien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theor. Comput. Sci. 332(1–3), 567–572 (2005)

    Article  MathSciNet  Google Scholar 

  6. Ferenczi, S., Zamboni, L.Q.: Clustering words and interval exchanges. J. Integer Sequences 16(2), Article 13.2.1 (2013)

    Google Scholar 

  7. Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM 52(4), 688–713 (2005)

    Article  MathSciNet  Google Scholar 

  8. Gessel, I., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Comb. Theory Ser. A 64(2), 189–215 (1993)

    Article  MathSciNet  Google Scholar 

  9. Hedlund, G.A., Morse, M.: Symbolic dynamics. Am. J. Math. 60, 815–866 (1938)

    Article  MathSciNet  Google Scholar 

  10. Kaplan, H., Landau, S., Verbin, E.: A simpler analysis of Burrows-Wheeler based compression. Theor. Comput. Sci. 387(3), 220–235 (2007)

    Article  MathSciNet  Google Scholar 

  11. Lothaire, M.: Algebraic Combinatorics on Words \((\)Encyclopedia of Mathematics and its Applications\()\). Cambridge University Press, Cambridge (2002)

    Book  Google Scholar 

  12. Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Burrows-Wheeler transform and run-length enconding. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, É. (eds.) WORDS 2017. LNCS, vol. 10432, pp. 228–239. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66396-8_21

    Chapter  MATH  Google Scholar 

  13. Mantaci, S., Restivo, A., Rosone, G., Sciortino, M., Versari, L.: Measuring the clustering effect of BWT via RLE. Theor. Comput. Sci. 698, 79–87 (2017)

    Article  MathSciNet  Google Scholar 

  14. Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inf. Process. Lett. 86, 241–246 (2003)

    Article  MathSciNet  Google Scholar 

  15. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM (JACM) 48, 669–677 (1999)

    MathSciNet  MATH  Google Scholar 

  16. OEIS Foundation Inc.: The On-line Encyclopedia of Integer Sequences (2011). http://oeis.org

  17. Restivo, A., Rosone, G.: Balanced words having simple Burrows-Wheeler transform. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 431–442. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02737-6_35

    Chapter  Google Scholar 

  18. Restivo, A., Rosone, G.: Balancing and clustering of words in the Burrows-Wheeler transform. Theor. Comput. Sci. 412(27), 3019–3032 (2011)

    Article  MathSciNet  Google Scholar 

  19. Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theor. Comput. Sci. 410(30–32), 3018–3026 (2009)

    Article  MathSciNet  Google Scholar 

  20. Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electr. J. Comb. 15, 83 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Tan, B., Wen, Z.-Y.: Some properties of the Tribonacci sequence. Eur. J. Comb. 28(6), 1703–1719 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de combinatoire et d’informatique mathématique, UQAM, Montreal, Canada

    Srecko Brlek

  2. Dipartimento di Matematica e Informatica “U. Dini”, Università di Firenze, Florence, Italy

    Andrea Frosini & Elisa Pergola

  3. Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche, Università di Siena, Siena, Italy

    Ilaria Mancini & Simone Rinaldi

Authors
  1. Srecko Brlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Frosini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ilaria Mancini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Elisa Pergola
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Simone Rinaldi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilaria Mancini .

Editor information

Editors and Affiliations

  1. Arizona State University, Tempe, AZ, USA

    Charles J. Colbourn

  2. University of Pisa, Pisa, Italy

    Roberto Grossi

  3. University of Pisa, Pisa, Italy

    Nadia Pisanti

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Brlek, S., Frosini, A., Mancini, I., Pergola, E., Rinaldi, S. (2019). Burrows-Wheeler Transform of Words Defined by Morphisms. In: Colbourn, C., Grossi, R., Pisanti, N. (eds) Combinatorial Algorithms. IWOCA 2019. Lecture Notes in Computer Science(), vol 11638. Springer, Cham. https://doi.org/10.1007/978-3-030-25005-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-25005-8_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-25004-1

  • Online ISBN: 978-3-030-25005-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics