Phylogenetic Inference Based on Matrix Representation of Trees
Phylogenetic Inference Based on Matrix Representation of Trees
复制标题
DOI：
10.1016/1055-7903(92)90035-f
复制
发表时间：
1992-03-01
影响因子：
4.1
通讯作者：
Ragan, Mark A.
中科院分区：
文献类型：
--
作者：
Ragan, Mark A.
有根的系统发育树可以表示为矩阵，其中行对应于终端，列对应于内部节点（n树的元素）。这种矩阵的简约分析将完全恢复原始树的拓扑结构。表示矩阵的最大大小仅取决于树中终端的数量；对于由分子序列导出的树，表示的矩阵可能比原始数据矩阵小几个数量级。多个树的表示（可能有也可能没有相同的M-mini）可以很容易地组合成一个矩阵；可以添加离散字符状态数据列，如果需要，还可以进行不同的加权。对所得到的复合矩阵的简约分析产生了一个混合超树，它通常比传统的共识树提供更高的分辨率。用细胞器中的多个tRNA基因和真核生物中的多个蛋白质编码基因的例子说明了这种方法的使用。
Rooted phylogenetic trees can be represented as matrices in which the rows correspond to termini, and columns correspond to internal nodes ( elements of the n-tree). Parsimony analysis of such a matrix will fully recover the topology of the original tree. The maximum size of the represented matrix depends only on the number of termini in the tree; for a tree derived from molecular sequences, the represented matrix may be orders of magnitude smaller than the original data matrix. Representations of multiple trees ( which may or may not have identical M-mini) can readily be combined into a single matrix; columns of discrete-character-state data can be added and, if desired, weighted differentially. Parsimony analysis of the resulting composite matrix yields a hybrid supertree which typically provides greater resolution than conventional consensus trees. Use of this method is illustrated with examples involving multiple tRNA genes in organelles and multiple protein-coding genes in eukaryotes.