从软件聚类中构造最小系统发生网络是固定参数易处理的
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
摘要：
在这里，我们表明，给定一组分类群X上的一组聚类C，其中|X| =n，可以在时间f（k）.poly（n）中确定是否存在一个在软件意义上代表C中所有聚类的level <= k网络（即每个双连通分量的网状数至多为k的网络），如果是这样，则可以构造这样的网络。这扩展了Kelk，Scornavaca and Van Iersel（2011）的“On the elusiveness of clusters”的多项式时间结果。通过将“level-k generator”的概念推广到一般网络，我们将这个固定参数的易处理性结果推广到k不是指网络的水平而是指整个网络的网状数的问题。
英文摘要：
Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a level-<= k network (i.e. a network where each biconnected component has reticulation number at most k) that represents all the clusters in C in the softwired sense, and if so to construct such a network. This extends a polynomial time result from "On the elusiveness of clusters" by Kelk, Scornavacca and Van Iersel(2011). By generalizing the concept of "level-k generator" to general networks, we then extend this fixed parameter tractability result to the problem where k refers not to the level but to the reticulation number of the whole network.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
