Evidence map›Paper›PMID 31801633›Full record

ArticleGenome biology2019

Dashing: fast and accurate genomic distances with HyperLogLog.

Daniel N Baker, Ben Langmead

Abstract readComparative StudyEvaluation Study
In one paragraph

Article in Genome biology, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 65 papers.

0numbers the graph read from it
0cells of the map it votes in
65citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

65 citing papers in PubMed.

  1. DipSkmer: Reference-free population genomics with diploid genome skims.bioRxiv : the preprint server for biology · 2026
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. CoverM: read alignment statistics for metagenomics.Bioinformatics (Oxford, England) · 2025
    Article
  10. Fractional hitting sets for efficient multiset sketching.Algorithms for molecular biology : AMB · 2025
    Article
  11. Article
  12. A survey of k-mer methods and applications in bioinformatics.Computational and structural biotechnology journal · 2024
    Review
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

5 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Daniel N BakerDepartment of Computer Science, Johns Hopkins University, 3400 N Charles St, Baltimore, 21218, USA. dnb@cs.jhu.edu.
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, 3400 N Charles St, Baltimore, 21218, USA. langmea@cs.jhu.edu.ORCID 0000-0003-2437-1976

Funding

Hardening and Scaling Core Genomics SoftwareR01GM118568 · NIGMS · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2016 to 2020
$2.0M
NIGMS NIH HHS R01 GM118568
6 · The paper itself

Abstract

Dashing is a fast and accurate software tool for estimating similarities of genomes or sequencing datasets. It uses the HyperLogLog sketch together with cardinality estimation methods that are specialized for set unions and intersections. Dashing summarizes genomes more rapidly than previous MinHash-based methods while providing greater accuracy across a wide range of input sizes and sketch sizes. It can sketch and calculate pairwise distances for over 87K genomes in 6 minutes. Dashing is open source and available at https://github.com/dnbaker/dashing.

Indexed as

SoftwareGenomicsAlignmentGenomic distanceHyperloglogMetagenomicsSequencingSketch data structures

Identifiers

PMID31801633
PMCPMC6892282

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.