Poyias / mBonsai
Compact Tree Representation
☆16Updated 8 years ago
Alternatives and similar repositories for mBonsai:
Users that are interested in mBonsai are comparing it to the libraries listed below
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 6 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- linear time suffix array construction algorithm☆12Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated last month
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago