The following pages link to Combinatorial Pattern Matching (Q5713569):
Displaying 5 items.
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)