arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.0204q-bio.PE
收藏

给定物种树的排序基因树概率的多项式时间算法

A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree

Tanja Stadler, James H. Degnan

摘要:

在本文中,我们提供了一个多项式时间的算法来计算的概率{ \it排名}基因树拓扑结构的一个给定的物种树,其中排名树拓扑结构是一个树拓扑结构的内部顶点是有序的。因此,如果内部顶点的排序数是多项式数,则可以在多项式时间内计算基因树拓扑的概率。然而,对于给定的物种树,计算具有指数数量的排名的基因树拓扑的概率的复杂性仍然未知。

英文摘要:

In this paper, we provide a polynomial time algorithm to calculate the probability of a {\it ranked} gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The probability of a gene tree topology can thus be calculated in polynomial time if the number of orderings of the internal vertices is a polynomial number. However, the complexity of calculating the probability of a gene tree topology with an exponential number of rankings for a given species tree remains unknown.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑