Cargando…
Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2
A genomic sketch is a small, probabilistic representation of the set of [Formula: see text]-mers in a sequencing data set. Sketches are building blocks for large-scale analyses that consider similarities between many pairs of sequences or sequence collections. Although existing tools can easily comp...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Cold Spring Harbor Laboratory Press
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10538361/ https://www.ncbi.nlm.nih.gov/pubmed/37414575 http://dx.doi.org/10.1101/gr.277655.123 |
_version_ | 1785113308030828544 |
---|---|
author | Baker, Daniel N. Langmead, Ben |
author_facet | Baker, Daniel N. Langmead, Ben |
author_sort | Baker, Daniel N. |
collection | PubMed |
description | A genomic sketch is a small, probabilistic representation of the set of [Formula: see text]-mers in a sequencing data set. Sketches are building blocks for large-scale analyses that consider similarities between many pairs of sequences or sequence collections. Although existing tools can easily compare tens of thousands of genomes, data sets can reach millions of sequences and beyond. Popular tools also fail to consider [Formula: see text]-mer multiplicities, making them less applicable in quantitative settings. Here, we describe a method called Dashing 2 that builds on the SetSketch data structure. SetSketch is related to HyperLogLog (HLL) but discards use of leading zero count in favor of a truncated logarithm of adjustable base. Unlike HLL, SetSketch can perform multiplicity-aware sketching when combined with the ProbMinHash method. Dashing 2 integrates locality-sensitive hashing to scale all-pairs comparisons to millions of sequences. It achieves superior similarity estimates for the Jaccard coefficient and average nucleotide identity compared with the original Dashing, but in much less time while using the same-sized sketch. Dashing 2 is a free, open source software. |
format | Online Article Text |
id | pubmed-10538361 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | Cold Spring Harbor Laboratory Press |
record_format | MEDLINE/PubMed |
spelling | pubmed-105383612023-09-29 Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 Baker, Daniel N. Langmead, Ben Genome Res Methods A genomic sketch is a small, probabilistic representation of the set of [Formula: see text]-mers in a sequencing data set. Sketches are building blocks for large-scale analyses that consider similarities between many pairs of sequences or sequence collections. Although existing tools can easily compare tens of thousands of genomes, data sets can reach millions of sequences and beyond. Popular tools also fail to consider [Formula: see text]-mer multiplicities, making them less applicable in quantitative settings. Here, we describe a method called Dashing 2 that builds on the SetSketch data structure. SetSketch is related to HyperLogLog (HLL) but discards use of leading zero count in favor of a truncated logarithm of adjustable base. Unlike HLL, SetSketch can perform multiplicity-aware sketching when combined with the ProbMinHash method. Dashing 2 integrates locality-sensitive hashing to scale all-pairs comparisons to millions of sequences. It achieves superior similarity estimates for the Jaccard coefficient and average nucleotide identity compared with the original Dashing, but in much less time while using the same-sized sketch. Dashing 2 is a free, open source software. Cold Spring Harbor Laboratory Press 2023-07 /pmc/articles/PMC10538361/ /pubmed/37414575 http://dx.doi.org/10.1101/gr.277655.123 Text en © 2023 Baker and Langmead; Published by Cold Spring Harbor Laboratory Press https://creativecommons.org/licenses/by/4.0/This article, published in Genome Research, is available under a Creative Commons License (Attribution 4.0 International), as described at http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Methods Baker, Daniel N. Langmead, Ben Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title | Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title_full | Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title_fullStr | Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title_full_unstemmed | Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title_short | Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2 |
title_sort | genomic sketching with multiplicities and locality-sensitive hashing using dashing 2 |
topic | Methods |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10538361/ https://www.ncbi.nlm.nih.gov/pubmed/37414575 http://dx.doi.org/10.1101/gr.277655.123 |
work_keys_str_mv | AT bakerdanieln genomicsketchingwithmultiplicitiesandlocalitysensitivehashingusingdashing2 AT langmeadben genomicsketchingwithmultiplicitiesandlocalitysensitivehashingusingdashing2 |