| 
|
Quote: space efficient suffix trees; 10 bytes per input character, just as fast; best for binary and text
topics >
all references >
references i-l >
Topic:
suffix trie
Quotation Skeleton
We show that suffix trees store various kinds … efficient of our representations requires 20 bytes per … collection of 42 files of different type. This … can be constructed without extra space, and as … [p. 1151] [DNA sequences require more space to represent than binary strings and text]. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: suffix trie (18 items)