research
∙
06/07/2023
Maintaining the cycle structure of dynamic permutations
We present a new data structure for maintaining dynamic permutations, wh...
share
research
∙
12/02/2022
Computing the optimal BWT of very large string collections
It is known that the exact form of the Burrows-Wheeler-Transform (BWT) o...
research
∙
07/03/2022
Suffix sorting via matching statistics
We introduce a new algorithm for constructing the generalized suffix arr...
research
∙
02/26/2022
A theoretical and experimental analysis of BWT variants for string collections
The extended Burrows-Wheeler-Transform (eBWT), introduced by Mantaci et ...
research
∙
06/21/2021
Computing the original eBWT faster, simpler, and with less memory
Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of t...
research
∙
08/19/2020
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
The Burrows-Wheeler-Transform (BWT), a reversible string transformation,...
research
∙
04/09/2020
Pattern Discovery in Colored Strings
We consider the problem of identifying patterns of interest in colored s...
research
∙
03/05/2020
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
research
∙
08/24/2019
When a Dollar Makes a BWT
The Burrows-Wheeler-Transform (BWT) is a reversible string transformatio...
research
∙
05/31/2018
On Prefix Normal Words
We present a new class of binary words: the prefix normal words. They ar...
research
∙
12/15/2017
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words
We present a new recursive generation algorithm for prefix normal words....
research
∙
11/16/2017
