Quickly search, compare, and analyze genomic and metagenomic data sets.
-
Updated
Sep 21, 2024 - Python
Quickly search, compare, and analyze genomic and metagenomic data sets.
Remove contaminated contigs from genomes using k-mers and taxonomies.
This work presents a way to write extensions in Rust and use them in Python, using sourmash as an example.
A database for signatures of public genomic sources
fast, multithreaded sourmash operations: search, compare, and gather.
Here we describe an extension of MinHash that permits accurate compositional analysis of metagenomes with low memory and disk requirements.
Poster presented at RECOMB 2017
Searching large collections of sequencing data with genome-scale queries
Streaming de Bruijn and Compact de Bruijn Graph Algorithms
Find disease associations across metagenomes with k-mers using sourmash, and then recover pangenomic accessory elements using spacegraphcats.
Poster and talk presented at Bioinformatics for the Microbiome Symposium at Stanford on 2018-09-24
Meta-analysis of metagenomes via machine learning and assembly graphs reveals strain switches in Crohn’s disease
Workflow and config files for searching (very) large public databases with sourmash sketches
Add a description, image, and links to the sourmash topic page so that developers can more easily learn about it.
To associate your repository with the sourmash topic, visit your repo's landing page and select "manage topics."