Mash: Fast Genome and Metagenome Distance Estimation Using MinHash.¶
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., & Phillippy, A. M. (2016). Mash: Fast Genome and Metagenome Distance Estimation Using MinHash. Genome Biology, 17.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Hashing
- In biology and chemistry it is locality-sensitive hashing of DNA k-mers for genome similarity and molecular fingerprints that hash substructures so two molecules can be compared by fingerprint distance.
This sourceApplies locality-sensitive MinHash sketches to DNA k-mers, reducing genomes to short sketches whose distance estimates genome similarity.
Supported in partVerified against the publisher's abstract
Mash's abstract supports only the DNA k-mer genome-distance clause: it uses MinHash sketches of k-mers to estimate sequence similarity, not the other listed applications.
“The dist function compares two sketches and returns an estimate of the Jaccard index (i.e. the fraction of shared k-mers), a P value, and the Mash distance, which estimates the rate of sequence mutation under a simple evolutionary model”
- In biology and chemistry it is locality-sensitive hashing of DNA k-mers for genome similarity and molecular fingerprints that hash substructures so two molecules can be compared by fingerprint distance.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:dd25f432533f · see in the full table