Evidence map›Paper›PMID 40027788›Full record

ArticlebioRxiv : the preprint server for biology2025

EvANI benchmarking workflow for evolutionary distance estimation.

Sina Majidian, Stephen Hwang, Mohsen Zakeri, Ben Langmead

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

4 authors.

Sina MajidianDepartment of Computer Science, Johns Hopkins University, Baltimore, USA.ORCID 0000-0001-5345-6982
Stephen HwangXDBio Program, Johns Hopkins University, Baltimore, USA.
Mohsen ZakeriDepartment of Computer Science, Johns Hopkins University, Baltimore, USA.
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, Baltimore, USA.ORCID 0000-0003-2437-1976

Funding

Methods for sequencing data analysis and archive-scale data science - RenewalR35GM139602 · NIGMS · JOHNS HOPKINS UNIVERSITY · PI Benjamin Thomas Langmead · 2021 to 2026
$5.0M
NIGMS NIH HHS R35 GM139602
6 · The paper itself

Abstract

Advances in long-read sequencing technology has led to a rapid increase in high-quality genome assemblies. These make it possible to compare genome sequences across the Tree of Life, deepening our understanding of evolutionary relationships. Average nucleotide identity (ANI) is a distance measure that has been applied to species delineation, building of guide trees, and searching large sequence databases. Since computing ANI is computationally expensive, the field has increasingly turned to sketch-based approaches that use assumptions and heuristics to speed this up. We propose a suite of simulated and real benchmark datasets, together with a rank-correlation-based metric, to study how these assumptions and heuristics impact distance estimates. We call this evaluation framework EvANI. With EvANI, we show that ANIb is the ANI estimation algorithm that best captures tree distance, though it is also the least efficient. We show that

Indexed as

Average nucleotide identityBLASTEvolutionGenomeK-merSketching

Identifiers

PMID40027788
PMCPMC11870633

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.