PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees
Molecular Biology and Evolution · 06.11.2026
DOI: 10.1093/molbev/msag277 ↗Kurz gefasst
Fachartikel in der Zeitschrift Molecular Biology and Evolution, online erschienen am 06.11.2026. Verfasst von Katyayni Ganesan und 7 weiteren Autor:innen. Beteiligte Einrichtung: Institute for Computational Cancer Biology (ICCB), Center for Integrated Oncology (CIO), Cancer Research Center Cologne Essen (CCCE), Faculty of Medi…. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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 accuracy and remains competitive in speed while scaling to trees with more than a hundred thousand taxa. We apply it to viral and bacterial phylogenies, single-cell cancer phylogenies, archaeal and avian phylogenomics, gene family evolution, and plant conservation genomics. By providing a standardized method for partitioning phylogenetic trees, PhytClust yields partitions that are reproducible, exactly optimal under a stated objective, and computable on large trees.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Institute for Computational Cancer Biology (ICCB), Center for Integrated Oncology (CIO), Cancer Research Center Cologne Essen (CCCE), Faculty of Medicine and University Hospital Cologne, University of Cologne, Cologne,…
- BIFOLD-Berlin Institute for the Foundations of Learning and Data, Berlin, Germany.
- Department of Electrical Engineering and Computer Science, Technische Universität Berlin, Berlin, Germany.
- Department of Computational Biology, University of Lausanne, Lausanne, Switzerland, Swiss Institute of Bioinformatics, Lausanne, Switzerland.
ORCID-Profile: Katyayni Ganesan
Zitieren
APA
Ganesan, K., Billard, E., Kaufmann, T. L., Strange, C. B., Cwikla, M. C., Altenhoff, A. M., Dessimoz, C., & Schwarz, R. F. (2026). PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees. Molecular Biology and Evolution. https://doi.org/10.1093/molbev/msag277
Vancouver
Ganesan K, Billard E, Kaufmann TL, Strange CB, Cwikla MC, Altenhoff AM, et al. PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees. Molecular Biology and Evolution. 2026. doi:10.1093/molbev/msag277
BibTeX
@article{Ganesan2026,
author = {Ganesan, Katyayni and Billard, Elisa and Kaufmann, Tom L and Strange, Cody B and Cwikla, Maja C and Altenhoff, Adrian M and Dessimoz, Christophe and Schwarz, Roland F},
title = {PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees},
journal = {Molecular Biology and Evolution},
year = {2026},
doi = {10.1093/molbev/msag277}
}
EUVIMED