arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.2562q-bio.PEcs.DSmath.CO
收藏

系统发育小树林的数学问题

Mathematical aspects of phylogenetic groves

Mareike Fischer

摘要:

基于DNA数据的系统发育树推断物种亲缘关系的新信息是现代生物学的主要挑战之一。但是,尽管技术进步,DNA测序仍然是一个耗时和昂贵的过程。因此,决策标准将是期望的,以先验地决定哪些数据可能对超树贡献新信息,而这些新信息没有被任何输入树显式地显示。Ané等人在2009年提出了一个新的概念,即所谓的小树林,以确定具有构建这种信息超级树潜力的分类单元集。但是,最大的树林可以很容易地在数据库中识别的重要猜想仍然没有得到证明,并发表在艾萨克·牛顿研究所的开放系统发育问题清单上。在本文中,我们表明,该猜想并不普遍成立,但也引入了一个新的概念,即2-重叠groves,克服了这个问题。

英文摘要:

The inference of new information on the relatedness of species by phylogenetic trees based on DNA data is one of the main challenges of modern biology. But despite all technological advances, DNA sequencing is still a time-consuming and costly process. Therefore, decision criteria would be desirable to decide a priori which data might contribute new information to the supertree which is not explicitly displayed by any input tree. A new concept, so-called groves, to identify taxon sets with the potential to construct such informative supertrees was suggested by Ané et al. in 2009. But the important conjecture that maximal groves can easily be identified in a database remained unproved and was published on the Isaac Newton Institute's list of open phylogenetic problems. In this paper, we show that the conjecture does not generally hold, but also introduce a new concept, namely 2-overlap groves, which overcomes this problem.

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

↑