Accurate and Efficient Phylogenetic Inference through End-To-End Deep Learning

Accurate phylogenetic inference is crucial for understanding evolutionary relationships among species. Deep learning technique has been introduced for phylogenetic inference; however, the existing deep learning-based approaches either suffer from limited accuracy as they split inference into several disjoint stages, or exhibit low efficiency and hardly apply to the cases with over 20 species. Here, we present an accurate and efficient approach to phylogenetic inference. Our approach, called NeuralNJ, employs an end-to-end framework that directly constructs phylogenetic trees from the input taxa, thus effectively avoiding the inaccuracy incurred by the split inference stages. The key innovation of NeuralNJ lies in its learnable neighbor joining mechanism, which iteratively joins neighbors guided by learned priority scores and thereby achieves accurate tree reconstruction. The inference accuracy is further enhanced through incorporating reinforcement learning-based tree search. Using both simulated and empirical data as representatives, we demonstrate that NeuralNJ can effectively infer phylogenetic tree with improved computational efficiency and reconstruction accuracy. The study paves the way to accurate and efficient phylogenetic inference for hundreds of taxa in complex evolutionary scenarios.

Authors

Institutions

Publication Details

Journal
Molecular Biology and Evolution
Published
2025-10-23
DOI
https://doi.org/10.1093/molbev/msaf260
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accurate and Efficient Phylogenetic Inference through End-To-End Deep Learning

Jianquan Zhao, Xinru Zhang, Dongbo Bu, Chungong Yu et al.
Molecular Biology and Evolution
Genomics and Phylogenetic Studies
article

Accurate and Efficient Phylogenetic Inference through End-To-End Deep Learning

Jianquan Zhao, Xinru Zhang, Dongbo Bu, Chungong Yu, Shizhe Ding
article en

Abstract

Accurate phylogenetic inference is crucial for understanding evolutionary relationships among species. Deep learning technique has been introduced for phylogenetic inference; however, the existing deep learning-based approaches either suffer from limited accuracy as they split inference into several disjoint stages, or exhibit low efficiency and hardly apply to the cases with over 20 species. Here, we present an accurate and efficient approach to phylogenetic inference. Our approach, called NeuralNJ, employs an end-to-end framework that directly constructs phylogenetic trees from the input taxa, thus effectively avoiding the inaccuracy incurred by the split inference stages. The key innovation of NeuralNJ lies in its learnable neighbor joining mechanism, which iteratively joins neighbors guided by learned priority scores and thereby achieves accurate tree reconstruction. The inference accuracy is further enhanced through incorporating reinforcement learning-based tree search. Using both simulated and empirical data as representatives, we demonstrate that NeuralNJ can effectively infer phylogenetic tree with improved computational efficiency and reconstruction accuracy. The study paves the way to accurate and efficient phylogenetic inference for hundreds of taxa in complex evolutionary scenarios.

Molecular Biology and EvolutionVol. 42(11)
Institute of Computing Technology (CN), Henan Academy of Sciences (CN), Beijing Academy of Artificial Intelligence (CN), University of Chinese Academy of Sciences (CN)
Openalex Percentile: Top 73%
Genomics and Phylogenetic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.