| 
|
QuoteRef: crocM7_1999
topics >
all references >
ThesaHelp:
references c-d
Topic:
text compression
Topic:
data compression algorithms
Topic:
searching compressed data
Topic:
external search and sort
Reference
Crochemore, M., Mignosi, F., Restivo, A., Salemi, S., "Text compression using antidictionaries", in Wiedermann, J., et al (ed.), Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, Springer, LNCS 1644, July 1999, pp. 261-270. Google
261 ;;Quote: use antidictionaries for efficient, linear time compression of fixed data sources; i.e., words that are not in the text
261 ;;Quote: compression by antidictionaries erases characters on compression and reconstructs on decompression; e.g., humans can identified erased characters of english text
262 ;;Quote: DCA compression and antidictionaries allow search and parallel algorithms because their encodings do not depend on context except for the block's prefix
ThesaHelp: references c-d (337 items)
Topic: text compression (16 items)
Topic: data compression algorithms (53 items)
Topic: searching compressed data (9 items)
Topic: external search and sort (23 items)