arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.1756q-bio.PEq-bio.QM
收藏

系统发育信息复杂性:测试一棵树比找到它更容易吗?

Phylogenetic information complexity: Is testing a tree easier than finding it?

Mike Steel, Laszlo Szekely, Elchanan Mossel

摘要:

系统发育树描述了一组现代物种从一个共同祖先的进化历史。这些树通常从比对的DNA序列数据重建。在本文中,我们分析解决以下问题:是准确地重建一棵树所需的序列数据量显着超过测试候选树是否是“真正的”树所需的量?我们所说的“显著”,是指这两个量作为所考虑的物种数量的函数,表现出相同的方式。我们证明,对于某种类型的模型,所需的信息量是没有显着不同的,而对于另一种类型的模型,所需的信息来测试树是独立的叶子的数量,而需要重建它的增长与此数量。我们的结果结合概率和组合的参数。

英文摘要:

Phylogenetic trees describe the evolutionary history of a group of present-day species from a common ancestor. These trees are typically reconstructed from aligned DNA sequence data. In this paper we analytically address the following question: is the amount of sequence data required to accurately reconstruct a tree significantly more than the amount required to test whether or not a candidate tree was the `true' tree? By `significantly', we mean that the two quantities behave the same way as a function of the number of species being considered. We prove that, for a certain type of model, the amount of information required is not significantly different; while for another type of model, the information required to test a tree is independent of the number of leaves, while that required to reconstruct it grows with this number. Our results combine probabilistic and combinatorial arguments.

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

↑