4 citations · 10 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
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…
String Attractors and Infinite Words
Antonio Restivo, Giuseppe Romana, Marinella Sciortino
The notion of string attractor has been introduced in [Kempa and Prezza, 2018] in the context of Data Compression and it represents a set of positions of a finite word in which all…
Logarithmic equal-letter runs for BWT of purely morphic words
Andrea Frosini, Ilaria Mancini, Simone Rinaldi +2
In this paper we study the number of equal-letter runs produced by the Burrows-Wheeler transform () when it is applied to purely morphic finite words, which are word…