MitI-7 / WaveletMatrixLinks
implementation of dynamic wavelet matrix(tree) and static wavelet matrix
☆23Updated 6 years ago
Alternatives and similar repositories for WaveletMatrix
Users that are interested in WaveletMatrix are comparing it to the libraries listed below
Sorting:
- An implementation of radix heap☆62Updated 10 years ago
- ☆14Updated 5 years ago
- An implementation of optimized parallel radix sort☆50Updated 6 years ago
- Fast compressed trie dictionary library☆71Updated last year
- Paper Collection for Stringologists☆17Updated 2 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- A Rust implementation of the Quad Wavelet Tree☆43Updated last month
- Collection of succinct data structures in Rust☆100Updated 2 months ago
- 競技プログラミング☆38Updated 2 years ago
- Space efficient (graph) algorithms☆18Updated 5 years ago
- Compact Tree Representation☆16Updated 8 years ago
- String Visualizer☆12Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- TU DOrtmund lossless COMPression framework☆19Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Dynamic succinct/compressed data structures☆111Updated last year
- Succinct Data Structures for Rust☆58Updated 4 months ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆42Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Rust library providing fast language model queries in compressed space☆25Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Static Huffman coding☆10Updated 8 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 months ago