Scalable annotated de Bruijn graphs for DNA indexing, alignment, and assembly
☆230May 30, 2026Updated last week
Alternatives and similar repositories for metagraph
Users that are interested in metagraph are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- De Bruijn graph representation in low memory☆36Jul 6, 2024Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆55Mar 13, 2025Updated last year
- modular k-mer count matrix and Bloom filter construction for large read collections☆88Mar 24, 2026Updated 2 months ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years 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.
- Pan-genome inference and genotyping with long noisy or short accurate reads☆118Dec 13, 2024Updated last year
- Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs☆224Oct 23, 2025Updated 7 months ago
- Filter of Pairwise Alignement☆44Jan 31, 2022Updated 4 years ago
- Index kmtricks bf matrices☆49Apr 29, 2026Updated last month
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Nov 1, 2022Updated 3 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- ☆16Jun 22, 2023Updated 2 years ago
- URMAP ultra-fast read mapper☆38Jun 15, 2020Updated 5 years ago
- Compacted and colored de Bruijn graph construction and querying☆97Jun 5, 2026Updated last week
- 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.
- Benchmarking pairwise aligners☆37Feb 8, 2025Updated last year
- A pairwise sequence aligner written in Rust☆153May 22, 2026Updated 2 weeks ago
- Genome inference from a population reference graph☆96Apr 1, 2025Updated last year
- Automated strain separation of low-complexity metagenomes☆52Nov 10, 2021Updated 4 years ago
- Extracts subgraphs or components from a graph in GFA format☆24Nov 18, 2024Updated last year
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆77Jun 17, 2024Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆102May 6, 2026Updated last month
- ☆101Apr 22, 2024Updated 2 years ago
- ☆24Aug 25, 2025Updated 9 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.
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 6 months ago
- BWT construction and search☆127Jan 14, 2026Updated 4 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated 2 years ago
- base-accurate DNA sequence alignments using WFA and mashmap3☆217Mar 20, 2026Updated 2 months ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆93Feb 26, 2026Updated 3 months ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆40May 4, 2026Updated last month
- Bifrost graph gene caller.☆98Apr 12, 2026Updated 2 months ago
- Long read aligner for cyclic and acyclic pangenome graphs☆41Dec 20, 2023Updated 2 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆51May 22, 2024Updated 2 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Scrooge is a high-performance pairwise sequence aligner based on the GenASM algorithm. Scrooge includes three novel algorithmic improveme…☆38Jun 23, 2023Updated 2 years ago
- compacted de Bruijn graph construction in low memory☆101Nov 4, 2025Updated 7 months ago
- Paired reads mapping on de Bruijn graph☆13Jan 15, 2019Updated 7 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 4 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 3 weeks ago
- Classify sequencing reads using MinHash.☆48Apr 6, 2020Updated 6 years ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆17Jun 4, 2019Updated 7 years ago