| 
|
QuoteRef: kurtS11_1999
topics >
all references >
ThesaHelp:
references i-l
Topic:
suffix trie
Topic:
biology
Reference
Kurtz, S., "Reducing the space requirements of suffix trees", Software - Practice and Experience, 29, 13, November 1999, pp. 1149-1171. Google
abstract ;;Quote: space efficient suffix trees; 10 bytes per input character, just as fast; best for binary and text
1167 ;;Quote: could construct suffix tree for human genome in 46G memory and nine hours
ThesaHelp: references i-l (342 items)
Topic: suffix trie (18 items)
Topic: biology (24 items)