43 citations · 93 across the 20 of their papers we have counts for
4 papers · 1 filter
Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform
Travis Gagie, Giovanni Manzini, Marinella Sciortino
The Burrows-Wheeler Transform (BWT) is often taught in undergraduate courses on algorithmic bioinformatics, because it underlies the FM-index and thus important tools such as Bowti…
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…
A New Class of String Transformations for Compressed Text Indexing
Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo +2
Introduced about thirty years ago in the field of Data Compression, the Burrows-Wheeler Transform (BWT) is a string transformation that, besides being a booster of the performance…
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…