ABSTRACT
We present several polylogarithmic-time parallel string algorithms using a high level description of the parallel random access machine (PRAM). We select only basic problems: string matching, construction of the dictionary of basic subwords, suffix arrays, and suffix trees. Especially, the suffix tree is a very useful data structure in string algorithmics, once it is constructed it can be used to solve easily in parallel many other problems expressed in terms of suffix trees. Most problems related to trees are easily computable in parallel.
