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

节点合理分配的系统发育树构建的Neighbor Joining Plus算法

Neighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper nodes assignment

Piotr Plonski, Jan P. Radomski

摘要:

大多数用于系统发育树重建的主要算法假设分析集中的序列没有任何后代,或者亲本序列可以最大限度地突变成仅两个后代。因此,由这样的假设产生的图形成了一棵二叉树,所有的节点都被标记为叶子。然而,这些约束是不适当的限制,因为有许多数据集具有相同祖先的多个后代。在这里,我们提出了一个解决方案,以更直观的方式分析和可视化这样的集合。该方法将有后代的序列作为内部节点,无后代的序列作为叶节点,重建系统发育树。在生成的树中,没有相邻节点的数量限制,这意味着解树不需要仅仅是一个二叉图。进化路径的后续推导和成对突变在算法上是直接的,边的长度直接对应于突变的数量。其他树重建算法可以扩展所提出的方式,也给无偏拓扑。

英文摘要:

Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such assumptions forms therefore a binary tree, with all the nodes labeled as leaves. However, these constraints are unduly restrictive as there are numerous data sets with multiple offspring of the same ancestors. Here we propose a solution to analyze and visualize such sets in a more intuitive manner. The method reconstructs phylogenetic tree by assigning the sequences with offspring as internal nodes, and the sequences without offspring as leaf nodes. In the resulting tree there is no constraint for the number of adjacent nodes, which means that the solution tree needs not to be a binary graph only. The subsequent derivation of evolutionary pathways, and pair-wise mutations, are then an algorithmically straightforward, with edge's length corresponding directly to the number of mutations. Other tree reconstruction algorithms can be extended in the proposed manner, to also give unbiased topologies.

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

↑