Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
Data Structures and Algorithms
2021-04-23 v2
Abstract
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT (BBWT) is a bijective variant of it. Although it is known that the BWT can be constructed in linear time for integer alphabets by using a linear time suffix array construction algorithm, it was up to now only conjectured that the BBWT can also be constructed in linear time. We confirm this conjecture by proposing a construction algorithm that is based on SAIS, improving the best known result of time to linear.
Cite
@article{arxiv.1911.06985,
title = {Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time},
author = {Hideo Bannai and Juha Kärkkäinen and Dominik Köppl and Marcin Picatkowski},
journal= {arXiv preprint arXiv:1911.06985},
year = {2021}
}