arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.5594math.CO
收藏

Lassoing和Corraling有根系统树

Lassoing and corraling rooted phylogenetic trees

Katharina T. Huber, Andrei-Alin Popescu

摘要:

在一组个体上构建树状图是全基因组关联研究的关键组成部分。然而,即使使用现代测序技术,构建这种结构所需的个体上的距离可能并不总是可靠的,这使得将它们从分析中排除是诱人的。这反过来又会导致用于树状图构建的输入集仅由部分距离信息组成,这引起了以下基本问题。对于它的叶集的哪个子集,我们可以从它在该子集上诱导的距离唯一地重建树状图。通过将树状图形式化为给定有限集X上的边加权的有根系统发生树,其中|X| >2,其边加权是等距的,并且X上的部分距离集合是X的2-子集的集合L,我们研究了当这样的树被套索时的问题,即,由L中的元素唯一确定。为此,我们考虑四种不同的形式化的想法,“唯一确定”产生四种不同类型的套索。我们目前的刻画,所有这些方面的儿童边图的内部顶点,这样的树。我们的刻画意味着,特别是在案件的树问题是二进制然后所有四种类型的套索必须一致。

英文摘要:

The construction of a dendogram on a set of individuals is a key component of a genomewide association study. However even with modern sequencing technologies the distances on the individuals required for the construction of such a structure may not always be reliable making it tempting to exclude them from an analysis. This, in turn, results in an input set for dendogram construction that consists of only partial distance information which raises the following fundamental question. For what subset of its leaf set can we reconstruct uniquely the dendogram from the distances that it induces on that subset. By formalizing a dendogram in terms of an edge-weighted, rooted phylogenetic tree on a pre-given finite set X with |X|>2 whose edge-weighting is equidistant and a set of partial distances on X in terms of a set L of 2-subsets of X, we investigate this problem in terms of when such a tree is lassoed, that is, uniquely determined by the elements in L. For this we consider four different formalizations of the idea of "uniquely determining" giving rise to four distinct types of lassos. We present characterizations for all of them in terms of the child-edge graphs of the interior vertices of such a tree. Our characterizations imply in particular that in case the tree in question is binary then all four types of lasso must coincide.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑