research
∙
01/13/2023
Computing matching statistics on Wheeler DFAs
Matching statistics were introduced to solve the approximate string matc...
share
research
∙
08/21/2022
Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform
The Burrows-Wheeler Transform (BWT) is often taught in undergraduate cou...
research
∙
06/01/2022
String Attractors and Infinite Words
The notion of string attractor has been introduced in [Kempa and Prezza,...
research
∙
05/11/2022
A New Class of String Transformations for Compressed Text Indexing
Introduced about thirty years ago in the field of Data Compression, the ...
research
∙
02/05/2022
Logarithmic equal-letter runs for BWT of purely morphic words
In this paper we study the number r_bwt of equal-letter runs produced by...
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
∙
07/10/2019
String Attractors and Combinatorics on Words
The notion of string attractor has recently been introduced in [Prezza, ...
research
∙
07/04/2019
The Alternating BWT: an algorithmic perspective
The Burrows-Wheeler Transform (BWT) is a word transformation introduced ...
research
∙
05/30/2019
Inducing the Lyndon Array
In this paper we propose a variant of the induced suffix sorting algorit...
research
∙
02/04/2019
A New Class of Searchable and Provably Highly Compressible String Transformations
The Burrows-Wheeler Transform is a string transformation that plays a fu...
research
∙
05/04/2018
