Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1611:16, 15 February 2023‎ Admin talk contribs‎ 376 bytes +376‎ 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 == 1973 == Reference == https://dl.acm.org/citation.cfm?id=1441766"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Weiner%27s_algorithm_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)"