Space-efficient construction of Lempel-Ziv compressed text indexes
From MaRDI portal
(Redirected from Publication:549672)
Recommendations
Cites work
- scientific article; zbMATH DE number 2185599 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2038722 (Why is no real title available?)
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A simple optimal representation for balanced parentheses
- A space and time efficient algorithm for constructing compressed suffix arrays
- A universal algorithm for sequential data compression
- Algorithms and Computation
- Algorithms and Computation
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- An Improved Succinct Representation for Dynamic k-ary Trees
- An analysis of the Burrows-Wheeler transform
- Better external memory suffix array construction
- Breaking a time-and-space barrier in constructing full-text indices
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed indexes for dynamic text collections
- Compressed representations of sequences and full-text indexes
- Compressed text indexes, from theory to practice
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Compression of individual sequences via variable-rate coding
- Dynamic entropy-compressed sequences and full-text indexes
- Efficient generation of super condensed neighborhoods
- Engineering a lightweight suffix array construction algorithm
- Experimental and Efficient Algorithms
- Fast BWT in small space by blockwise suffix sorting
- Faster suffix sorting
- Fully-functional succinct trees
- Implementing the LZ-index, theory versus practice
- In-Place Suffix Sorting
- Indexing compressed text
- Indexing text using the Ziv--Lempel trie
- Introduction to algorithms
- Lightweight data indexing and compression in external memory
- New text indexing functionalities of the compressed suffix arrays
- Permuting in Place
- Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
- Practical entropy-compressed rank/select dictionary
- Rank and select revisited and extended
- Rank/select on dynamic compressed sequences and applications
- Reducing the Space Requirement of LZ-Index
- Representing trees of higher degree
- Space efficient suffix trees
- Squeezing succinct data structures into entropy bounds
- Stronger Lempel-Ziv based compressed text indexing
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct Trees in Practice
- Succinct representation of balanced parentheses and static trees
- Suffix Arrays: A New Method for On-Line String Searches
- Ultra-succinct representation of ordered trees
Cited in
(22)- Dynamic index and LZ factorization in compressed space
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- Algorithms and Computation
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Reducing space for index implementation.
- Stronger Lempel-Ziv based compressed text indexing
- Alphabet-independent compressed text indexing
- A Lempel-Ziv Text Index on Secondary Storage
- Distribution-aware compressed full-text indexes
- Distribution-aware compressed full-text indexes
- Compressed text indexes, from theory to practice
- Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Indexing text using the Ziv--Lempel trie
- Faster dynamic compressed \(d\)-ary relations
- Lempel-Ziv index for \(q\)-grams
- Lempel-Ziv-78 compressed string dictionaries
- Implementing the LZ-index, theory versus practice
- LZ78 compression in low main memory space
- Reducing the Space Requirement of LZ-Index
- Succinct dynamic cardinal trees
- Engineering practical Lempel-Ziv tries
This page was built for publication: Space-efficient construction of Lempel-Ziv compressed text indexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549672)
