Apress Windows 10 Release Sale

The Burrows-Wheeler Transform:

Data Compression, Suffix Arrays, and Pattern Matching

By Donald Adjeroh , Timothy Bell , Amar Mukherjee

  • eBook Price: $149.00
Buy eBook Buy Print Book

The Burrows-Wheeler Transform: Cover Image

Here is a reference for seasoned professionals and researchers in the area that also provides a gentle introduction, making it accessible to senior undergraduate students or first-year graduate students embarking upon research in areas related to the BWT.

Full Description

  • Add to Wishlist
  • ISBN13: 978-0-3877-8908-8
  • 364 Pages
  • User Level: Science
  • Publication Date: June 17, 2008
  • Available eBook Formats: PDF

Related Titles

  • Information Systems and Neuroscience
  • BPM - Driving Innovation in a Digital World
  • Data-Driven Process Discovery and Analysis
  • Physical Asset Management
  • Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII
  • UML @ Classroom
  • AIDA-CMK: Multi-Algorithm Optimization Kernel Applied to Analog IC Sizing
  • Computational Color Imaging
  • Uncertainty Quantification in Computational Fluid Dynamics and Aircraft Engines
  • Non-Linear Finite Element Analysis in Structural Mechanics
Full Description
The Burrows-Wheeler Transform is a text transformation scheme that has found applications in different aspects of the data explosion problem, from data compression to index structures and search. The BWT belongs to a new class of compression algorithms, distinguished by its ability to perform compression by sorted contexts. More recently, the BWT has also found various applications in addition to text data compression, such as in lossless and lossy image compression, tree-source identification, bioinformatics, machine translation, shape matching, and test data compression. This book will serve as a reference for seasoned professionals and researchers in the area, while providing a gentle introduction that makes it accessible for senior undergraduate students or first-year graduate students embarking upon research in compression, pattern matching, full text retrieval, compressed index structures, or other areas related to the BWT.
Table of Contents

Table of Contents

  1. Introduction.
  2. How the Burrows
  3. Wheeler Transform works.
  4. Coders for the Burrows
  5. Wheeler Transform.
  6. Suffix trees and suffix arrays.
  7. Suffix Trees.
  8. Analysis of the Burrows
  9. Wheeler Transform.
  10. Variants of the Burrows
  11. Wheeler Transform.
  12. Exact and approximate pattern matching.
  13. Other applications of the Burrows
  14. Wheeler Transform.
  15. Conclusion.
  16. Notation.
  17. Ongoing work on the Burrows
  18. Wheeler Transform.
  19. BWT
  20. related web sites.
  21. Ph.D. theses relating to the Burrows
  22. Wheeler Transform.
  23. References.
  24. Index.

Please Login to submit errata.

No errata are currently published


    1. Pro SQL Server Internals


      View Details

    2. Beginning 3D Game Development with Unity 4


      View Details

    3. Beginning iPhone Development with Swift


      View Details

    4. Financial Modeling for Business Owners and Entrepreneurs


      View Details