Naive (Constructing Suffix Trees Constructing Suffix Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ words
(Needs to store the intermediate steps of constructing a suffix tree, which can reach size O(n))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1973
Reference
-