Quasi-median graphs from sets of partitions
Quasi-median graphs from sets of partitions
复制标题
DOI：
10.1016/s0166-218x(01)00353-5
复制
发表时间：
2002-10-15
影响因子：
1.1
通讯作者：
Moulton, V
中科院分区：
文献类型：
--
作者：
Bandelt, HJ;Huber, KT;Moulton, V
在分子进化研究中，人们通常面临着从有限字母表 Lambda 上的一组 X 长度为 n 的序列中推断出系统发育树的任务。对于调用简约性的研究，我们发现考虑汉明图 Lambda(n) 中 X 生成的准中值图很有帮助。尽管人们已经对拟中值图（及其代数对应图）有了很多了解，但对于 Lambda(n) 中从 X 个顶点开始的拟中值生成却知之甚少。我们根据 X 的坐标划分来描述由 X 生成的准中值图的顶点。特别是，我们澄清了生成的准中值图何时是与 X 相关的所谓关系图。这立即表征了生成块图或总汉明图的实例。 (C) 2002 年，Elsevier Science B.V. 出版
In studies of molecular evolution, one is typically confronted with the task of inferring a phylogenetic tree from a set X of sequences of length n over a finite alphabet Lambda. For studies that invoke parsimony, it has been found helpful to consider the quasi-median graph generated by X in the Hamming graph Lambda(n). Although a great deal is already known about quasi-median graphs (and their algebraic counterparts), little is known about the quasi-median generation in Lambda(n) starting from a set X of vertices. We describe the vertices of the quasi-median graph generated by X in terms of the coordinatewise partitions of X. In particular, we clarify when the generated quasi-median graph is the so-called relation graph associated with X. This immediately characterizes the instances where either a block graph or the total Hamming graph is generated. (C) 2002 Published by Elsevier Science B.V.