Dynamic succinct/compressed data structures
☆116Dec 17, 2025Updated 2 months ago
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☆103Dec 15, 2025Updated 2 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 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
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Pan-genome Seed Index☆20Mar 12, 2025Updated 11 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 2 weeks ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- ☆18Jul 9, 2018Updated 7 years 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 12 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 6 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- ☆11Feb 21, 2023Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆36Jan 15, 2025Updated last year
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- BWT-based index for graphs☆73Mar 12, 2025Updated 11 months ago
- Simple succinct data structures (in Rust)☆54Feb 12, 2026Updated 2 weeks ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Nov 27, 2019Updated 6 years ago
- ☆24Apr 2, 2021Updated 4 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Succinct Data Structure Library 2.0☆2,296Jun 2, 2023Updated 2 years ago
- ☆20Aug 18, 2020Updated 5 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago