EvANI benchmarking workflow for evolutionary distance estimation
- PMID: 40501070
- PMCID: PMC12159288
- DOI: 10.1093/bib/bbaf267
EvANI benchmarking workflow for evolutionary distance estimation
Abstract
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: BLAST; average nucleotide identity; evolution; genome; k-mer; sketching.
© The Author(s) 2025. Published by Oxford University Press.
Figures











Update of
-
EvANI benchmarking workflow for evolutionary distance estimation.bioRxiv [Preprint]. 2025 Feb 23:2025.02.23.639716. doi: 10.1101/2025.02.23.639716. bioRxiv. 2025. Update in: Brief Bioinform. 2025 May 1;26(3):bbaf267. doi: 10.1093/bib/bbaf267. PMID: 40027788 Free PMC article. Updated. Preprint.
Similar articles
-
EvANI benchmarking workflow for evolutionary distance estimation.bioRxiv [Preprint]. 2025 Feb 23:2025.02.23.639716. doi: 10.1101/2025.02.23.639716. bioRxiv. 2025. Update in: Brief Bioinform. 2025 May 1;26(3):bbaf267. doi: 10.1093/bib/bbaf267. PMID: 40027788 Free PMC article. Updated. Preprint.
-
A large-scale evaluation of algorithms to calculate average nucleotide identity.Antonie Van Leeuwenhoek. 2017 Oct;110(10):1281-1286. doi: 10.1007/s10482-017-0844-4. Epub 2017 Feb 15. Antonie Van Leeuwenhoek. 2017. PMID: 28204908
-
HyperGen: Compact and Efficient Genome Sketching using Hyperdimensional Vectors.Bioinformatics. 2024 Jul 16;40(7):btae452. doi: 10.1093/bioinformatics/btae452. Online ahead of print. Bioinformatics. 2024. PMID: 39012512 Free PMC article.
-
Benchmarking the topological accuracy of bacterial phylogenomic workflows using in silico evolution.Microb Genom. 2022 Mar;8(3):000799. doi: 10.1099/mgen.0.000799. Microb Genom. 2022. PMID: 35290758 Free PMC article.
-
Pan-Genome Storage and Analysis Techniques.Methods Mol Biol. 2018;1704:29-53. doi: 10.1007/978-1-4939-7463-4_2. Methods Mol Biol. 2018. PMID: 29277862 Review.
Cited by
-
Movi Color: fast and accurate long-read classification with the move structure.bioRxiv [Preprint]. 2025 May 27:2025.05.22.655637. doi: 10.1101/2025.05.22.655637. bioRxiv. 2025. PMID: 40502105 Free PMC article. Preprint.
References
-
- Hunt M, Lima L, Shen W. et al. Allthebacteria-all bacterial genomes assembled, available and searchable. Preprint bioRxiv. 2024;2024–03. 10.1101/2024.03.08.584059 - DOI
-
- Jukes TH, Cantor CR (1969) Evolution of protein molecules. In: Munro HN (ed) Mammalian Protein Metabolism, 21–132. 10.1016/B978-1-4832-3211-9.50009-7 - DOI
MeSH terms
Grants and funding
LinkOut - more resources
Full Text Sources
Research Materials
Miscellaneous