Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction

@article{Labeit2016ParallelLW,
  title={Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction},
  author={Julian Labeit and Julian Shun and Guy E. Blelloch},
  journal={2016 Data Compression Conference (DCC)},
  year={2016},
  pages={33-42}
}
We present parallel lightweight algorithms to construct wavelet trees, rank and select structures, and suffix arrays in a shared-memory setting. The work and depth of our parallel wavelet tree algorithm matches that of the best existing algorithm while requiring asymptotically less memory. Our experiments show that it is both faster and more memory-efficient than existing parallel algorithms. We also present an experimental evaluation of the parallel construction of rank and select structures… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

and P

  • T. Bingmann, A. Eberle
  • Sanders, “Engineering parallel string sorting…
  • 2014
Highly Influential
6 Excerpts

and W

  • G. Nong, S. Zhang
  • H. Chan, “Linear suffix array construction by…
  • 2009
Highly Influential
7 Excerpts

Navarro

  • G F. Claude
  • “Practical rank/select queries over arbitrary…
  • 2009
Highly Influential
3 Excerpts

Sadakane

  • K N.J. Larsson
  • “Faster suffix sorting,” Theor. Comput. Sci.,
  • 2007
Highly Influential
3 Excerpts

Tanaka

  • H H. Itoh
  • “An efficient method for in memory construction…
  • 1999
Highly Influential
3 Excerpts

and J

  • L. Wang, S. Baxter
  • D. Owens, “Fast parallel suffix array on the GPU…
  • 2015

Similar Papers

Loading similar papers…