4 citations · 9 across the 10 of their papers we have counts for
7 papers · 1 filter
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…
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…
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…
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…