Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
☆44Nov 18, 2023Updated 3 years ago
Alternatives and similar repositories for lphash
Users that are interested in lphash 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 k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated 2 years ago
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- De Bruijn graph representation in low memory☆36Jul 6, 2024Updated 2 years ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated 2 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆25Mar 13, 2025Updated last year
- 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.
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Nov 8, 2026Updated last week
- ☆11Oct 30, 2026Updated 2 weeks ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆25Updated this week
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- ☆12Sep 7, 2019Updated 7 years ago
- ☆24Apr 2, 2021Updated 5 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Sep 18, 2026Updated 2 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.
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Compressed, associative, and exact hash table for k-mers☆11Oct 15, 2026Updated last month
- How many distinct k-mers are there in a sequence?☆11Oct 26, 2026Updated 3 weeks ago
- SIMD-accelerated library for computing global and X-drop affine gap penalty sequence-to-sequence or sequence-to-profile alignments using …☆141Jun 23, 2024Updated 2 years ago
- kmer-counter☆19Updated this week
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 4 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 9 years ago
- a rust library for high throughput binary encoding of genomic sequences☆12Oct 27, 2026Updated 3 weeks ago
- ☆21Dec 26, 2025Updated 10 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 8 months ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆101Oct 1, 2026Updated last month
- A Rust library providing fully dynamic sets of k-mers with high locality☆46May 13, 2026Updated 6 months ago
- semi-reference-based short read compression☆11Mar 5, 2019Updated 7 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆51May 22, 2024Updated 2 years ago
- /ˈskuzi/☆11Sep 30, 2026Updated last month
- Bitpacked sequence trait and implementation☆19Oct 26, 2026Updated 3 weeks ago
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- A SIMD-accelerated library to compute random minimizers☆49Updated this week
- 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.
- Compacted and colored de Bruijn graph construction and querying☆101Nov 3, 2026Updated 2 weeks ago
- parallel algorithms for small hitting set approximations☆11Apr 29, 2021Updated 5 years ago
- Implicit Interval Tree with Interpolation Index☆43Jul 13, 2022Updated 4 years ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆32Jul 27, 2023Updated 3 years ago
- ☆16Jun 22, 2023Updated 3 years ago
- ☆14Oct 14, 2020Updated 6 years ago
- Rust library for processing sequencing reads.☆25Sep 2, 2024Updated 2 years ago
Are these results useful?