Ukkonen and D. Wood (Constructing Suffix Trees Constructing Suffix Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$ words
(https://link.springer.com/article/10.1007/BF01769703)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993