Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
☆53Mar 12, 2024Updated 2 years ago
Alternatives and similar repositories for cosmo
Users that are interested in cosmo are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Nov 28, 2017Updated 8 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 8 years ago
- The Dagstuhl Format for Assembly☆13Oct 16, 2017Updated 8 years ago
- compacted de Bruijn graph construction in low memory☆100Nov 4, 2025Updated 4 months ago
- BWT-based index for graphs☆73Mar 12, 2025Updated last year
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆65Feb 1, 2025Updated last year
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆55May 17, 2022Updated 3 years ago
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- Classify sequencing reads using MinHash.☆48Apr 6, 2020Updated 5 years ago
- StriDe Assembler☆25Nov 23, 2017Updated 8 years ago
- Population-scale detection of novel sequence insertions☆27Aug 16, 2022Updated 3 years ago
- De novo genome assembly and multisample variant calling☆112Mar 28, 2019Updated 6 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Jan 19, 2021Updated 5 years ago
- Pipeline for Evaluating Prokaryotic References☆11Sep 16, 2016Updated 9 years ago
- reference free variant assembly☆34Jul 14, 2023Updated 2 years ago
- ☆14Jan 20, 2016Updated 10 years ago
- Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs☆223Oct 23, 2025Updated 5 months ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 12 years ago
- Accurate, Lightweight Clustering of de novo Transcriptomes using Fragment Equivalence Classes☆31Jun 16, 2024Updated last year
- EXPERIMENTAL implementation of side graph☆10Apr 16, 2015Updated 10 years ago
- semi-reference-based short read compression☆11Mar 5, 2019Updated 7 years ago
- de Bruijn Graph REAd mapping Tool☆14Jul 12, 2017Updated 8 years ago
- Fast approximation of similarity for sets of very different sizes☆20Mar 8, 2022Updated 4 years ago
- Robust individual and aggregate checksums for nucleotide sequences☆17Mar 3, 2026Updated 3 weeks ago
- collection of data structures and algorithms☆19Mar 19, 2019Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- Graph based multi genome aligner☆49Sep 17, 2021Updated 4 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.☆18Feb 26, 2022Updated 4 years ago
- Compressing next-generation sequencing data with extreme prejudice.☆83May 31, 2022Updated 3 years ago
- Estimating k-mer coverage histogram of genomics data☆77Mar 13, 2026Updated last week
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Jun 4, 2022Updated 3 years ago
- my PhD thesis☆36Jul 10, 2019Updated 6 years ago
- in silico plasmid extraction☆13Sep 18, 2017Updated 8 years ago
- Enhanced Artificial Genome Engine: next generation sequencing reads simulator☆33May 20, 2020Updated 5 years ago
- A Python wrapper for the bbhash library for Minimal Perfect Hashing☆19Oct 26, 2025Updated 4 months ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Feb 19, 2020Updated 6 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆46Jan 18, 2019Updated 7 years ago