xxsds / DYNAMICLinks
Dynamic succinct/compressed data structures
☆110Updated last year
Alternatives and similar repositories for DYNAMIC
Users that are interested in DYNAMIC are comparing it to the libraries listed below
Sorting:
- Succinct Data Structure Library 3.0☆95Updated last month
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆24Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Bloom-filter based minimal perfect hash function library