Complexity of the simplest phylogenetic estimation problem
Complexity of the simplest phylogenetic estimation problem
复制标题
最简单的系统发育估计问题的复杂性
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Ziheng Yang
中科院分区：
文献类型：
--
作者：
Ziheng Yang
给出了一个简单系统发育估计问题的最大似然解。问题是在分子钟下使用具有对称取代率的二元特征估计三种的有根树。ML估计的分支长度和对数似然评分是分析获得的三个根二叉树。树拓扑的估计相当于将样本空间（可能的数据结果空间）划分为子空间，在每个子空间中，三棵二叉树中的一棵是ML树。基于距离的最小二乘法和类似简化的方法对树的拓扑结构产生本质上相同的估计，尽管在这个简单的模型下，方法之间存在差异。这似乎是最简单的情况，但在系统发育估计中涉及许多概念和统计复杂性。这一实际系统发育估计问题的解决将有助于研究显著性评价问题。
The maximum–likelihood (ML) solution to a simple phylogenetic estimation problem is obtained analytically. The problem is estimation of the rooted tree for three species using binary characters with a symmetrical rate of substitution under the molecular clock. ML estimates of branch lengths and log–likelihood scores are obtained analytically for each of the three rooted binary trees. Estimation of the tree topology is equivalent to partitioning the sample space (space of possible data outcomes) into subspaces, within each of which one of the three binary trees is the ML tree. Distance–based least squares and parsimony–like methods produce essentially the same estimate of the tree topology, although differences exist among methods even under this simple model. This seems to be the simplest case, but has many of the conceptual and statistical complexities involved in phylogeny estimation. The solution to this real phylogeny estimation problem will be useful for studying the problem of significance evaluation.
影响因子：
10.7
作者：
Andrey Zharkikh;Wen-Hsiung Li
通讯作者：
Andrey Zharkikh;Wen-Hsiung Li
影响因子：
10.7
作者：
Yang, ZH;Rannala, B
通讯作者：
Rannala, B
DOI：
10.1073/pnas.93.14.7085
发表时间：
1996-07-09
影响因子：
11.1
作者：
Efron, B;Halloran, E;Holmes, S
通讯作者：
Holmes, S