Fast and scalable minimal perfect hashing for massive key sets
☆149Jul 8, 2024Updated last year
Alternatives and similar repositories for rust-boomphf
Users that are interested in rust-boomphf are comparing it to the libraries listed below
Sorting:
- De Bruijn graphs in Rust☆71Jul 22, 2024Updated last year
- ☆11Dec 9, 2022Updated 3 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Single-Cell RNA-seq pseudo-aligner☆52May 6, 2024Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Aug 4, 2021Updated 4 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆56May 29, 2024Updated last year
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆22Dec 14, 2024Updated last year
- Rust wrapper of the BWA C API☆18May 23, 2025Updated 9 months ago
- ☆18May 10, 2023Updated 2 years ago
- Rust libraries and programs focused on succinct data structures☆157Feb 12, 2026Updated 2 weeks ago
- DNA kmer operations for nim☆14Apr 24, 2022Updated 3 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- GBZ file format for pangenome graphs☆46Feb 18, 2026Updated 2 weeks ago
- A SIMD-accelerated library to compute random minimizers☆39Updated this week
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- A bit-packed k-mer representation (and relevant utilities) for rust☆47Jun 26, 2024Updated last year
- Fast FASTX parsing and k-mer methods in Rust☆210Jan 27, 2026Updated last month
- a GFA toolkit☆13Oct 4, 2024Updated last year
- Nanopore read de-multiplexer☆13Mar 25, 2020Updated 5 years ago
- String algorithm visualizations☆13Feb 7, 2023Updated 3 years ago
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- C implementation of the Landau-Vishkin algorithm☆35Apr 8, 2022Updated 3 years ago
- ☆28Apr 9, 2025Updated 10 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Jul 27, 2023Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 3 years ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆37May 29, 2025Updated 9 months ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated last month
- SIMD-accelerated library for computing global and X-drop affine gap penalty sequence-to-sequence or sequence-to-profile alignments using …☆139Jun 23, 2024Updated last year
- Rust bindings to minimap2 library☆109Feb 22, 2026Updated last week
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆251Feb 24, 2026Updated last week
- Succinct Data Structures for Rust☆59Jun 8, 2025Updated 8 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Bioinformatics 101 tool for counting unique k-length substrings in DNA☆33Feb 17, 2026Updated 2 weeks ago
- Rust crate with bindings and interface to the SPOA library for generating consensus sequences.☆12Apr 16, 2019Updated 6 years ago
- Benchmark MinION assembler pipelines and publish your results in a heartbeat!☆15Feb 11, 2020Updated 6 years ago