| 
|
Quote: simple, space efficient suffix trees using balanced parentheses; O(n lg n) space and O(m) search
topics >
all references >
references m-o >
Topic:
search algorithms
Topic:
suffix trie
Quotation Skeleton
We give first the representation of a suffix … given text (from a fixed size alphabet) in … pattern. The structure is quite simple … We then give several index structures for binary … Our main contribution is the development of techniques … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: search algorithms (40 items)
Topic: suffix trie (18 items)