Rytter (Constructing Suffix Trees Constructing Suffix Trees)

From Algorithm Wiki

Revision as of 07:56, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(\log n)$

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Rytter_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)&oldid=47034"