KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.
☆20Oct 1, 2026Updated last month
Alternatives and similar repositories for kmercamel
Users that are interested in kmercamel are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- 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
- ☆11Oct 30, 2026Updated last week
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- How many distinct k-mers are there in a sequence?☆11Oct 26, 2026Updated last week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 3 months ago
- A Read Aligner with Multi-Genome References☆13Mar 25, 2025Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 5 months ago
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- kmer-counter☆19Updated this week
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆46Mar 9, 2026Updated 7 months ago
- MONI: A Pangenomic Index for Finding MEMs☆38Mar 25, 2025Updated last year
- A SIMD-accelerated library to compute random minimizers☆49Oct 26, 2026Updated last week
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆18Apr 1, 2026Updated 7 months ago
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- Compacted and colored de Bruijn graph construction and querying☆101Updated this week
- A pure rust reimplementation of rapid-gzip by Maximilian Knespel and Holger Brunst☆23Aug 10, 2026Updated 2 months ago
- A Rust implementation of SSHash☆20Oct 30, 2026Updated last week
- String algorithm visualizations☆14Feb 7, 2023Updated 3 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆59Mar 13, 2025Updated last year
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆20Jun 23, 2025Updated last year
- 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.
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆21Aug 26, 2026Updated 2 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆32Jul 27, 2023Updated 3 years ago
- A Rust library for building modular, fast and compact indexes over genomic data☆12Nov 22, 2023Updated 2 years ago
- Singular Genomics Demultiplexing Tool☆16Mar 5, 2024Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Oct 24, 2026Updated last week
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Sep 18, 2026Updated last month
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆23Updated this week
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 8 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.
- Efficient construction of the BWT using string compression☆25May 26, 2026Updated 5 months ago
- Robust individual and aggregate checksums for nucleotide sequences☆18Mar 3, 2026Updated 8 months ago
- MEMO: MEM-based pangenome indexing for k-mer queries☆20Jun 11, 2024Updated 2 years ago
- ☆28Oct 30, 2026Updated last week
- Make SVG figures out of the Burrows-Wheeler Matrix and various auxiliary text-space and BWT-space structures☆12Oct 14, 2025Updated last year
- Building the compacted de Bruijn graph efficiently from references or reads.☆101Oct 1, 2026Updated last month
- ☆18Apr 6, 2023Updated 3 years ago