research
∙
04/17/2023
Lossy Compressor preserving variant calling through Extended BWT
A standard format used for storing the output of high-throughput sequenc...
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
∙
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
∙
08/12/2019
Space-Efficient Construction of Compressed Suffix Trees
We show how to build several data structures of central importance to st...
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
∙
06/26/2019
String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
research
∙
05/07/2019
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
An elastic-degenerate (ED) string is a sequence of n sets of strings of ...
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
∙
01/16/2019
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
We show that the Longest Common Prefix Array of a text collection of tot...
research
∙
10/04/2018
Longest Property-Preserved Common Factor
In this paper we introduce a new family of string processing problems. W...
research
∙
05/04/2018