在给定的进化史上估计物种形成或聚合事件的相对顺序
Estimating the relative order of speciation or coalescence events on a given phylogeny
摘要：
从违反时钟进化的数据中重建大型系统发育树（或者从任意m棵输入树中构建超树），这给生物学家提出了一个难题--如何为树的顶点分配相对日期？在本文中，我们调查这个问题，假设均匀分布的顺序的内部顶点的树（其中包括，但更普遍的比，流行的圣诞树分布）。我们得出快速算法计算的概率，（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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
