6 citations · 26 across the 22 of their papers we have counts for
8 papers · 2 filters
Practical Random Access to SLP-Compressed Texts
Travis Gagie, Tomohiro I, Giovanni Manzini +4
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construct…
Matching reads to many genomes with the -index
Taher Mun, Alan Kuhnle, Christina Boucher +3
The -index is a tool for compressed indexing of genomic databases for exact pattern matching, which can be used to completely align reads that perfectly match some part of a gen…
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,…
Rpair: Rescaling RePair with Rsync
Travis Gagie, Tomohiro I, Giovanni Manzini +3
Data compression is a powerful tool for managing massive but repetitive datasets, especially schemes such as grammar-based compression that support computation over the data withou…
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…
Lightweight merging of compressed indices based on BWT variants
Lavinia Egidi, Giovanni Manzini
In this paper we propose a flexible and lightweight technique for merging compressed indices based on variants of Burrows-Wheeler transform (BWT), thus addressing the need for algo…