In the last decades, the necessity to process massive amounts of textual...
Grammar compression is a general compression framework in which a string...
The suffix array SA[1..n] of a text T of length n is a permutation of
{1...
The suffix array, describing the lexicographic order of suffixes of a gi...
Grammar compression is, next to Lempel-Ziv (LZ77) and run-length
Burrows...
Burrows-Wheeler Transform (BWT) is an invertible text transformation tha...
Burrows-Wheeler transform (BWT) is an invertible text transformation tha...
String attractors [STOC 2018] are combinatorial objects recently introdu...
Fast and space-efficient construction of compressed indexes such as
comp...
A well-known fact in the field of lossless text compression is that
high...