Results 1  10
of
314,814
LempelZiv Compressed FullText SelfIndexes
, 2009
"... Because of the many growing text collections available from different sources, the fulltext search problem arises in a wealth of applications, which need to provide efficient access to large text collections. Classical text indexes require much space (besides storing the text itself), and thus migh ..."
Abstract
 Add to MetaCart
of their efficiency. In this thesis we carry out a deep study of compressed fulltext selfindexes based on LempelZiv compression (LZindexes for short), contributing with new developments in this area. We base our study on Navarro’s LZindex (or simply LZindex). Before our work, the LZindexes were an attractive
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
Approximate String Matching with LempelZiv Compressed Indexes
, 2007
"... 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, there has ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
, there has not been much progress on search functionalities beyond the basic exact search. In this paper we focus on indexed approximate string matching (ASM), which is of great interest, say, in computational biology applications. We present an ASM algorithm that works on top of a LempelZiv selfindex. We
Practical Parallel LempelZiv Factorization
"... In the age of big data, the need for efficient data compression algorithms has grown. A widely used data compression method is the LempelZiv77 (LZ77) method, being a subroutine in popular compression packages such as gzip and PKZIP. There has been a lot of recent effort on developing practical se ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
sequential algorithms for LempelZiv factorization (equivalent to LZ77 compression), but research in practical parallel implementations has been less satisfactory. In this work, we present a simple workefficient parallel algorithm for LempelZiv factorization. We show theoretically that our algorithm
Generalized LempelZiv Compression for Audio
 IEEE 6 TH WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING
, 2004
"... We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize the basic LempelZiv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize the basic LempelZiv
Stronger LempelZiv Based Compressed Text Indexing
, 2008
"... Given a text T[1..u] over an alphabet of size σ, the fulltext search problem consists in finding the occ occurrences of a given pattern P[1..m] in T. In indexed text searching we build an index on T to improve the search time, yet increasing the space requirement. The current trend in indexed text ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
text searching is that of compressed fulltext selfindices, which replace the text with a more spaceefficient representation of it, at the same time providing indexed access to the text. Thus, we can provide efficient access within compressed space. The LZindex of Navarro is a compressed full
Efficient Algorithms for LempelZiv Encoding
"... Abstract. We consider several basic problems for texts and show that if the input texts are given by their LempelZiv codes then the problems can be solved deterministically in polynomial time in the case when the original (uncompressed) texts are of exponential size. The growing importance of massi ..."
Abstract
 Add to MetaCart
of massively stored information requires new approaches to algorithms for compressed texts without decompressing. Denote by LZ(w) the version of a string w produced by LempelZiv encoding algorithm. For given compressed strings LZ(T), LZ(P) we give the first known deterministic polynomial time algorithms
Relative LempelZiv Factorization for Efficient Storage and Retrieval of Web Collections
"... Compression techniques that support fast random access are a core component of any information system. Current stateoftheart methods group documents into fixedsized blocks and compress each block with a generalpurpose adaptive algorithm such as gzip. Random access to a specific document then req ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Compression techniques that support fast random access are a core component of any information system. Current stateoftheart methods group documents into fixedsized blocks and compress each block with a generalpurpose adaptive algorithm such as gzip. Random access to a specific document
Polylog space compression, pushdown compression, and LempelZiv are incomparable
, 2009
"... The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [11, 17], and in particular calls for a formulation of informationlossless stack or pushdown compressors that allows a formal analysis of their performance and a more ambitious use o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We compare the performance of these two families of compressors with each other and with the general purpose LempelZiv algorithm. This comparison is made
Efficient Algorithms for LempelZiv Encoding (Extended Abstract)
 IN PROC. 4TH SCANDINAVIAN WORKSHOP ON ALGORITHM THEORY
, 1996
"... We consider several basic problems for texts and show that if the input texts are given by their LempelZiv codes then the problems can be solved deterministically in polynomial time in the case when the original (uncompressed) texts are of exponential size. The growing importance of massively sto ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
stored information requires new approaches to algorithms for compressed texts without decompressing. Denote by LZ(w) the version of a string w produced by LempelZiv encoding algorithm. For given compressed strings LZ(T ), LZ(P ) we give the first known deterministic polynomial time algorithms
Results 1  10
of
314,814