compacted de Bruijn graph construction in low memory
☆100Nov 4, 2025Updated 3 months ago
Alternatives and similar repositories for bcalm
Users that are interested in bcalm are comparing it to the libraries listed below
Sorting:
- Paired reads mapping on de Bruijn graph☆13Jan 15, 2019Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆55May 17, 2022Updated 3 years ago
- Classify sequencing reads using MinHash.☆48Apr 6, 2020Updated 5 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated last year
- An efficient index for the colored, compacted, de Bruijn graph☆111Oct 7, 2024Updated last year
- Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs☆222Oct 23, 2025Updated 4 months ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆86Dec 15, 2025Updated 2 months ago
- de Bruijn Graph-based read aligner☆35Sep 3, 2018Updated 7 years ago
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆65Feb 1, 2025Updated last year
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Nov 27, 2019Updated 6 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆92Feb 20, 2026Updated last week
- Histosketching Using Little Kmers☆56May 25, 2023Updated 2 years ago
- Accurate, resource-frugal and deterministic DNA sequence classifier.☆36Feb 2, 2026Updated last month
- deSAMBA: fast and accurate classification of metagenomics long reads with sparse approximate matches☆12May 5, 2024Updated last year
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- Genome inference from a population reference graph☆96Apr 1, 2025Updated 11 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- Filter of Pairwise Alignement☆44Jan 31, 2022Updated 4 years ago
- Pan-genome inference and genotyping with long noisy or short accurate reads☆119Dec 13, 2024Updated last year
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Feb 24, 2026Updated last week
- Estimating k-mer coverage histogram of genomics data☆77Dec 13, 2023Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Mar 13, 2025Updated 11 months ago
- minimizer-space de Bruijn graphs (mdBG) for whole genome assembly☆184Sep 19, 2024Updated last year
- Index kmtricks bf matrices☆46Feb 13, 2026Updated 2 weeks ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 3 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- ☆24Apr 2, 2021Updated 4 years ago
- recompute GFA link overlaps☆25Sep 14, 2022Updated 3 years ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated last year
- The Dagstuhl Format for Assembly☆13Oct 16, 2017Updated 8 years ago
- BWT-based index for graphs☆73Mar 12, 2025Updated 11 months ago
- Gfapy: a flexible and extensible software library for handling sequence graphs in Python☆71Nov 13, 2025Updated 3 months ago
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- ☆24Aug 25, 2025Updated 6 months ago