Mash: fast genome and metagenome distance estimation using MinHash

Mash: быстрое оценивание расстояний между геномами и метагеномами с использованием MinHash
Sergey Koren, Adam M. Phillippy, Todd J. Treangen, Páll Melsted, Brian Ondov, Adam B. Mallonee, Nicholas H. Bergman
2016-06-20

MashMinHashgenome distance estimationmetagenome clusteringmutation distance P-value
Mash extends the MinHash dimensionality-reduction technique to include a pairwise mutation distance and P value significance test, enabling the efficient clustering and search of massive sequence collections. Mash reduces large sequences and sequence sets to small, representative sketches, from which global mutation distances can be rapidly estimated. We demonstrate several use cases, including the clustering of all 54,118 NCBI RefSeq genomes in 33 CPU h; real-time database search using assembled or unassembled Illumina, Pacific Biosciences, and Oxford Nanopore data; and the scalable clustering of hundreds of metagenomic samples by composition. Mash is freely released under a BSD license ( https://github.com/marbl/mash ).
1
Mash adapts the MinHash technique to compute a pairwise mutation distance and associated P-value significance test for sequences.
2
Mash enables efficient clustering and search of massive sequence collections, demonstrated by clustering 54,118 NCBI RefSeq genomes in 33 CPU hours.
3
Mash is freely available under a BSD license at https://github.com/marbl/mash.
4
Mash represents large sequences and sequence sets as small sketches that enable rapid estimation of global mutation distances.
5
Mash scales to metagenomics by enabling clustering of hundreds of metagenomic samples based on composition.
6
Mash supports real-time database search on both assembled and unassembled sequencing reads from Illumina, Pacific Biosciences, and Oxford Nanopore platforms.

Genomes and metagenomes represented as MinHash sketches

Estimation of pairwise mutation distances and significance (P value) for fast clustering and search of large sequence collections using MinHash-based sketches

Publication Details
Publication Date
2016-06-20
Journal
Publisher
ISSN
Cited by
3429
Access Type
Author Information
Authors
Sergey Koren
Adam M. Phillippy
Todd J. Treangen
Páll Melsted
Brian Ondov
Adam B. Mallonee
Nicholas H. Bergman
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%