The following pages link to (Q4808661):
Displaying 6 items.
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← 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)
- (Q5501319) (← links)