Results 1  10
of
9,936
Automata on LempelZiv Compressed Strings
"... Abstract. Using the LempelZiv78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edgelabelled tree with an ordercompatible enumeration, here called an LZtrie. Queries about strings translate to queries about LZtries and hence can in principle be answered wi ..."
Abstract
 Add to MetaCart
Abstract. Using the LempelZiv78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edgelabelled tree with an ordercompatible enumeration, here called an LZtrie. Queries about strings translate to queries about LZtries and hence can in principle be answered
String Matching in LempelZiv Compressed Strings
, 1991
"... String matching and Compression are two widely studied areas of computer science. The theory of string matching has a long association with compression algorithms. Data structures from string matching can be used to derive fast implementations of many important compression schemes, most notably the ..."
Abstract
 Add to MetaCart
the LempelZiv (LZ1) algorithm. Intuitively, once a string has been compressed  and therefore its repetitive nature has been elucidated  one might be tempted to exploit this knowledge to speed up string matching. The Compressed Matching Problem is that of performing string matching in a compressed text
Computing LempelZiv factorization online
 In: Proc. MFCS
, 2012
"... Abstract. We present an algorithm which computes the LempelZiv factorization of a word W of length n online in the following sense: it reads W starting from the left, and, after reading each r = O(logn) characters of W, updates the LempelZiv factorization. The algorithm requires O(n) bits of space ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We present an algorithm which computes the LempelZiv factorization of a word W of length n online in the following sense: it reads W starting from the left, and, after reading each r = O(logn) characters of W, updates the LempelZiv factorization. The algorithm requires O(n) bits
LempelZiv Dimensionfor LempelZiv Compression
"... Abstract This paper describes the LempelZiv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case ofindividual infinite sequences, the LempelZiv dimension matches with the asymptotical Lemp ..."
Abstract
 Add to MetaCart
LempelZiv compression ratio. This fact is used todescribe results on LempelZiv compression in terms of dimension of complexity classes and vice versa. 1 Introduction Lutz [9] developed effective dimension (a Hausdorff like dimension) to quantitatively analyze the structure of complexity classes. Later
On the bitcomplexity of LempelZiv compression
"... One of the most famous and investigated lossless datacompression schemes is the one introduced by Lempel and Ziv about 30 years ago [37]. This compression scheme is known as “dictionarybased compressor ” and consists of squeezing an input string by replacing some of its substrings with (shorter) c ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
One of the most famous and investigated lossless datacompression schemes is the one introduced by Lempel and Ziv about 30 years ago [37]. This compression scheme is known as “dictionarybased compressor ” and consists of squeezing an input string by replacing some of its substrings with (shorter
On LempelZiv Complexity of Sequences
"... Abstract. We derive recurrences for counting the number a(n, r) of sequences of length n with LempelZiv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute ..."
Abstract
 Add to MetaCart
Abstract. We derive recurrences for counting the number a(n, r) of sequences of length n with LempelZiv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute
BitOptimal LempelZiv compression
, 2008
"... One of the most famous and investigated lossless datacompression scheme is the one introduced by Lempel and Ziv about 40 years ago [23]. This compression scheme is known as ”dictionarybased compression” and consists of squeezing an input string by replacing some of its substrings with (shorter) ..."
Abstract
 Add to MetaCart
One of the most famous and investigated lossless datacompression scheme is the one introduced by Lempel and Ziv about 40 years ago [23]. This compression scheme is known as ”dictionarybased compression” and consists of squeezing an input string by replacing some of its substrings with (shorter
LempelZiv Compression of Structured Text
 In IEEE Data Compression Conference
, 2004
"... We describe a novel LempelZiv approach suitable for compressing structured documents, called LZCS, which takes advantage of redundant information that can appear in the structure. The main idea is that frequently repeated subtrees may exist and these can be replaced by a backward reference to th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a novel LempelZiv approach suitable for compressing structured documents, called LZCS, which takes advantage of redundant information that can appear in the structure. The main idea is that frequently repeated subtrees may exist and these can be replaced by a backward reference
Results 1  10
of
9,936