 |
|
|
 |  |  The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern MatchingThe 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... |  |  |
|
|
|
| Result Page: 827 826 825 824 823 822 821 820 819 818 817 816 815 814 813 |