Skip to main content
SpringerLink
Log in

Two Combinatorial Criteria for BWT Images

  • Conference paper
Computer Science – Theory and Applications (CSR 2011)

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

Included in the following conference series:

Abstract

Burrows–Wheeler transform (BWT) is a block data transformation, i.e. a function on finite words. This function is used in lossless data compression algorithms and possesses interesting combinatorial properties. We study some of these properties. Namely, we prove two necessary and sufficient conditions concerning BWT images. The first one describes the words that are BWT images, while the second one explains which words can be converted to BWT images using a natural “pumping” procedure. Both conditions can be checked in linear time.

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. Burrows, M., Wheeler, D.J.: A Block-sorting lossless data compression algorithm. SRC Research Report 124, Digital Systems Research Center, Palo Alto (1994)

    Google Scholar 

  2. BWT compression comparison, http://compressionratings.com/bwt.html

  3. Comtet, L.: Advanced combinatorics. Reidel, Dordrecht (1974)

    Book  MATH  Google Scholar 

  4. 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  MATH  Google Scholar 

  5. Duval, J.-P., Lefebvre, A.: Words over ordered alphabet and suffix permutations. RAIRO Theor. Inform. Appl. 36, 249–259 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ferragina, P., Manzini, G., Muthukrishnan, S. (eds.): The Burrows–Wheeler transform: special issue of Theor. Comput. Sci., vol. 387(3) (2007)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Mantaci, S., Restivo, A., Sciortino, M.: Combinatorial aspects of the Burrows-Wheeler transform. In: Proc. WORDS 2003, vol. 27, pp. 292–297. TUCS Gen. Publ. (2003)

    Google Scholar 

  9. Manzini, J.: An analysis of the Burrows–Wheeler transform. J. ACM 48(3), 207–230 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Simpson, J., Puglisi, S.J.: Words with simple Burrows–Wheeler transforms. Electronic J. Comb. 15, #R83 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, Russia

    Konstantin M. Likhomanov & Arseny M. Shur

Authors
  1. Konstantin M. Likhomanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arseny M. Shur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023, St.Petersburg, Russia

    Alexander Kulikov

  2. Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Leninskie gory, 119991, Moscow, Russia

    Nikolay Vereshchagin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Likhomanov, K.M., Shur, A.M. (2011). Two Combinatorial Criteria for BWT Images. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20712-9_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20711-2

  • Online ISBN: 978-3-642-20712-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation