Succinct Data Structure Library 3.0
Parallel Wavelet Tree and Wavelet Matrix Construction
Wavelet tree based on a fixed block boosting technique
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
Representation of Binary Relations using a Wavelet Tree
Bioinformatics course project: Computing the LCP array based on BWT
Hybride parallele Konstruktion von Wavelet Trees
Implementation of: an efficient basic bitvector library with constant-time set and get words; a succint, constant-time bit-vector rank-support data structure; a succint, logarithmic-time bit-vector select-support data structure; and wavelet tree construction on arbitrary texts, with serialization, access, rank, and select query support.
Add a description, image, and links to the wavelet-tree topic page so that developers can more easily learn about it.
To associate your repository with the wavelet-tree topic, visit your repo's landing page and select "manage topics."