DeepAI AI Chat
Log In Sign Up

Tree-Shape Grammars for Random Access

by   Travis Gagie, et al.

Shape grammars are well known in the graphics and design communities but are not such a common tool for researchers working in bioinformatics, data compression, data structures or formal languages. We are now investigating how to use shape grammars for the parse trees of straight-line programs (SLPs) to reduce the space needed to support random access to the strings those SLPs encode. Currently the smallest data structure supporting random access to a string S using an SLP G takes 2 |G| + |G| |G| + o (|G|) bits for the SLP and |G| (|S| / |G|) + O (|G|) bits so we can compute the lengths of the expansions of non-terminals.


page 1

page 2

page 3


An n H_k-compressed searchable partial-sums data structure for static sequences of sublogarithmic positive integers

We consider the space needed to store a searchable partial-sums data str...

Representation of ordered trees with a given degree distribution

The degree distribution of an ordered tree T with n nodes is n⃗ = (n_0,....

Using statistical encoding to achieve tree succinctness never seen before

We propose a new succinct representation of labeled trees which represen...

Hypersuccinct Trees – New universal tree source codes for optimal compressed tree data structures

We present a new universal source code for unlabeled binary and ordinal ...

Succinct Representation for (Non)Deterministic Finite Automata

Deterministic finite automata are one of the simplest and most practical...

Succinct Dynamic Ordered Sets with Random Access

The representation of a dynamic ordered set of n integer keys drawn from...

Performance Analysis of Zippers

A zipper is a powerful technique of representing a purely functional dat...