Constructing the Bijective BWT

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 $O(n \lg n /\lg \lg n)$ time to linear.

[1]  Manfred Kufleitner.  On Bijective Variants of the Burrows-Wheeler Transform , 2009, Stringology.

[2]  Amar Mukherjee,et al.  The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching , 2008 .

[3]  Giovanni Manzini,et al.  Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[4]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[5]  Antonio Restivo,et al.  On generalized Lyndon words , 2018, Theor. Comput. Sci..

[6]  Antonio Restivo,et al.  An extension of the Burrows-Wheeler Transform , 2007, Theor. Comput. Sci..

[7]  Hideo Bannai,et al.  Indexing the Bijective BWT , 2019, CPM.

[8]  Joseph Gil,et al.  A Bijective String Sorting Transform , 2012, ArXiv.

[9]  Peter Sanders,et al.  Linear work suffix array construction , 2006, JACM.

[10]  Wing-Kai Hon,et al.  Efficient Algorithm for Circular Burrows-Wheeler Transform , 2012, CPM.

[11]  Jean Pierre Duval,et al.  Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.

[12]  Gonzalo Navarro,et al.  Optimal-Time Text Indexing in BWT-runs Bounded Space , 2017, SODA.

[13]  R. Lyndon.  On Burnside’s problem , 1954 .

[14]  Wing-Kai Hon,et al.  Succinct Indexes for Circular Patterns , 2011, ISAAC.

[15]  Antonio Restivo,et al.  Sorting conjugates and Suffixes of Words in a Multiset , 2014, Int. J. Found. Comput. Sci..

[16]  Sen Zhang,et al.  Two Efficient Algorithms for Linear Time Suffix Array Construction , 2011, IEEE Transactions on Computers.

[17]  R. Lyndon,et al.  Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series , 1958 .

[18]  Paolo Ferragina,et al.  Indexing compressed text , 2005, JACM.