Poyias / mBonsaiView external linksLinks
Compact Tree Representation
☆16Mar 16, 2017Updated 8 years ago
Alternatives and similar repositories for mBonsai
Users that are interested in mBonsai are comparing it to the libraries listed below
Sorting:
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- Lightweight C++ library for reading FASTA and FASTQ files.☆11Feb 16, 2019Updated 6 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 2 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆14Apr 6, 2017Updated 8 years ago
- This is the codebase for Faucet, described in our manuscript: https://academic.oup.com/bioinformatics/article/34/1/147/4004871, by Roye R…☆18May 21, 2017Updated 8 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 2 months ago
- Detection of structural variants in cancer mate-pair and paired-end data☆13May 3, 2019Updated 6 years ago
- Calculate sets of Unicode characters☆19Jun 21, 2025Updated 7 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- String Visualizer☆12Dec 18, 2025Updated last month
- linear time suffix array construction algorithm☆12Oct 28, 2016Updated 9 years ago
- ☆14Feb 7, 2020Updated 6 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Succinct Data Structure Library 3.0☆102Dec 15, 2025Updated 2 months ago
- Using reference-free compressed data structures to analyse thousands of human genomes (1000 Genomes ReadServer)☆14Sep 23, 2017Updated 8 years ago
- FM-index representation of a de Bruijn graph☆26Aug 7, 2017Updated 8 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Sep 16, 2022Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- ☆15Mar 7, 2016Updated 9 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- Paper Collection for Stringologists☆17Feb 7, 2026Updated last week
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- Compressive Read-mapping Accelerator☆14Sep 7, 2016Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago