Frontiers in Molecular BiosciencesBioinformaticsPeer-reviewed journal article
Spectral Cluster Supertree: fast and statistically robust merging of rooted phylogenetic trees
R A McArthuriD, Ahad N. ZehmakaniD, Michael CharlestoniD, Lin Yu, Gavin A. HuttleyiD
- Citations
- 5
- FWCI
- 0.68
- Field percentile
- top 35%
Abstract
AO_SCPLOWBSTRACTC_SCPLOWThe algorithms for phylogenetic reconstruction are central to computational molecular evolution. The relentless pace of data acquisition has exposed their poor scalability and the conclusion that the conventional application of these methods is impractical and not justifiable from an energy usage perspective. Furthermore, the drive to improve the statistical performance of phylogenetic methods produces increasingly parameter-rich models of sequence evolution, which worsens the computational performance. Established theoretical and algorithmic results identify supertree methods as critical to divide-and-conquer strategies for improving scalability of phylogenetic reconstruction. Of particular importance is the ability to explicitly accommodating rooted topologies. These can arise from the more biologically plausible non-stationary models of sequence evolution. We make a contribution to addressing this challenge with Spectral Cluster Supertree, a novel supertree method for merging a set of overlapping rooted phylogenetic trees. It offers significant improvements over Min-Cut supertree and previous state-of-the-art methods in terms of both time complexity and overall topological accuracy, particularly for problems of large size. We perform comparisons against Min-Cut supertree and Bad Clade Deletion. Leveraging two tree topology distance metrics, we demonstrate that while Bad Clade Deletion generates more correct clades in its resulting supertree, Spectral Cluster Supertrees generated tree is generally more topologically close to the true model tree. Over large datasets containing 10000 taxa and -500 source trees, where Bad Clade Deletion usually takes -2 hours to run, our method generates a supertree in on average 20 seconds. Spectral Cluster Supertree is released under an open source license and is available on the python package index as sc-supertree. This research was undertaken with the assistance of resources and services from the National Computational Infrastructure (NCI), which is supported by the Australian Government.
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
- Advancing Divide-and-Conquer Phylogeny Estimation using Robinson-Foulds Supertrees
Xilin Yu, Thien Le, … Tandy J. Warnow·Algorithms for Molecular BiologyPeer-reviewed·Jun 28, 2021
- Integrating Phylogenies with Chronology to Assemble the Tree of Life
Jose Barba‐Montoya, Jack M. Craig, Sudhir Kumar·Frontiers in BioinformaticsPeer-reviewed·Apr 30, 2025
- Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge
E. K. Molloy, T. Warnow·bioRxiv·Apr 21, 2019
- Speeding up iterative applications of the BUILD supertree algorithm
Benjamin D. Redelings, Mark T. Holder·PeerJPeer-reviewed·Jan 2, 2024
- k-Nearest Common Leaves algorithm for phylogenetic tree completion
Aleksandr Koshkarov, Nadia Tahiri·bioRxiv·Apr 4, 2026
- Scalable distance-based phylogeny inference using divide-and-conquer
Lars Arvestad·bioRxiv·Oct 11, 2023