Optimal Parallel Suffix Tree Constructio
β
Ramesh Hariharan
π
Article
π
1997
π
Elsevier Science
π
English
β 656 KB
An O(m)-work, O(m)-space, O(log 4 m)-time CREW-PRAM algorithm for constructing the suffix tree of a string s of length m drawn from any fixed alphabet set is obtained. This is the first known work and space optimal parallel algorithm for this problem. It can be generalized to a string s drawn from a