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
.
Efficient Wavelet Tree Construction and Querying for Multicore Architectures
[chapter]
2014
Lecture Notes in Computer Science
Wavelet trees have become very useful to handle large data sequences efficiently. By the same token, in the last decade, multicore architectures have become ubiquitous, and parallelism in general has become extremely important in order to gain performance. This paper introduces two practical multicore algorithms for wavelet tree construction that run in O(n) time using lg σ processors, where n is the size of the input and σ the alphabet size. Both algorithms have efficient memory consumption.
doi:10.1007/978-3-319-07959-2_13
fatcat:3ri2tqxejnbozoxqjorjy3uzza