Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Burrows-Wheeler Transform

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 117 Accesses

Years and Authors of Summarized Original Work

  • 1994; Burrows, Wheeler

Burrows-Wheeler Transform, Fig. 1
figure 28 figure 28

Example of Burrows-Wheeler transform for the string s = mississippi. The matrix on the right has the rows sorted in lexicographic order. The output of the bwt is the last column of the sorted matrix; in this example, the output is \(\hat{s} = bwt(s) = \mathit{ipssm{\$}pissii}\)

Full size image

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

Recommended Reading

  1. Bauer MJ, Cox AJ, Rosone G (2013) Lightweight algorithms for constructing and inverting the BWT of string collections. Theor Comput Sci 483:134–148

    Article  MathSciNet  MATH  Google Scholar 

  2. Bell TC, Cleary JG, Witten IH (1990) Text compression. Prentice Hall, Englewood Cliffs

    Google Scholar 

  3. Beller T, Zwerger M, Gog S, Ohlebusch E (2013) Space-efficient construction of the Burrows-Wheeler transform. In: Proceedings of the 20th international symposium on string processing and information retrieval (SPIRE), Jerusalem. LNCS, vol 8214. Springer, Berlin, pp 5–16

    Google Scholar 

  4. Bentley J, Sleator D, Tarjan R, Wei V (1986) A locally adaptive compression scheme. Commun ACM 29:320–330

    Article  MathSciNet  MATH  Google Scholar 

  5. Burrows M, Wheeler D (1994) A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation

    Google Scholar 

  6. Culpepper JS, Petri M, Puglisi SJ (2012) Revisiting bounded context block-sorting transformations. Softw Pract Exp 42:1037–1054

    Article  Google Scholar 

  7. Ferragina P, Gagie T, Manzini G (2012) Lightweight data indexing and compression in external memory. Algorithmica 63:707–730

    Article  MathSciNet  MATH  Google Scholar 

  8. Ferragina P, Giancarlo R, Manzini G (2006) The engineering of a compression boosting library: theory vs practice in BWT compression. In: Proceedings of the 14th European symposium on algorithms (ESA), Zurich. LNCS, vol 4168. Springer, Berlin, pp 756–767

    Google Scholar 

  9. Ferragina P, Giancarlo R, Manzini G (2009) The myriad virtues of wavelet trees. Inf Comput 207:849–866

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Ferragina P, Luccio F, Manzini G, Muthukrishnan S (2009) Compressing and indexing labeled trees, with applications. J ACM 57

    Google Scholar 

  12. Gagie T, Manzini G (2010) Move-to-front, distance coding, and inversion frequencies revisited. Theor Comput Sci 411:2925–2944

    Article  MathSciNet  MATH  Google Scholar 

  13. Hon W, Sadakane K, Sung W (2009) Breaking a time-and-space barrier in constructing full-text indices. SIAM J Comput 38:2162–2178

    Article  MathSciNet  MATH  Google Scholar 

  14. Kaplan, H., Landau, S., Verbin, E.: A simpler analysis of Burrows-Wheeler-based compression. Theoretical Computer Science 387, 220–235 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kärkkäinen J (2007) Fast BWT in small space by blockwise suffix sorting. Theor Comput Sci 387:249–257

    Article  MathSciNet  MATH  Google Scholar 

  16. Kärkkäinen J, Kempa D, Puglisi SJ (2012) Slashing the time for BWT inversion. In: Proceedings of the IEEE data compression conference (DCC), Snowbird. IEEE Computer Society, pp 99–108

    Google Scholar 

  17. Kärkkäinen J, Sanders P, Burkhardt S (2006) Linear work suffix array construction. J ACM 53(6):918–936

    Article  MathSciNet  MATH  Google Scholar 

  18. Manzini G (2001) An analysis of the Burrows-Wheeler transform. J ACM 48:407–430

    Article  MathSciNet  MATH  Google Scholar 

  19. Na JC, Park K (2007) Alphabet-independent linear-time construction of compressed suffix arrays using o(n logn)-bit working space. Theor Comput Sci 385:127–136

    Article  MathSciNet  MATH  Google Scholar 

  20. Navarro G, Mäkinen V (2007) Compressed full text indexes. ACM Comput Surv 39(1):2

    Article  MATH  Google Scholar 

  21. Salomon D (2007) Data compression: the complete reference, 4th edn. Springer, New York

    MATH  Google Scholar 

  22. Vo BD, Vo KP (2007) Compressing table data with column dependency. Theor Comput Sci 387(3):273–283

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pisa, Largo Bruno Pontecorvo 3, I-56127, Pisa, Italy

    Paolo Ferragina

  2. Department of Computer Science, University of Eastern Piedmont, Alessandria, Italy

    Giovanni Manzini

  3. Department of Science and Technological Innovation, University of Piemonte Orientale, Amedeo Avogadro 11, 15121, Alessandria, Italy

    Giovanni Manzini

Authors
  1. Paolo Ferragina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanni Manzini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giovanni Manzini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paolo Ferragina .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Ferragina, P., Manzini, G., Manzini, G. (2016). Burrows-Wheeler Transform. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_59

Download citation

Publish with us

Policies and ethics

Search

Navigation