Self-contained, multi-threaded fasta/q parser
☆50Mar 10, 2026Updated 7 months ago
Alternatives and similar repositories for FQFeeder
Users that are interested in FQFeeder are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆58Mar 4, 2024Updated 2 years ago
- ☆24Apr 2, 2021Updated 5 years ago
- ☆14Jul 30, 2026Updated 3 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 5 months ago
- A hash map using the BooPHF perfect hash function☆13Sep 25, 2016Updated 10 years 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.
- A pure rust reimplementation of rapid-gzip by Maximilian Knespel and Holger Brunst☆23Aug 10, 2026Updated 2 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- How many distinct k-mers are there in a sequence?☆11Oct 26, 2026Updated last week
- Somatic (mosaic) SNV caller for 10X Genomics data using random forest classification and feature-based filters☆23Apr 1, 2019Updated 7 years ago
- ☆15Dec 8, 2022Updated 3 years ago
- A SIMD-accelerated library to compute random minimizers☆49Oct 26, 2026Updated last week
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 7 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 10 months ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- An optimal space run-length Burrows-Wheeler transform full-text index☆27Oct 28, 2021Updated 5 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆101Oct 1, 2026Updated last month
- 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
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated 2 years ago
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆36Aug 4, 2021Updated 5 years ago
- A Python wrapper for the bbhash library for Minimal Perfect Hashing☆18Oct 26, 2025Updated last year
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- Homology-based ANI estimation at unprecedented scales🦀☆25Oct 4, 2026Updated 3 weeks ago
- A Rust implementation of SSHash☆20Oct 19, 2026Updated last week
- semi-reference-based short read compression☆11Mar 5, 2019Updated 7 years ago
- kmer-counter☆19Updated this week
- ☆18Jul 9, 2018Updated 8 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆23Updated this week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Classify sequencing reads using MinHash.☆47Apr 6, 2020Updated 6 years ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 4 years 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.
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Sep 18, 2026Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Sep 3, 2026Updated last month
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Oct 1, 2026Updated last month
- Improved multi-sample transcript abundance estimates using adaptive priors☆20Oct 29, 2018Updated 8 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆20Oct 28, 2023Updated 3 years ago