⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.
☆59Updated this week
Alternatives and similar repositories for fulgor
Users that are interested in fulgor are comparing it to the libraries listed below
Sorting:
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Mar 13, 2025Updated 11 months ago
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆19Jan 22, 2026Updated last month
- A SIMD-accelerated library to compute random minimizers☆39Updated this week
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- GBZ file format for pangenome graphs☆45Feb 18, 2026Updated last week
- A Rust library providing fully dynamic sets of k-mers with high locality☆47Feb 12, 2026Updated 2 weeks ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Nov 20, 2025Updated 3 months ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Jan 6, 2026Updated last month
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Apr 24, 2025Updated 10 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Updated this week
- k-mers and the like☆22Updated this week
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Mar 13, 2025Updated 11 months ago
- Fast sequence distance estimates☆26Jan 29, 2026Updated last month
- fast, multithreaded sourmash operations: search, compare, and gather.☆25Updated this week
- Validation of sycnmers compared to minimizers☆11May 10, 2025Updated 9 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- Plasmid analysis using rearrangement distances☆50Feb 19, 2026Updated last week
- Building the compacted de Bruijn graph efficiently from references or reads.☆92Feb 20, 2026Updated last week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Optimal sequence-to-graph alignment with recombinations☆40Jul 25, 2025Updated 7 months ago
- ☆21Dec 26, 2025Updated 2 months ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Sep 13, 2025Updated 5 months ago
- A new high-resolution long-read metagenome assembler for even noisy reads☆122Updated this week
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- Viral genome coverage evaluation for metagenomic diagnostics☆27Aug 19, 2025Updated 6 months ago
- Assembled Genomes Compressor☆178Nov 25, 2024Updated last year
- More scalable dereplication for metagenome assembled genomes☆77Dec 17, 2025Updated 2 months ago
- Simple-to-use interactive comparison of two bacterial genomes☆25Jan 30, 2026Updated last month
- PyO3 bindings and Python interface to skani, a method for fast genomic identity calculation using sparse chaining.☆29Aug 20, 2025Updated 6 months ago
- Overview of our data for microbial genomic benchmarking☆35Feb 5, 2026Updated 3 weeks ago
- Fast approximate string searching☆100Updated this week
- BWT construction and search☆126Jan 14, 2026Updated last month
- Efficient and fast querying and parsing of GTDB's data☆29Aug 21, 2025Updated 6 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated last month