Cited in
(15)- Balancing and clustering of words in the Burrows-Wheeler transform
- A comparison of BWT approaches to string pattern matching
- Fast decoding algorithms for variable-lengths codes
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
- The swap matching problem revisited
- An experimental study of a compressed index
- LZSS
- XMill
- GLIMPSE
- BSDiff
- A fast dynamic compression scheme for natural language texts
- Efficient computation of substring equivalence classes with suffix arrays
- The Vcodex Platform for Data Compression
- Handbook of data compression. With contributions by David Bryant
- Space efficient algorithms for the Burrows-Wheeler backtransformation
This page was built for software: Canterbury
