Succinct data structures using very efficient rank and select

Dynatrace FM-Index library

Succinct Data Structure Library 3.0

A Discrete Fourier Transform (DFT), a Fast Wavelet Transform (FWT), and a Wavelet Packet Transform (WPT) algorithm in 1-D, 2-D, and 3-D using normalized orthogonal (orthonormal) Haar, Coiflet, Daubechie, Legendre and normalized biorthognal wavelets in Java.

Representation of Binary Relations using a Wavelet Tree

Parallel Wavelet Tree and Wavelet Matrix Construction

Wavelet Tree

A string library

Succinct data structures for CMSC858D

Vowel detection using Descomposition Tree on MATLAB

Hybride parallele Konstruktion von Wavelet Trees

Wavelet tree based on a fixed block boosting technique

Wavelet Tree

OCaml implementations of succinct bitvector rank/select and wavelet trees, wrapping the bitv library

A student project (Fachprojekt)

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.

Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,

Implementation of the wavelet trie data structure

Construction of binary wavelet trees using RRR structure