The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
352 pages | Springer; 1 edition (July 25, 2008) | 0387789081 | PDF | 2,3 Mb
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.