4 citations · 10 across the 11 of their papers we have counts for
13 papers
Computing Smallest Suffixient Arrays in Sublinear Time
Hiroto Fujimaru, Gonzalo Navarro, Francisco Olivares +3
A suffixient array is a novel data structure that, when combined with an index providing direct access on a text , allows us to answer a variety of pattern matching queries. In…
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…
Exploring Repetitiveness Measures for Two-Dimensional Strings
Giuseppe Romana, Marinella Sciortino, Cristian Urbina
Detecting and measuring repetitiveness of strings is a problem that has been extensively studied in data compression and text indexing. However, when the data are structured in a n…
Bit catastrophes for the Burrows-Wheeler Transform
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták +3
A bit catastrophe, loosely defined, is when a change in just one character of a string causes a significant change in the size of the compressed string. We study this phenomenon fo…
String attractors of some simple-Parry automatic sequences
France Gheeraert, Giuseppe Romana, Manon Stipulanti
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the commu…
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…
Computing Maximal Unique Matches with the r-index
Sara Giuliani, Giuseppe Romana, Massimiliano Rossi
In recent years, pangenomes received increasing attention from the scientific community for their ability to incorporate population variation information and alleviate reference ge…
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…
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…