Ukkonen (Constructing Suffix Trees Constructing Suffix Trees)
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == 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 == 1995 == Reference == https://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf")
Time Complexity
$O(n)$
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
1995