Running header: Relative order of speciation or coalescence events
Running header: Relative order of speciation or coalescence events
复制标题
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Tanja Gernhard;Daniel J. Ford;Rutger Vos;M. Steel
中科院分区：
文献类型：
--
作者：
Tanja Gernhard;Daniel J. Ford;Rutger Vos;M. Steel
从违反时钟进化的数据重建大型系统发育树(或作为由任何m个输入树构建的超树)对生物学家提出了一个困难的问题，如何为树的顶点分配相对日期？在这篇文章中，我们研究这个问题，假设树的内部顶点的阶上的分布是一致的(它包括但比树上流行的Yule分布更一般)。我们推导出快速算法来计算(I)树中的任何给定顶点是第j个物种形成事件(对于每个j)的概率，以及(Ii)任何一个给定顶点在树中早于第二个给定顶点。我们展示了如何使用第一个算法来计算在恒定速率物种形成模型或合并模型下生成的任何给定树中任何给定内边的预期长度。
The reconstruction of large phylogenetic trees from data that violates clocklike evolution (or as a supertree constructed from any m input trees) raises a difficult question for biologists how can one assign relative dates to the vertices of the tree? In this paper we investigate this problem, assuming a uniform distribution on the order of the inner vertices of the tree (which includes, but is more general than, the popular Yule distribution on trees). We derive fast algorithms for computing the probability that (i) any given vertex in the tree was the j–th speciation event (for each j), and (ii) any one given vertex is earlier in the tree than a second given vertex. We show how the first algorithm can be used to calculate the expected length of any given interior edge in any given tree that has been generated under either a constant-rate speciation model, or the coalescent model.