Lempel-Ziv factorization powered by space efficient suffix trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- A faster grammar-based self-index
- A universal algorithm for sequential data compression
- Alphabet-dependent string searching with wexponential search trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- Compression of individual sequences via variable-rate coding
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Data compression via textual substitution
- Detecting leftmost maximal periodicities
- Engineering a compressed suffix tree implementation
- Fully functional static and dynamic succinct trees
- Fully-Compressed Suffix Trees
- Improved dynamic dictionary matching
- Indexing compressed text
- Indexing text using the Ziv--Lempel trie
- LZ77-based self-indexing with faster pattern matching
- Lempel-Ziv index for \(q\)-grams
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear time construction of compressed text indices in compact space
- Linear work suffix array construction
- Linear-time computation of local periods
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Radix Sorting with No Extra Space
- Raising permutations to powers in place
- Range predecessor and Lempel-Ziv parsing
- Representing trees of higher degree
- Space-efficient construction of compressed indexes in deterministic linear time
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Squeezing succinct data structures into entropy bounds
- Suffix Arrays: A New Method for On-Line String Searches
- Transducers and repetitions
- Ultra-succinct representation of ordered trees with applications
Cited in
(17)- Dynamic index and LZ factorization in compressed space
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Strictly in-place algorithms for permuting and inverting permutations
- Refining the \(r\)-index
- New advances in rightmost Lempel-Ziv
- Sublinear time Lempel-Ziv (LZ77) factorization
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Faster lightweight Lempel-Ziv parsing
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Computing Lempel-Ziv factorization online
- On the computation of longest previous non-overlapping factors
- Converting suffix trees into factor/suffix oracles
- Bidirectional Text Compression in External Memory
- LZ77 factorisation of trees
- Engineering practical Lempel-Ziv tries
- Lempel Ziv computation in small space (LZ-CISS)
- Lempel-Ziv factorization using less time \& space
This page was built for publication: Lempel-Ziv factorization powered by space efficient suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724218)
