13 citations · 26 across the 10 of their papers we have counts for
5 papers · 1 filter
On the Reproducibility of Experiments of Indexing Repetitive Document Collections
Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude +4
This work introduces a companion reproducible paper with the aim of allowing the exact replication of the methods, experiments, and results discussed in a previous work [5]. In tha…
Towards a Definitive Compressibility Measure for Repetitive Sequences
Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such clear measure exists for the compressibility of repetitive sequences. Since statisti…
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…
Regular Languages meet Prefix Sorting
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti +1
Indexing strings via prefix (or suffix) sorting is, arguably, one of the most successful algorithmic techniques developed in the last decades. Can indexing be extended to languages…
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
Nicola Prezza, Giovanna Rosone
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ] can be computed from the Burrows-Wheeler transformed collection in O(n log σ) t…