论文标题
物种网络的斑点树：合并下的可识别性
The Tree of Blobs of a Species Network: Identifiability under the Coalescent
论文作者
论文摘要
目前，从网络多物种结合模型下，从基因组数据中推断物种网络的推论目前受到大量计算需求的严重限制。目前尚不清楚如何进行一致的推断，该网络有多复杂。作为推断一般物种网络的一步，这项工作考虑了其斑点树，其中非切割边缘与节点收缩，因此仅显示了类群之间的树状关系。可以从基因四重奏拓扑的分布确定无根树的大多数特征的可识别性定理。这取决于模型下基因四重奏一致性因素以及新的组合推断规则的分析。该理论结果的论点表明，在随后的工作中充分发展了对斑点推理的实用算法。
Inference of species networks from genomic data under the Network Multispecies Coalescent Model is currently severely limited by heavy computational demands. It also remains unclear how complicated networks can be for consistent inference to be possible. As a step toward inferring a general species network, this work considers its tree of blobs, in which non-cut edges are contracted to nodes, so only tree-like relationships between the taxa are shown. An identifiability theorem, that most features of the unrooted tree of blobs can be determined from the distribution of gene quartet topologies, is established. This depends upon an analysis of gene quartet concordance factors under the model, together with a new combinatorial inference rule. The arguments for this theoretical result suggest a practical algorithm for tree of blobs inference, to be fully developed in a subsequent work.
