Implementation and comparison of BWT encoding/decoding algorithms

[krzysztof-turowski]

Overall, the aim is to implement several BTW and IBWT transformation algorithms, and to compare them in terms of efficiency (number of accesses of characters) and running time.

Selected relevant literature: [1] Adjeroh, Bell, Mukherjee - The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching [2] Burrows, Wheeler - A Block-sorting Lossless Data Compression Algorithm - especially algorithms C and D, and Move-To-Front coding and decoding, [3] Kärkkäinen - Fast BWT in small space by blockwise suffix sorting [4] Yokoo - Notes on Block-Sorting Data Compression [5] Lauther, Lukovszki - Space Efficient Algorithms for the Burrows-Wheeler Backtransformation [6] Kärkkäinen, Puglisi - Medium-Space Algorithms for Inverse BWT - algorithms LR-B and VLR-B