| 
|
QuoteRef: balkB10_2000
topics >
all references >
ThesaHelp:
references a-b
Topic:
data compression algorithms
Topic:
compressed data
Topic:
suffix trie
Reference
Balkenhol, B., Kurtz, S., "Universal data compression based on the Burrows-Wheeler transformation: theory and practice", IEEE Transactions on Computers, 49, 10, October 2000, pp. 1043-1053. Google
abstract ;;Quote: data compression in O(kn) time and O(n) space by Burrows-Wheeler Transformation; groups same right context together; fast and efficient
1048 ;;Quote: for data compression alphabet encode sequences of characters instead of full alphabet
1049 ;;Quote: use Kurtz' space efficient suffix trees in 10n space, McCreight's constructor in O(kn) time, and an indexed root
ThesaHelp: references a-b (396 items)
Topic: data compression algorithms (53 items)
Topic: compressed data (16 items)
Topic: suffix trie (18 items)