Dynamic succinct/compressed data structures
☆118Dec 17, 2025Updated 5 months ago
Alternatives and similar repositories for DYNAMIC
Users that are interested in DYNAMIC are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Succinct Data Structure Library 3.0☆107May 28, 2026Updated 2 weeks ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆69May 31, 2023Updated 3 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 4 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- Paper Collection for Stringologists☆17Mar 29, 2026Updated 2 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- A collection of succinct data structures☆215Jan 3, 2024Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆89Jan 25, 2024Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Pan-genome Seed Index☆20Mar 12, 2025Updated last year
- ☆18Jul 9, 2018Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 5 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 6 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 10 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- Simple succinct data structures (in Rust)☆55Apr 18, 2026Updated last month
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- Succinct Data Structure Library 2.0☆2,303Jun 2, 2023Updated 3 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Apr 26, 2022Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆278Jul 16, 2025Updated 10 months ago
- BWT-based index for graphs☆73Mar 12, 2025Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Compact Data Structures Library☆129Sep 4, 2014Updated 11 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 6 months ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 13 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24May 30, 2024Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Jan 15, 2025Updated last year