| 
|
QuoteRef: giegR7_1999
Topic:
suffix trie and suffix array
Group:
expression evaluation
Reference
Giegerich, R., Kurtz, S., Stoye, J., "Efficient implementation of lazy suffix trees", in Vitter, J.S., Zaroliagis, C.D. (ed.), Algorithm Engineering, 3rd International Workshop, WAE'99, London, UK, July 1999, LNCS 1668, Springer, pp. 30-42. Google
Notes
http://www.techfak.uni-bielefeld.de/~kurtz/Software/wae99.tar.gz
abstract ;;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 (20 items)
Group: expression evaluation (5 topics, 97 quotes)