Poyias / mBonsaiLinks
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
Sorting:
- Dynamic succinct/compressed data structures☆112Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 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
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- linear time suffix array construction algorithm☆12Updated 8 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Succinct Data Structure Library☆106Updated 11 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- TU DOrtmund lossless COMPression framework☆19Updated 10 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 weeks ago