The Burrows-Wheeler Transform (BWT) has become since its introduction a key tool for representing large text collections in compressed space while supporting indexed searching: on a text of length n over an alphabet of size σ, it requires $O(n\lg \sigma )$ bits of space, instead of the $O(n\lg n)$ bits required by classical indexes. A challenge for its adoption is to build it within $O(n\lg \sigma )$ bits as well. There are some sequential algorithms building it within this space, but no such a parallel algorithm. In this paper we present a PRAM CREW algorithm to build the BWT using $O(n\sqrt{\lg n})$ work, $O({\lg }^{3}n/\lg \sigma )$ depth, and $O(n\lg \sigma )$ bits.

自从引入Burrows-Wheeler变换（BWT）以来，它便成为了一种用于在压缩空间中表示大型文本集合并支持索引搜索的关键工具：在长度为n且大小为σ的字母上的文本上，它需要$Ø（ñ\lg \sigma ）$ 一点空间，而不是 $Ø（ñ\lg ñ）$经典索引所需的位。采用它的挑战是在内部构建它$Ø（ñ\lg \sigma ）$位。在该空间中有一些顺序算法可以构建它，但是没有这种并行算法。在本文中，我们提出了一种PRAM CREW算法以使用$Ø（ñ\sqrt{\lg ñ}）$ 工作， $Ø（{\lg }^3ñ/\lg \sigma ）$ 深度和 $Ø（ñ\lg \sigma ）$ 位。