Lempel-Ziv factorization using less time \& space
From MaRDI portal
Lempel-Ziv factorization using less time \& space
Recommendations
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Lempel-Ziv factorization: simple, fast, practical
- Lazy Lempel-Ziv factorization algorithms
- Lempel-Ziv factorization powered by space efficient suffix trees
- Faster compact on-line Lempel-Ziv factorization
- A time-space tradeoff for Lehman's deterministic integer factorization method
- Lempel Ziv computation in small space (LZ-CISS)
- Computing Lempel-Ziv factorization online
- Lempel-Ziv Factorization Revisited
Cited in
(33)- Three overlapping squares: the general case characterized \& applications
- On succinct representations of binary trees
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Improved range minimum queries
- Computing regularities in strings: a survey
- A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
- Speeding up the detection of tandem repeats over the edit distance
- On the number of factors in the LZ-End factorization
- Sublinear time Lempel-Ziv (LZ77) factorization
- Lempel-Ziv factorization: simple, fast, practical
- Range predecessor and Lempel-Ziv parsing
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Phenomenology of coupled nonlinear oscillators
- Faster lightweight Lempel-Ziv parsing
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Compror: On-line lossless data compression with a factor oracle.
- Computing Lempel-Ziv factorization online
- Data compression with factor automata
- Efficient algorithms for three variants of the LPF table
- Lempel-Ziv Factorization Revisited
- On the computation of longest previous non-overlapping factors
- scientific article; zbMATH DE number 2185642 (Why is no real title available?)
- On compressing and indexing repetitive sequences
- Lazy Lempel-Ziv factorization algorithms
- Lempel-Ziv factorization powered by space efficient suffix trees
- Lempel-Ziv factorization may be harder than computing all runs
- On space efficient two dimensional range minimum data structures
- Note on the greedy parsing optimality for dictionary-based text compression
- Engineering practical Lempel-Ziv tries
- Locating maximal approximate runs in a string
- Lempel Ziv computation in small space (LZ-CISS)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- Faster compact on-line Lempel-Ziv factorization
This page was built for publication: Lempel-Ziv factorization using less time \& space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942991)
