Indexing text using the Ziv--Lempel trie
From MaRDI portal
Publication:876708
DOI10.1016/S1570-8667(03)00066-2zbMATH Open1118.68443OpenAlexW2646645486MaRDI QIDQ876708FDOQ876708
Authors: Gonzalo Navarro 
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00066-2
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
- Title not available (Why is that?)
- Compression of individual sequences via variable-rate coding
- Suffix Arrays: A New Method for On-Line String Searches
- An experimental study of an opportunistic index
- Title not available (Why is that?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Space efficient suffix trees
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Indexing text using the Ziv--Lempel trie
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (28)
- Indexing text using the Ziv--Lempel trie
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Comparison of LZ77-type parsings
- Self-indexing based on LZ77
- Implementing the LZ-index, theory versus practice
- Lempel-Ziv factorization powered by space efficient suffix trees
- On compressing and indexing repetitive sequences
- New algorithms on wavelet trees and applications to information retrieval
- Worst case efficient single and multiple string matching in the RAM model
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Rank and select revisited and extended
- A Lempel-Ziv Text Index on Secondary Storage
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- Stronger Lempel-Ziv based compressed text indexing
- Lempel-Ziv compressed structures for document retrieval
- Approximate string matching with compressed indexes
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Self-indexed Text Compression Using Straight-Line Programs
- Sensitivity of string compressors and repetitiveness measures
- Wavelet trees for all
- Title not available (Why is that?)
- LZ-End Parsing in Linear Time
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
- A self-index on block trees
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)
