| 
|
QuoteRef: grosR5_2000
topics >
all references >
ThesaHelp:
references g-h
ThesaHelp:
ACM references f-l
Topic:
search algorithms
Topic:
suffix trie
Reference
Grossi, R., Vitter, J.S., "Compressed suffix arrays and suffix trees with applications to text indexing and string matching", Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), May 2000, Portland Oregon, ACM SIGACT, pp. 397-406. Google
397 ;;Quote: use compressed suffix arrays and trees to search for short strings in O(1) time with O(n) space
ThesaHelp: references g-h (299 items)
ThesaHelp: ACM references f-l (241 items)
Topic: search algorithms (40 items)
Topic: suffix trie (18 items)