On different variants of the Burrows-Wheeler-Transform of string collections
Davide Cenzato, Zsuzsanna Lipták · 2022
The extended Burrows- Wheeler- Transform (eBWT), introduced by Mantaci et al. [Theor. Comput. Sci., 2007], is a generalization of the Burrows-Wheeler-Transform (BWT) to multisets of strings. Similarly to the classic BWT, the eBWT consists of one string, which is a permutation of the characters of all the input strings. A number of tools are available that compute the BWT of string collections; however, the data structures they generate in all but one case differ from the one originally defined, as well as from each other.