Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Practical Random Access to SLP-Compressed Texts   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 made it impractical for truly massive datasets
such as genomic databases. In a recent paper (SPIRE 2019) we showed how simple
pre-processing can dramatically improve those trade-offs, and in this paper we
turn our attention to one of the features that make grammar-based compression
so attractive: the possibility of supporting fast random access. This is an
essential primitive in many algorithms that process grammar-compressed texts
without decompressing them and so many theoretical bounds have been published
about it, but experimentation has lagged behind. We give a new encoding of
grammars that is about as small as the practical state of the art (Maruyama et
al., SPIRE 2013) but with significantly faster queries.

10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
15
The categories of this paper are: nucl-ex