通过系统扩展有向无环图寻找高后验密度系统发育树
Finding high posterior density phylogenies by systematically extending a directed acyclic graph
AI总结:
本文基于子分裂有向无环图 sDAG 研究系统搜索高后验密度系统发育树的方法,提出两种局部重排排序与选择方案,并发现简单聚合策略更快且能找回更多可能树。
摘要:
贝叶斯系统发育学通常使用马尔可夫链蒙特卡洛方法来估计后验分布或其各个方面。这些方法通过应用局部重排,使一棵树作为随机游走在其树空间中移动,从而对树空间进行积分。先前的工作探索了用系统搜索取代这种随机游走的可能性,但很快就因后验分布中大量可能的树而难以为继。在本文中,我们利用最近提出的一种称为子分裂有向无环图(subsplit directed acyclic graph,sDAG)的结构,开发了规避这一问题的方法。该结构可以同时表示许多树,而树的局部重排可转化为扩大 sDAG 的方法。在此,我们提出了两种在 sDAG 上引入、排序和选择局部重排的方法,以生成一组具有高后验密度的树。其中一种方法在一系列数据集上成功恢复了高后验密度树集合。然而,我们发现,一种将树聚合到 sDAG 中的更简单策略实际上计算速度更快,并能返回更高比例的可能树。
英文摘要:
Bayesian phylogenetics typically estimates a posterior distribution, or aspects thereof, using Markov chain Monte Carlo methods. These methods integrate over tree space by applying local rearrangements to move a tree through its space as a random walk. Previous work explored the possibility of replacing this random walk with a systematic search, but was quickly overwhelmed by the large number of probable trees in the posterior distribution. In this paper we develop methods to sidestep this problem using a recently introduced structure called the subsplit directed acyclic graph (sDAG). This structure can represent many trees at once, and local rearrangements of trees translate to methods of enlarging the sDAG. Here we propose two methods of introducing, ranking, and selecting local rearrangements on sDAGs to produce a collection of trees with high posterior density. One of these methods successfully recovers the set of high posterior density trees across a range of data sets. However, we find that a simpler strategy of aggregating trees into an sDAG in fact is computationally faster and returns a higher fraction of probable trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。