Abstract
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(nlgσ) bits of space, instead of the O(nlgn) bits required by classical indexes. A challenge for its adoption is to build it within O(nlgσ) 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(nlgn) work, O(lg3n/lgσ) depth, and O(nlgσ) bits.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have