On the computation of longest previous non-overlapping factors
From MaRDI portal
Publication:6536266
DOI10.1007/978-3-030-32686-9_26zbMATH Open1539.68383MaRDI QIDQ6536266
Publication date: 19 April 2024
Cites Work
- Efficient algorithms for three variants of the LPF table
- LZ77 computation based on the run-length encoded BWT
- Lempel-Ziv factorization powered by space efficient suffix trees
- Replacing suffix trees with enhanced suffix arrays
- Lempel-Ziv factorization using less time \& space
- Computing longest previous factor in linear time and applications
- Searching for gapped palindromes
- Computing longest previous non-overlapping factors
- Lempel-Ziv Factorization Revisited
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- LPF Computation Revisited
- A universal algorithm for sequential data compression
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- A Linear-Time Algorithm for Seeds Computation
- Lazy Lempel-Ziv Factorization Algorithms
- Uniqueness Theorems for Periodic Functions
This page was built for publication: On the computation of longest previous non-overlapping factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536266)
