bioRxivEvolutionary BiologyPreprint
PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees
Katyayni GanesaniD, Elisa Billard, Tom L. KaufmanniD, Cody B StrangeiD, Maja C. CwiklaiD, Adrian AltenhoffiD, Christophe DessimoziD, Roland F. SchwarziD
Abstract
Phylogenetic trees play a fundamental role in elucidating evolutionary relationships among taxa. Clustering taxa remains a major challenge across diverse biological domains such as cancer genomics, microbial systematics, and phylogenomics. Several methods partition taxa in phylogenetic trees into clusters, but these approaches face key limitations. Many rely on user-defined distance thresholds, whose choice often depends on prior knowledge and may be difficult to justify consistently across datasets. More broadly, existing methods often differ in how clusters are defined and commonly rely on heuristics or user-specified criteria to make the search space tractable for large trees. Here, we present PhytClust, a threshold-free algorithm that partitions trees into monophyletic subtrees (clusters) by identifying groups of taxa with low within-cluster dispersion. For a fixed number of clusters, PhytClust finds the exact global optimum under this objective and then selects the optimal number of clusters using a cluster-validity index. The resulting partitions are reproducible and reflect both tree topology and branch lengths. In simulated datasets, PhytClust outperforms existing methods in both speed and accuracy and scales to trees with more than a hundred thousand taxa. We apply PhytClust across cancer genomics, avian phylogenomics, bacterial and archaea phylogenetics, and plant genomics to demonstrate PhytClusts varied applicability. By providing a standardized method for taxa clustering within phylogenetic trees, PhytClust yields reproducible, optimal and computationally efficient clusters.
- research focus: clustering
- research focus: benchmarking
- research focus: phylogenetics / evolution
- approach: deep learning
- approach: statistical model
- Citations
- 0
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Clumps: A Sequential Clustering Approach to Partitioning Sets of Phylogenies with Non-Identical Leaf Sets
Ana Serra Silva, Mark Wilkinson·bioRxiv·Mar 18, 2025
- TreeCluster: clustering biological sequences using phylogenetic trees
Metin Balaban, Niema Moshiri, … Siavash Mirarab·PLoS ONEPeer-reviewed·Aug 22, 2019
- k-Nearest Common Leaves algorithm for phylogenetic tree completion
Aleksandr Koshkarov, Nadia Tahiri·bioRxiv·Apr 4, 2026
- Spectral Cluster Supertree: fast and statistically robust merging of rooted phylogenetic trees
R A McArthur, Ahad N. Zehmakan, … Gavin A. Huttley·Frontiers in Molecular BiosciencesPeer-reviewed·Oct 30, 2024
- The impact of partitioning on phylogenomic accuracy
Diego Darriba, David Posada·bioRxiv·Aug 19, 2015
- phyC: Clustering cancer evolutionary trees
Yusuke Matsui, Atsushi Niida, … Teppei Shimamura·bioRxiv·Aug 12, 2016