Succinct data structures using very efficient rank and select
-
Updated
Dec 16, 2025 - Rust
#
wavelet-tree
Here are 5 public repositories matching this topic...
Implementation of the wavelet trie data structure
-
Updated
Feb 12, 2019 - Rust
A Wavelet Tree is a Succinct Data Structure that Generalises the Operations of a Bit Vector (like Rank and Select) to an Alphabet of Arbitrary Size. It Works by Recursively Partitioning the Alphabet into Halves, Storing a Bit Vector at Each Node to Indicate which Half an Element Belongs To
-
Updated
Dec 23, 2025 - Rust
Succinct data structures for CMSC858D
-
Updated
Dec 6, 2021 - Rust
Improve this page
Add a description, image, and links to the wavelet-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the wavelet-tree topic, visit your repo's landing page and select "manage topics."