
Learning Directly from Grammar Compressed Text
Neural networks using numerous text data have been successfully applied ...
read it

Proving tree algorithms for succinct data structures
Succinct data structures give spaceefficient representations of large a...
read it

GrammarCompressed Indexes with Logarithmic Search Time
Let a text T[1..n] be the only string generated by a contextfree gramma...
read it

Optimal Rank and Select Queries on DictionaryCompressed Text
Let γ be the size of a string attractor for a string S of length n over ...
read it

Simulation computation in grammarcompressed graphs
Like [1], we present an algorithm to compute the simulation of a query p...
read it

Fast Dynamic Arrays
We present a highly optimized implementation of tiered vectors, a data s...
read it

Compressed Data Structures for Binary Relations in Practice
Binary relations are commonly used in Computer Science for modeling data...
read it
Grammar Compressed Sequences with Rank/Select Support
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent highly repetitive sequences, and classical statistical compression proves ineffective. We introduce, instead, grammarbased representations for repetitive sequences, which use up to 6 compressed representations, and support direct access and rank/select operations within tens of microseconds. We demonstrate the impact of our structures in text indexing applications.
READ FULL TEXT
Comments
There are no comments yet.