xxsds / DYNAMICLinks
Dynamic succinct/compressed data structures
☆111Updated 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☆96Updated 3 weeks ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 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
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Bloom-filter based minimal perfect hash function library☆265Updated last month
- Compact Data Structures Library☆101Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- TU DOrtmund lossless COMPression framework☆19Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- A collection of succinct data structures☆209Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- Implementation of the sacabench framework☆17Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Extremely fast inplace radix sort☆42Updated 5 years ago