Lempel-Ziv factorization using less time \& space
From MaRDI portal
Publication:942991
DOI10.1007/S11786-007-0024-4zbMATH Open1181.68315OpenAlexW2063841356WikidataQ56763283 ScholiaQ56763283MaRDI QIDQ942991FDOQ942991
Authors: Gang Chen, Simon J. Puglisi, W. F. Smyth 
Publication date: 8 September 2008
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-007-0024-4
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)
- Speeding up the detection of tandem repeats over the edit distance
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Efficient algorithms for three variants of the LPF table
- A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
- Computing Lempel-Ziv factorization online
- Faster compact on-line Lempel-Ziv factorization
- Lempel-Ziv factorization: simple, fast, practical
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Computing regularities in strings: a survey
- Title not available (Why is that?)
- Lempel-Ziv factorization powered by space efficient suffix trees
- Compror: On-line lossless data compression with a factor oracle.
- On compressing and indexing repetitive sequences
- On space efficient two dimensional range minimum data structures
- Data compression with factor automata
- Note on the greedy parsing optimality for dictionary-based text compression
- Engineering practical Lempel-Ziv tries
- Lempel Ziv computation in small space (LZ-CISS)
- Range predecessor and Lempel-Ziv parsing
- Lempel-Ziv factorization may be harder than computing all runs
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Locating maximal approximate runs in a string
- On succinct representations of binary trees
- Faster lightweight Lempel-Ziv parsing
- Lempel-Ziv Factorization Revisited
- Phenomenology of coupled nonlinear oscillators
- On the computation of longest previous non-overlapping factors
- Three overlapping squares: the general case characterized \& applications
- Improved range minimum queries
- On the number of factors in the LZ-End factorization
- Sublinear time Lempel-Ziv (LZ77) factorization
- Lazy Lempel-Ziv factorization algorithms
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
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)
