Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Higher Compression from the Burrows-Wheeler Transform by Modified Sorting
DCC '98 Proceedings of the Conference on Data Compression
Space-Time Tradeoffs in the Inverse B-W Transform
DCC '01 Proceedings of the Data Compression Conference
A pointless derivation of radix sort
Journal of Functional Programming
Computing Inverse ST in Linear Complexity
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On the Value of Multiple Read/Write Streams for Data Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Computing the inverse sort transform in linear time
ACM Transactions on Algorithms (TALG)
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
The Burrows–Wheeler Transform is a string-to-string transform which, when used as a preprocessing phase in compression, significantly enhances the compression rate. However, it often puzzles people how the inverse transform is carried out. In this pearl we to exploit simple equational reasoning to derive the inverse of the Burrows–Wheeler transform from its specification. We also outline how to derive the inverse of two more general versions of the transform, one proposed by Schindler and the other by Chapin and Tate.