Spectral Cluster Supertree: fast and statistically robust merging of rooted phylogenetic trees

Author:

McArthur Robert N.ORCID,Zehmakan Ahad N.ORCID,Charleston Michael A.ORCID,Huttley GavinORCID

Abstract

AbstractThe 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 Supertree’s 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 assc-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.

Publisher

Cold Spring Harbor Laboratory

Reference34 articles.

1. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees

2. On a matching distance between rooted phylogenetic trees;Damian Bogdanowicz and Krzysztof Giaro;Interna-tional Journal of Applied Mathematics and Computer Science,2013

3. Metrics on spaces of finite trees

4. Estimating Time Nonreversible Amino Acid Substitution Models;Syst Biol,2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3