Rytter (Constructing Suffix Trees Constructing Suffix Trees): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(logn)$ == Space Complexity == $O(n)$ words (https://www.researchgate.net/publication/228945502_On_parallel_transformations_of_suffix_arrays_into_suffix_trees) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == CREW PRAM == Year == 2004 == Reference == https://www.researchgate.net/publication/228945502_On_parallel_transformations_of_suffix_arrays_into_suffix_trees") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(\log n)$
Space Complexity
$O(n)$ words
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
2004