Lempel-Ziv factorization using less time \& space
From MaRDI portal
Publication:942991
DOI10.1007/s11786-007-0024-4zbMath1181.68315OpenAlexW2063841356WikidataQ56763283 ScholiaQ56763283MaRDI QIDQ942991
Simon J. Puglisi, W. F. Smyth, Gang Chen
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
Related Items (15)
On succinct representations of binary trees ⋮ Improved range minimum queries ⋮ Phenomenology of coupled nonlinear oscillators ⋮ Locating maximal approximate runs in a string ⋮ On compressing and indexing repetitive sequences ⋮ On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case ⋮ Efficient algorithms for three variants of the LPF table ⋮ Note on the greedy parsing optimality for dictionary-based text compression ⋮ Speeding up the detection of tandem repeats over the edit distance ⋮ Lempel-Ziv Factorization Revisited ⋮ On space efficient two dimensional range minimum data structures ⋮ Computing regularities in strings: a survey ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Lazy Lempel-Ziv Factorization Algorithms ⋮ Three overlapping squares: the general case characterized \& applications
This page was built for publication: Lempel-Ziv factorization using less time \& space
