物种网络的斑点树：合并下的可识别性
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
