EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

EvANI benchmarking workflow for evolutionary distance estimation

Sina Majidian, Stephen Hwang, Mohsen Zakeri, Ben Langmead

Briefings in Bioinformatics · 2025

DOI: 10.1093/bib/bbaf267 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Briefings in Bioinformatics, 2025. Verfasst von Sina Majidian und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science, Johns Hopkins University, 3400 North Charles St., Baltimore, MD 21218, United States. Hauptthemen laut MEDLINE: Algorithms, Benchmarking, Evolution, Molecular, Software. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 76 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIGMS NIH HHS.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsBenchmarkingEvolution, MolecularSoftwarePhylogenyWorkflowComputational BiologyGenomics

Stichwörter der Autor:innen

BLASTaverage nucleotide identityevolutiongenomek-mersketching

Autor:innen und Institutionen

  • Department of Computer Science, Johns Hopkins University, 3400 North Charles St., Baltimore, MD 21218, United States.
  • XDBio Program, Johns Hopkins University, 3400 North Charles St., Baltimore, MD 21218, United States.

Förderung

  • NIGMS NIH HHS

Zitieren

APA

Majidian, S., Hwang, S., Zakeri, M., & Langmead, B. (2025). EvANI benchmarking workflow for evolutionary distance estimation. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbaf267

Vancouver

Majidian S, Hwang S, Zakeri M, Langmead B. EvANI benchmarking workflow for evolutionary distance estimation. Briefings in Bioinformatics. 2025. doi:10.1093/bib/bbaf267

BibTeX
@article{Majidian2025,
  author = {Majidian, Sina and Hwang, Stephen and Zakeri, Mohsen and Langmead, Ben},
  title = {EvANI benchmarking workflow for evolutionary distance estimation},
  journal = {Briefings in Bioinformatics},
  year = {2025},
  doi = {10.1093/bib/bbaf267}
}
Kostenlos starten →