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.ezproxy.canberra.edu.au/citation.cfm?id=1441766

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Weiner%27s_algorithm_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)&oldid=45440"