Results 1  10
of
542,310
Indexing Text using the ZivLempel Trie
 Journal of Discrete Algorithms
, 2002
"... Let a text of u characters over an alphabet of size be compressible to n symbols by the LZ78 or LZW algorithm. We show that it is possible to build a data structure based on the ZivLempel trie that takes 4n log 2 n(1+o(1)) bits of space and reports the R occurrences of a pattern of length m in ..."
Abstract

Cited by 72 (45 self)
 Add to MetaCart
Let a text of u characters over an alphabet of size be compressible to n symbols by the LZ78 or LZW algorithm. We show that it is possible to build a data structure based on the ZivLempel trie that takes 4n log 2 n(1+o(1)) bits of space and reports the R occurrences of a pattern of length m
ZivLempel Compressed FullText SelfIndexes
"... Given a sequence of characters T1...u (the text) over an alphabet Σ, and given another sequence P1...m (the search pattern) over Σ, then the fulltext search problem consists of finding (or counting, or reporting) all the occ occurrences of P in T. In indexed text searching we build a data structur ..."
Abstract
 Add to MetaCart
efficient representation of it, and at the same time this representation provides indexed access to the text. In this thesis we propose a deep study of compressed fulltext selfindexes based on the ZivLempel compression algorithm, contributing with new theoretical developments in this area. Specifically, we will focus
Approximate String Matching with ZivLempel Compressed Indexes
"... Abstract. A compressed fulltext selfindex for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can reproduce any substring of T, thus it actually replaces T. Despite the explosion of interest on selfindexes in recent years, ..."
Abstract
 Add to MetaCart
consider the socalled hybrid indexes, which are the best in practice for this problem. We show that a LempelZiv index can be seen as an extension of the classical qsamples index. We give new insights on this type of index, which can be of independent interest, and then apply them to the ZivLempel index
Longestmatch String Searching for ZivLempel Compression
, 1993
"... This paper presents eight data structures that can be used to accelerate the searching, including adaptations of four methods normally used for exact matching searching. The algorithms are evaluated analytically and empirically, indicating the tradeoffs available between compression speed and memor ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
This paper presents eight data structures that can be used to accelerate the searching, including adaptations of four methods normally used for exact matching searching. The algorithms are evaluated analytically and empirically, indicating the tradeoffs available between compression speed
V.42bis and Other ZivLempel Variants
, 1991
"... The recently adopted V.42bis standard for data compressing modems is discussed from algorithmic, experimental, practical, and marketing standpoints. V.42bis is a conservative and economicallyimplementable scheme, one that compresses text about as well as the LempelZivWelch algorithm of the Berkel ..."
Abstract
 Add to MetaCart
The recently adopted V.42bis standard for data compressing modems is discussed from algorithmic, experimental, practical, and marketing standpoints. V.42bis is a conservative and economicallyimplementable scheme, one that compresses text about as well as the LempelZivWelch algorithm
A Progressive ZivLempel Algorithm for Image Compression
, 1997
"... We describe an algorithm that gives a progression of compressed versions of a single image. Each stage of the progression is a lossy compression of the image, with the distortion decreasing in each stage, until the last image is losslessly compressed. Progressive encodings are useful in applications ..."
Abstract
 Add to MetaCart
is encountered in a multicast. Our algorithm assumes an initial vector quantization step which maps important information of an image, such as intensity values, into higherorder bits. The bit planes are then sent successively using a progressive ZivLempel algorithm. We propose data structuring techniques
Approximate String Matching over ZivLempel Compressed Text
, 2000
"... We present the first nontrivial algorithm for approximate pattern matching on compressed text. The format we choose is the ZivLempel family. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern in the text allowing up to k inse ..."
Abstract

Cited by 52 (13 self)
 Add to MetaCart
We present the first nontrivial algorithm for approximate pattern matching on compressed text. The format we choose is the ZivLempel family. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern in the text allowing up to k
The LZindex: A Text Index Based on the ZivLempel Trie
"... Let a text of u characters over an alphabet of size oe be compressible to n symbols by the LZ78 or LZW algorithm. We show how to build a data structure, called the LZindex, based on the ZivLempel trie that takes 4n log2 n(1 + o(1)) bits of space (that is, 4 times the entropy of the text) and rep ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Let a text of u characters over an alphabet of size oe be compressible to n symbols by the LZ78 or LZW algorithm. We show how to build a data structure, called the LZindex, based on the ZivLempel trie that takes 4n log2 n(1 + o(1)) bits of space (that is, 4 times the entropy of the text
Regular expression searching over ZivLempel compressed text
 Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM'2001), LNCS 2089
, 2001
"... We present a solution to the problem of regular expression searching on compressed text. The format we choose is the ZivLempel family, specifically the LZ78 and LZW variants. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the ZivLempel family, specifically the LZ78 and LZW variants. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences
A compressed selfindex using a ZivLempel dictionary
 In: SPIRE. Volume 4209 of LNCS. (2006) 163–180
"... Abstract. A compressed fulltext selfindex for a text T, of size u, is a data structure used to search patterns P, of size m, in T that requires reduced space, i.e. that depends on the empirical entropy (Hk, H0) of T, and is, furthermore, able to reproduce any substring of T. In this paper we prese ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Abstract. A compressed fulltext selfindex for a text T, of size u, is a data structure used to search patterns P, of size m, in T that requires reduced space, i.e. that depends on the empirical entropy (Hk, H0) of T, and is, furthermore, able to reproduce any substring of T. In this paper we
Results 1  10
of
542,310