Wang J
College of Computer Science, Inner Mongolia University, Hohhot, Inner Mongolia, China
Genet Mol Res. 2014 Mar 6;13(1):1456-64. doi: 10.4238/2014.March.6.4.
Developing appropriate methods for constructing phylogenetic networks from tree sets is an important problem, and much research is currently being undertaken in this area. BIMLR is an algorithm that constructs phylogenetic networks from tree sets. The algorithm can construct a much simpler network than other available methods. Here, we introduce an improved version of the BIMLR algorithm, QuickCass. QuickCass changes the selection strategy of the labels of leaves below the reticulate nodes, i.e., the nodes with an indegree of at least 2 in BIMLR. We show that QuickCass can construct simpler phylogenetic networks than BIMLR. Furthermore, we show that QuickCass is a polynomial-time algorithm when the output network that is constructed by QuickCass is binary.
开发从树集构建系统发育网络的合适方法是一个重要问题，目前该领域正在进行大量研究。BIMLR是一种从树集构建系统发育网络的算法。该算法能够构建比其他现有方法简单得多的网络。在此，我们介绍BIMLR算法的改进版本QuickCass。QuickCass改变了网状节点（即BIMLR中入度至少为2的节点）下方叶标签的选择策略。我们表明QuickCass能够构建比BIMLR更简单的系统发育网络。此外，我们表明当QuickCass构建的输出网络是二叉树时，QuickCass是一种多项式时间算法。
