Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees)

From Algorithm Wiki
Jump to navigation Jump to search

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

1973

Reference

https://dl.acm.org/citation.cfm?id=1441766