1. J. Abel, A fast and efficient post BWT-stage for the Burrows–Wheeler compression algorithm, in: J. Storer, M. Cohn, (Eds.) Proceedings of the IEEE Data Compression Conference 2005, Snowbird, Utah, 2005, p. 449
2. Move-to-front and Inversion coding;Arnavut,2000
3. Text Compression;Bell,1990
4. Universal data compression based on the Burrows and Wheeler-transformation: Theory and practice;Balkenhol;IEEE Transactions on Computers,2000
5. B. Balkenhol, Y.M. Shtarkov, One attempt of a compression algorithm using the BWT. SFB343: Discrete Structures in Mathematics, Faculty of Mathematics, University of Bielefeld, Preprint, 1999, pp. 99–133, URL (October 2005): http://citeseer.ist.psu.edu/balkenhol99one.html