| 
|
Quote: wotdlazy, an efficient algorithm for write-only, top-down construction of suffix trees; less than 12 bytes per input character; faster and less space than McCreight's hash table implementation
Topic:
suffix trie and suffix array
Group:
expression evaluation
Quotation Skeleton
We present an efficient implementation of a write-only … trees which requires only 12 bytes per input … of files of different type. We show how … before it is traversed for the first time … [p. 31] when searching 0.1n patterns of length between … on average almost 13% faster and 50% more … [ref] linear time suffix tree algorithm, eight times faster and 10% … [ref], and … 99 times faster than the iterated application of … [ref]. … [p. 40] [For n=3.7mbyte,] bmh is faster than wotdlazy only … [ca 1000] … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: suffix trie and suffix array (20 items)
Group: expression evaluation (5 topics, 97 quotes)