145 citations · 240 across the 14 of their papers we have counts for
20 papers
BWT for string collections
Davide Cenzato, Zsuzsanna Lipták, Nadia Pisanti +2
We survey the different methods used for extending the BWT to collections of strings, following largely [Cenzato and Lipták, CPM 2022, Bioinformatics 2024]. We analyze the specific…
Lossy Compressor preserving variant calling through Extended BWT
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
A standard format used for storing the output of high-throughput sequencing experiments is the FASTQ format. It comprises three main components: (i) headers, (ii) bases (nucleotide…
Computing the optimal BWT of very large string collections
Davide Cenzato, Veronica Guerrini, Zsuzsanna Lipták +1
It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection.…
A New Class of String Transformations for Compressed Text Indexing
Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo +2
Introduced about thirty years ago in the field of Data Compression, the Burrows-Wheeler Transform (BWT) is a string transformation that, besides being a booster of the performance…
Space-Efficient Construction of Compressed Suffix Trees
Nicola Prezza, Giovanna Rosone
We show how to build several data structures of central importance to string processing, taking as input the Burrows-Wheeler transform (BWT) and using small extra working space. Le…
String Attractors and Combinatorics on Words
Sabrina Mantaci, Antonio Restivo, Giuseppe Romana +2
The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-ba…