Rust libraries and programs focused on succinct data structures
☆158Mar 23, 2026Updated this week
Alternatives and similar repositories for bsuccinct-rs
Users that are interested in bsuccinct-rs are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Iterate over minimizers of a DNA sequence☆32Jul 12, 2024Updated last year
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 weeks ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Fast and scalable minimal perfect hashing for massive key sets☆149Jul 8, 2024Updated last year
- Rust implementation of the PTHash perfect hash function for static compile-time generated hash tables☆24Feb 10, 2024Updated 2 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆24Nov 20, 2025Updated 4 months ago
- ☆16Jun 22, 2023Updated 2 years ago
- Succinct data structures using very efficient rank and select☆131Feb 18, 2026Updated last month
- Rust implementations of succinct data structures☆69Updated this week
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆20Jan 22, 2026Updated 2 months ago
- PtrHash minimal perfect hash function☆89Sep 2, 2025Updated 6 months ago
- Host depletion optimised for clinical metagenomic sequencing applications☆16Nov 18, 2024Updated last year
- A rust wrapper for the spoa C++ partial order alignment library☆10Jun 11, 2025Updated 9 months ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- A FASTA/FASTQ format parser library☆20Mar 1, 2024Updated 2 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆252Mar 9, 2026Updated 2 weeks ago
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Approximate nearest neighbour search for microbial genomes based on hash metric☆62Mar 7, 2026Updated 2 weeks ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 2 years ago
- String algorithm visualizations☆13Feb 7, 2023Updated 3 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Count lines of code across your entire dependency tree☆22May 13, 2024Updated last year
- A parallelized Rust port of crumsort☆169Aug 24, 2022Updated 3 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆38Mar 9, 2026Updated 2 weeks ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- ☆21Sep 10, 2024Updated last year
- Mapping sequencing data to De Bruijn graphs, fast☆32Updated this week
- Index kmtricks bf matrices☆47Feb 13, 2026Updated last month
- Succinct Data Structures for Rust☆59Jun 8, 2025Updated 9 months ago
- A different approach to an E-graph library☆28May 30, 2025Updated 9 months ago
- Zero-cost bitsets over native Rust types☆79Nov 17, 2025Updated 4 months ago
- The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.☆339Mar 1, 2026Updated 3 weeks ago
- ☆16Apr 6, 2023Updated 2 years ago
- Uniform cubic spline evaluation and inversion in Rust☆24Oct 8, 2025Updated 5 months ago
- Compacted and colored de Bruijn graph construction and querying☆94Mar 6, 2026Updated 2 weeks ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Jul 27, 2023Updated 2 years ago