受限树:简化具有瓶颈的网络
Restricted trees: simplifying networks with bottlenecks
摘要:
假设N是一个系统发育网络,表明个体和类群之间的复杂关系。人们通常感兴趣的是一个简单得多的网络,例如物种树T,它总结了最基本的关系。由于最近发现杂交和横向基因转移的重要性,物种树的意义变得更加复杂。因此,需要描述统一的定义明确的过程,该过程在给定网络N的情况下产生树。一个有用的工具是从N到N'的连通满射有向图(CSD),其中N'通常是比N简单得多的网络。N中顶点的集合W是“受限的”,如果最多有一个顶点有一条弧从该顶点到W,从而在N中产生瓶颈。一个从N到N'的CSD映射f是“限制的”,如果N'中每个顶点的逆像在N中是限制的。本文描述了一个统一的过程,给定一个网络N,产生一个定义良好的树称为“限制树”的N。存在从N到受限树的受限CSD映射。树中的许多关系可以证明也出现在N中。
英文摘要:
Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The meaning of a species tree is made more complicated by the recent discovery of the importance of hybridizations and lateral gene transfers. Hence it is desirable to describe uniform well-defined procedures that yield a tree given a network N. A useful tool toward this end is a connected surjective digraph (CSD) map f from N to N' where N' is generally a much simpler network than N. A set W of vertices in N is "restricted" if there is at most one vertex from which there is an arc into W, thus yielding a bottleneck in N. A CSD map f from N to N' is "restricted" if the inverse image of each vertex in N' is restricted in N. This paper describes a uniform procedure that, given a network N, yields a well-defined tree called the "restricted tree" of N. There is a restricted CSD map from N to the restricted tree. Many relationships in the tree can be proved to appear also in N.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。