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

最大一致森林的固定参数近似算法

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

Chris Whidden, Robert G. Beiko, Norbert Zeh

摘要:

我们提出了新的和改进的固定参数算法计算最大协议森林(MAF)对有根二进制系统发育树。这样的森林的大小对应于两棵树的子树修剪和嫁接距离,如果协议森林是非循环的,他们的杂交数。这些距离测量是理解网状进化的重要工具。我们的算法计算最大无环协议森林是第一个深度有界搜索算法这个问题。我们的算法大大优于这些问题的最好的以前的算法。

英文摘要:

We present new and improved fixed-parameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft distance and, if the agreement forest is acyclic, to their hybridization number. These distance measures are essential tools for understanding reticulate evolution. Our algorithm for computing maximum acyclic agreement forests is the first depth-bounded search algorithm for this problem. Our algorithms substantially outperform the best previous algorithms for these problems.

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

↑