arrow
Return

EvANI benchmarking workflow for evolutionary distance estimation

delete2025-05-01
delete0
PRE
AI
S
Sina Majidian
S
Stephen Hwang
M
Mohsen Zakeri
DOI:10.1093/bib/bbaf267delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Advances in long-read sequencing technology have 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 metric for estimating the genetic similarity between two genomes, usually calculated as the mean identity of their shared genomic regions. These regions are typically found with genome aligners like Basic Local Alignment Search Tool BLAST or MUMmer. ANI has been applied to species delineation, building guide trees, and searching large sequence databases. Since computing ANI via genome alignment 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 k-mer-based approaches are extremely efficient and have consistently strong accuracy. We also show that some clades have inter-sequence distances that are best computed using multiple values of $k$, e.g. $k=10$ and $k=19$ for Chlamydiales. Finally, we highlight that approaches based on maximal exact matches may represent an advantageous compromise, achieving an intermediate level of computational efficiency while avoiding over-reliance on a single fixed k-mer length.
Keywords:
genome
average nucleotide identity
evolution
BLAST
k-mer
sketching

Journal

Briefings in Bioinformatics cover
Briefings in Bioinformatics
IF:
7.7
Papers:
5.8K
Citations:
2.7W

Organization

J
johns hopkins university
Scholars:
1.1W
Papers: 4.1K
Citations: 1
Cited Papers

Cited Papers

A large-scale evaluation of algorithms to calculate average nucleotide identity
err2017-02-15
err0
PREAI
errSeok-Hwan Yoon; Sung-min Ha; Jeongmin Lim; Soonjae Kwon; Jongsik Chun
errShare
errSave
LexicHash: sequence similarity estimation via lexicographic comparison of hashes
err2023-11-01
err0
PREAI
errGreenberg,Grant; Ravi,Aditya Narayan; Shomorony,Ilan
errShare
errSave
HyperGen: compact and efficient genome sketching using hyperdimensional vectors
err2024-07-16
err0
errOAAI
errWeihong Xu; Po-Kai Hsu; Niema Moshiri; Shimeng Yu; Tajana Rosing
errShare
errSave
A DNA hybridization method for typing hepatitis C virus genotype 2c
err1997-05-01
err0
PREAI
errMaria Raffaella Biasin; Gianfranco Fiordalisi; Isabella Zanella; Ada Cavicchini; Giuditta Marchelle; Domenico Infantolino
errShare
errSave
New developments for the Quest for Orthologs benchmark service
err2024-12-11
err0
errOAAI
errAltenhoff, Adrian; Nevers, Yannis; Tran, Vinh; Jyothi, Dushyanth; Martin, Maria; Cosentino, Salvatore; Majidian, Sina; Marcet-Houben, Marina; Fuentes-Palacios, Diego; Persson, Emma; Walsh, Thomas; Lecompte, Odile; Gabaldon, Toni; Kelly, Steven; Hu, Yanhui; Iwasaki, Wataru; Capella-Gutierrez, Salvador; Dessimoz, Christophe; Thomas, Paul D.; Ebersberger, Ingo; Sonnhammer, Erik
errShare
errSave
researcher View more