一种实用的由多棵二叉树构造树子网络的固定参数算法
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
摘要：
我们提出了第一个固定参数的算法，用于构建一个树的孩子的系统发育网络，显示任意数量的二进制输入树，并在所有这样的网络中具有最小的网状数量。该算法采用最近引入的樱桃采摘序列框架，在$O((8k)^k \mathrm{poly}(n, t))$时间内运行，其中$n$为每棵树的叶子数，$t$为树的个数，$k$为所构建网络的网状数.此外，我们提供了一个有效的并行实现的算法，并表明它可以处理高达$100$输入树在一个标准的台式计算机，从而提供了一个重大的改进，以前的系统发育网络建设方法。
英文摘要：
We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm uses the recently introduced framework of cherry picking sequences and runs in $O((8k)^k \mathrm{poly}(n, t))$ time, where $n$ is the number of leaves of every tree, $t$ is the number of trees, and $k$ is the reticulation number of the constructed network. Moreover, we provide an efficient parallel implementation of the algorithm and show that it can deal with up to $100$ input trees on a standard desktop computer, thereby providing a major improvement over previous phylogenetic network construction methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
