Indexing text using the Ziv--Lempel trie
From MaRDI portal
Publication:876708
Recommendations
- Implementing the LZ-index, theory versus practice
- Stronger Lempel-Ziv based compressed text indexing
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
- A Lempel-Ziv Text Index on Secondary Storage
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- scientific article; zbMATH DE number 2089995 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- scientific article; zbMATH DE number 1438578 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- An experimental study of an opportunistic index
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Compression of individual sequences via variable-rate coding
- Indexing text using the Ziv--Lempel trie
- Space efficient suffix trees
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(28)- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Wavelet trees for all
- Stronger Lempel-Ziv based compressed text indexing
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Self-indexing based on LZ77
- Sensitivity of string compressors and repetitiveness measures
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
- Self-indexed Text Compression Using Straight-Line Programs
- A Lempel-Ziv Text Index on Secondary Storage
- Worst case efficient single and multiple string matching in the RAM model
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Comparison of LZ77-type parsings
- Rank and select revisited and extended
- Lempel-Ziv compressed structures for document retrieval
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Indexing text using the Ziv--Lempel trie
- On compressing and indexing repetitive sequences
- Lempel-Ziv factorization powered by space efficient suffix trees
- Implementing the LZ-index, theory versus practice
- Approximate string matching with compressed indexes
- scientific article; zbMATH DE number 7559179 (Why is no real title available?)
- LZ-End Parsing in Linear Time
- New algorithms on wavelet trees and applications to information retrieval
- A self-index on block trees
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
This page was built for publication: Indexing text using the Ziv--Lempel trie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876708)
