enter search term and/or author name
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
Uwe Baier, Timo Beller, Enno Ohlebusch
Article No.: 1.1
A compressed suffix tree usually consists of three components: a compressed suffix array, a compressed LCP-array, and a succinct representation of the suffix tree topology. There are parallel algorithms that construct the suffix array and the...