A small, auxiliary index to massively improve parallel fastq parsing
☆32Mar 6, 2026Updated 7 months ago
Alternatives and similar repositories for mim
Users that are interested in mim are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆14Jul 30, 2026Updated 3 months ago
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- kmer-counter☆19Updated this week
- A SIMD-accelerated library to compute random minimizers☆49Updated this week
- A pure rust reimplementation of rapid-gzip by Maximilian Knespel and Holger Brunst☆23Aug 10, 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.
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Fast long-read RNA-seq mapping to a transcriptome with locally consistent parsing☆21Oct 24, 2026Updated last week
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆21Aug 26, 2026Updated 2 months ago
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆51Oct 22, 2026Updated last week
- How many distinct k-mers are there in a sequence?☆11Feb 4, 2026Updated 8 months ago
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆18Apr 1, 2026Updated 6 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆25Nov 20, 2025Updated 11 months ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆23Updated this week
- Run a command and report its process tree's CPU, memory, and I/O usage☆21Oct 20, 2026Updated last week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 3 months ago
- ☆28Jun 16, 2026Updated 4 months ago
- Mumemto: multi-MUM and MEM finding across pangenomes☆139Sep 21, 2026Updated last month
- ☆13Oct 23, 2026Updated last week
- ☆15Oct 23, 2026Updated last week
- ☆21Feb 15, 2025Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Updated this week
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- A Rust implementation of SSHash☆20Oct 19, 2026Updated last week
- Fast DNA search and [host] depletion using minimizers☆128Updated this week
- ☆19Aug 25, 2026Updated 2 months ago
- Compressed, associative, and exact hash table for k-mers☆11Oct 15, 2026Updated 2 weeks ago
- ☆18Oct 12, 2026Updated 2 weeks ago
- Tearing through FASTA/Q sequences☆42Updated this week
- Make SVG figures out of the Burrows-Wheeler Matrix and various auxiliary text-space and BWT-space structures☆12Oct 14, 2025Updated last year
- Fast sequence distance estimates☆35Updated this week
- Skiver: Reference-free quality control of (meta)genomic sequencing datasets using (k, v)-mer sketches☆13Aug 19, 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.
- sunburst plots for taxonomy - working to update Krona☆48Sep 22, 2025Updated last year
- An extensible and performant aligner and read mapper☆107Oct 14, 2026Updated 2 weeks ago
- ☆10Jan 20, 2026Updated 9 months ago
- Strain-level haplotyping for metagenomes with short or long-reads.☆71Apr 10, 2025Updated last year
- Fast approximate string searching☆171Updated this week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆49Sep 18, 2026Updated last month