Abstract A phylogenetic network is a model for reticulate evolution. A hybridization network is one type of phylogenetic network for a set of discordant gene trees and “displays” each gene tree. A central computational problem on hybridization networks is: given a set of gene trees, reconstruct the minimum (i.e., most parsimonious) hybridization network that displays each given gene tree. This problem is known to be NP-hard, and existing approaches for this problem are either heuristics or making simplifying assumptions (e.g., work with only two input trees or assume some topological properties). In this article, we develop an exact algorithm (called PIRNC) for inferring the minimum hybridization networks from multiple gene trees. The PIRNC algorithm does not rely on structural assumptions (e.g., the so-called galled networks). To the best of our knowledge, PIRNC is the first exact algorithm implemented for this formulation. When the number of reticulation events is relatively small (say, four or fewer), ..." /> rel="meta" type="application/atom+xml" href="http://dx.doi.org/10.1089%2Fcmb.2013.0072" /> rel="meta" type="application/rdf+json" href="http://dx.doi.org/10.1089%2Fcmb.2013.0072" /> rel="meta" type="application/unixref+xml" href="http://dx.doi.org/10.1089%2Fcmb.2013.0072" /> 展开▼
机译：摘要系统发育网络是网状进化的模型。杂交网络是用于一组不一致的基因树并“展示”每个基因树的一种系统发育网络。杂交网络的主要计算问题是：给定一组基因树，重建显示每个给定基因树的最小（即最简约）杂交网络。已知此问题是NP难题，解决该问题的现有方法要么是启发式方法，要么是简化假设（例如，仅使用两个输入树或采用某些拓扑属性）。在本文中，我们开发了一种精确的算法（称为PIRNC），用于从多个基因树中推断最小杂交网络。 PIRNC算法不依赖于结构假设（例如，所谓的网络）。据我们所知，PIRNC是为该公式实现的第一个精确算法。当网状事件的数量相对较少（例如，四个或更少）时，...“ /> < meta name =“ dc.Format” content =“ text / HTML” /> rel =” meta“ type =” application / atom + xml“ href =” http://dx.do i.org/10.1089%2Fcmb.2013.0072“ /> rel =” meta“ type =” application / rdf + json“ href =” http://dx.doi.org/10.1089%2Fcmb.2013.0072“ /> <链接rel =“ meta” type =“ application / unixref + xml” href =“ http://dx.doi.org/10.1089%2Fcmb.2013.0072” />
展开▼
