De Bruijn graph representation in low memory
☆35Jul 6, 2024Updated last year
Alternatives and similar repositories for Blight
Users that are interested in Blight are comparing it to the libraries listed below
Sorting:
- SeqOthello supports fast coverage query and containment query.☆12May 8, 2019Updated 6 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆53Updated this week
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆92Feb 20, 2026Updated last week
- ntHash implementation in Rust☆36Jul 12, 2024Updated last year
- ☆14Oct 14, 2020Updated 5 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- ☆10Jun 9, 2020Updated 5 years ago
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- compacted de Bruijn graph construction in low memory☆100Nov 4, 2025Updated 3 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Aug 4, 2021Updated 4 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 3 years ago
- The Modular Aligner and The Modular SV Caller☆46Jul 18, 2023Updated 2 years ago
- Histosketching Using Little Kmers☆56May 25, 2023Updated 2 years ago
- Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs☆222Oct 23, 2025Updated 4 months 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
- Index and query k-mer matrices in BGZF☆12Apr 30, 2018Updated 7 years ago
- A fast and space-efficient pre-filter for estimating the quantification of very large collections of nucleotide sequences☆14Jan 31, 2026Updated last month
- ☆12Sep 7, 2019Updated 6 years ago
- ☆14Jan 31, 2020Updated 6 years ago
- ☆24Apr 2, 2021Updated 4 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Apr 19, 2020Updated 5 years ago
- Python bindings for Bifrost's compacted colored de Bruijn Graph with a NetworkX-compatible API☆27Oct 20, 2023Updated 2 years ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆55May 17, 2022Updated 3 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆86Dec 15, 2025Updated 2 months ago
- GBZ file format for pangenome graphs☆46Feb 18, 2026Updated last week
- REINDEER REad Index for abuNDancE quERy☆56Jul 6, 2025Updated 7 months ago
- Scalable annotated de Bruijn graphs for DNA indexing, alignment, and assembly☆220Updated this week
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 5 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 8 years ago
- Go implementation of ntHash☆20Sep 16, 2021Updated 4 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Indexing & querying large assembly graphs -- in space, no one can hear you miao!☆118Jan 29, 2026Updated last month
- An efficient index for the colored, compacted, de Bruijn graph☆111Oct 7, 2024Updated last year
- Reference-free variant discovery in large eukaryotic genomes☆42Jul 13, 2021Updated 4 years ago