PT  - JOURNAL ARTICLE
AU  - Brian D. Ondov
AU  - Todd J. Treangen
AU  - Páll Melsted
AU  - Adam B. Mallonee
AU  - Nicholas H. Bergman
AU  - Sergey Koren
AU  - Adam M. Phillippy
TI  - Mash: fast genome and metagenome distance estimation using MinHash
AID  - 10.1101/029827
DP  - 2016 Jan 01
TA  - bioRxiv
PG  - 029827
4099  - http://biorxiv.org/content/early/2016/04/19/029827.short
4100  - http://biorxiv.org/content/early/2016/04/19/029827.full
AB  - 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 hours; 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).