A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimal Parallel Suffix Tree Construction
1997
Journal of computer and system sciences (Print)
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 any general alphabet set to perform in O(log 4 m) time and O(m log |7| ) work and space, after the characters in s have been sorted alphabetically, where |7| is the number of distinct characters in s.
doi:10.1006/jcss.1997.1496
fatcat:qxlqdwooqbcsnnxwx774zhd6kq