Results 1  10
of
22,704
Grammarbased Compression of DNA Sequences
, 2004
"... Grammarbased compression algorithms infer contextfree grammars to represent the input data. The grammar is then transformed into a symbol stream and finally encoded in binary. We explore the utility of grammarbased compression of DNA sequences. We strive to optimize the three stages of grammarba ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Grammarbased compression algorithms infer contextfree grammars to represent the input data. The grammar is then transformed into a symbol stream and finally encoded in binary. We explore the utility of grammarbased compression of DNA sequences. We strive to optimize the three stages of grammarbased
On the Complexity of Optimal GrammarBased Compression
, 2004
"... The task of grammarbased compression is to find a small contextfree grammar generating exactly one given string. We investigate the relationship between grammarbased compression of strings over unbounded and bounded alphabets. Specifically, we show how to transform a grammar for a string over an ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The task of grammarbased compression is to find a small contextfree grammar generating exactly one given string. We investigate the relationship between grammarbased compression of strings over unbounded and bounded alphabets. Specifically, we show how to transform a grammar for a string over
Approximation Algorithms for GrammarBased Compression
 In Proceedings of the 13th ACMSIAM Symposium on Discrete Algorithms
, 2002
"... Several recentlyproposed data compression algorithms are based on the idea of representing a string by a contextfree grammar. Most of these algorithms are known to be asymptotically optimal with respect to a stationary ergodic source and to achieve a low redundancy rate. However, such results do n ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
wellstudied area. We then upper and lower bound approximation ratios for the following four previouslyproposed grammarbased compression algorithms: Sequential, Bisection, Greedy, and LZ78, each of which employs a distinct approach to compression. These results seem to indicate that there is much
SelfIndexed GrammarBased Compression
, 2001
"... Selfindexes aim at representing text collections in a compressed format that allows extracting arbitrary portions and also offers indexed searching on the collection. Current selfindexes are unable of fully exploiting the redundancy of highly repetitive text collections that arise in several appl ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
applications. Grammarbased compression is well suited to exploit such repetitiveness. We introduce the first grammarbased selfindex. It builds on StraightLine Programs (SLPs), a rather general kind of contextfree grammars. If an SLP of n rules represents a text T [1, u], then an SLPcompressed
Improved grammarbased compressed indexes
 In Proc. 19th SPIRE, LNCS 7608
, 2012
"... Abstract. We introduce the first grammarcompressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text T [1..u] that is represented by a (contextfree) grammar of n (terminal and nonterminal) symbols and size N (meas ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(measured as the sum of the lengths of the right hands of the rules), a basic grammarbased representation of T takes N lg n bits of space. Our representation requires 2N lg n + N lg u + ɛ n lg n + o(N lg n) bits of space, for any 0 < ɛ ≤ 1. It can find the positions of the occ occurrences of a pattern
Abstract Approximation Algorithms for GrammarBased Compression
"... Several recentlyproposed data compression algorithms are based on the idea of representing a string by a contextfree grammar. Most of these algorithms are known to be asymptotically optimal with respect to a stationary ergodic source and to achieve a low redundancy rate. However, such results do ..."
Abstract
 Add to MetaCart
wellstudied area. We then upper and lower bound approximation ratios for the following four previouslyproposed grammarbased compression algorithms: SEQUENTIAL, BISECTION, GREEDY, and LZ78, each of which employs a distinct approach to compression. These results seem to indicate that there is much
Abstract Approximation Algorithms for GrammarBased Compression
"... Several recentlyproposed data compression algorithms are based on the idea of representing a string by a contextfree grammar. Most of these algorithms are known to be asymptotically optimal with respect to a stationary ergodic source and to achieve a low redundancy rate. However, such results do n ..."
Abstract
 Add to MetaCart
wellstudied area. We then upper and lower bound approximation ratios for the following four previouslyproposed grammarbased compression algorithms: Sequential, Bisection, Greedy, and LZ78, each of which employs a distinct approach to compression. These results seem to indicate that there is much
RealTime Traversal in GrammarBased Compressed Files
"... We study realtime recovery of consecutive symbols from compressed files, in the context of grammarbased compression, see, e.g., [7]. In this setting, a compressed text is represented as a small (a few kilobytes) dictionary D (containing a set of code words), and a very long (a few megabytes) st ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We study realtime recovery of consecutive symbols from compressed files, in the context of grammarbased compression, see, e.g., [7]. In this setting, a compressed text is represented as a small (a few kilobytes) dictionary D (containing a set of code words), and a very long (a few megabytes
Application of LempelZiv factorization to the approximation of grammarbased compression
, 2003
"... We introduce new type of contextfree grammars, AVLgrammars, and show theirappl7#B#BZ87 to grammarbased compression. Using this type of grammars we present O(nl7 time and O(lZ n)ratio approximation ofminimal grammarbased compression of a given string oflZM,k n over anal,UMJ, # and O(klU n) t ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
We introduce new type of contextfree grammars, AVLgrammars, and show theirappl7#B#BZ87 to grammarbased compression. Using this type of grammars we present O(nl7 time and O(lZ n)ratio approximation ofminimal grammarbased compression of a given string oflZM,k n over anal,UMJ, # and O(klU n
Results 1  10
of
22,704