A grammar compressor for collections of reads with applications to the construction of the BWT

by   Diego Díaz-Domínguez, et al.

We describe a grammar for DNA sequencing reads from which we can compute the BWT directly. Our motivation is to perform in succinct space genomic analyses that require complex string queries not yet supported by repetition-based self-indexes. Our approach is to store the set of reads as a grammar, but when required, compute its BWT to carry out the analysis by using self-indexes. Our experiments in real data showed that the space reduction we achieve with our compressor is competitive with LZ-based methods and better than entropy-based approaches. Compared to other popular grammars, in this kind of data, we achieve, on average, 12% of extra compression and require less working space and time.


page 1

page 2

page 3

page 4


Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads

We present an algorithm for building the extended BWT (eBWT) of a string...

Entropy bounds for grammar compression

In grammar compression we represent a string as a context free grammar. ...

RePair in Compressed Space and Time

Given a string T of length N, the goal of grammar compression is to cons...

A Grammar Compression Algorithm based on Induced Suffix Sorting

We introduce GCIS, a grammar compression algorithm based on the induced ...

Fast, Small, and Simple Document Listing on Repetitive Text Collections

Document listing on string collections is the task of finding all docume...

Stability of Syntactic Dialect Classification Over Space and Time

This paper analyses the degree to which dialect classifiers based on syn...

Rpair: Rescaling RePair with Rsync

Data compression is a powerful tool for managing massive but repetitive ...