Pages that link to "Item:Q724218"
From MaRDI portal
The following pages link to Lempel-Ziv factorization powered by space efficient suffix trees (Q724218):
Displaying 13 items.
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Converting suffix trees into factor/suffix oracles (Q935847) (← links)
- Lempel-Ziv factorization using less time \& space (Q942991) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small (Q4928572) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- On the computation of longest previous non-overlapping factors (Q6536266) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
- New advances in rightmost Lempel-Ziv (Q6545424) (← links)