Pratt (Constructing Suffix Trees Constructing Suffix Trees)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1973

Reference

-

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