4 citations · 10 across the 11 of their papers we have counts for
5 papers · 1 filter
Checking and producing word attractors
Marie-Pierre Béal, Maxime Crochemore, Giuseppe Romana
The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinat…
Unclustered BWTs of any Length over Non-Binary Alphabets
Gabriele Fici, Estéban Gabory, Giuseppe Romana +1
We prove that for every integer and for every alphabet of size , there exists a necklace of length whose Burrows-Wheeler Transform (BWT) is completely u…
Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
Hiroto Fujimaru, Gonzalo Navarro, Giuseppe Romana +1
A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports vari…
Generalization of Repetitiveness Measures for Two-Dimensional Strings
Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana +2
The problem of detecting and measuring the repetitiveness of one-dimensional strings has been extensively studied in data compression and text indexing. Our understanding of these…
Morphisms and BWT-run Sensitivity
Gabriele Fici, Giuseppe Romana, Marinella Sciortino +1
We study how the application of injective morphisms affects the number of equal-letter runs in the Burrows-Wheeler Transform (BWT). This parameter has emerged as a key repetiti…