| 
|
Quote: use Kurtz' space efficient suffix trees in 10n space, McCreight's constructor in O(kn) time, and an indexed root
topics >
all references >
references a-b >
Topic:
compressed data
Topic:
suffix trie
Quotation Skeleton
In [Kurtz, Software Practice and Experience 29.13:1149-1171, 1999], a very space efficient representation for … practice. This is a considerable improvement over previous … [refs]. We have implemented McCreight's suffix tree construction [J. ACM 23.2:262-272, 1976] such that … [Kurtz 1999]in O(kn) time. … Additionally, for the root we store an X-indexed … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: compressed data (16 items)
Topic: suffix trie (18 items)