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 …

Byte-Pair Encoding (BPE) is a widely used method for subword tokenization, with origins in
grammar-based text compression. It is employed in a variety of language processing tasks …

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 construction …

Grammar compression is, next to Lempel–Ziv (LZ77) and run-length Burrows–Wheeler
transform (RLBWT), one of the most flexible approaches to representing and processing …

Computation over compressed data is a new paradigm in the design of algorithms and data
structures that can reduce space usage and speed up computation by orders of magnitude …

A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on
the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. The proposed …

In a seminal paper, Charikar et al. derive upper and lower bounds on the approximation
ratios for several grammar-based compressors, but in all cases there is a gap between the …

Enumerating characteristic substrings (eg, maximal repeats, minimal unique substrings, and
minimal absent words) in a given string has been an important research topic because there …

In this paper, we will address the problem of how to compress sequences defined in partially
commutative alphabets. The use of partial order between symbols may result in far more …

It is known that a context-free grammar (CFG) that produces a single string can be derived
from the compact directed acyclic word graph (CDAWG) for the same string. In this work, we …