4 citations · 7 across the 3 of their papers we have counts for
8 papers · 1 filter
Computing the original eBWT faster, simpler, and with less memory
Christina Boucher, Davide Cenzato, Zsuzsanna Lipták +2
Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of the BWT to a collection of strings, however, since this introduction, it has been used more generally to desc…
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…
The Alternating BWT: an algorithmic perspective
Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo +2
The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures,…
Inducing the Lyndon Array
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini +2
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n…
A New Class of Searchable and Provably Highly Compressible String Transformations
Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone +1
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have…
The colored longest common prefix array computed via sequential scans
F. Garofalo, G. Rosone, M. Sciortino +1
Due to the increased availability of large datasets of biological sequences, the tools for sequence comparison are now relying on efficient alignment-free approaches to a greater e…