In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size.
Mar 6, 2012 · In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size.
We prove lower bounds also for the case of LZ- compression. All of our lower bounds hold even when the strings are over an alphabet of size 2 and hold even for ...
Abstract: In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, ...
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. https://doi.org/10.1007/978-3-642-38905-4_24 · Full text. Journal: Combinatorial ...
People also ask
How do you find the lower bound in data structure?
What is upper bound and lower bound in data structure?
In this paper, we present a novel grammar representation that allows efficient random access to any character or substring of $S$ without decompressing $S$. Let ...
Dec 18, 2013 · To achieve these bounds, we introduce several new techniques and data structures of independent interest, including a predecessor data structure ...
Abstract. Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful ...
Dive into the research topics of 'Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings'. Together they form a unique fingerprint. Sort by ...
The random access problem for compressed strings is to build a data structure ... Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings.