Pages that link to "Item:Q2456365"
From MaRDI portal
The following pages link to Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365):
Displaying 5 items.
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Combinatorial Pattern Matching (Q5713569) (← links)