The following pages link to Canterbury (Q29789):
Displayed 11 items.
- The swap matching problem revisited (Q300248) (← links)
- Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- The Vcodex Platform for Data Compression (Q3612878) (← links)
- Handbook of Data Compression (Q3648685) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- A comparison of BWT approaches to string pattern matching (Q5704751) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)