PROPERTY AND EFFICIENCY OF THE MAXIMUM-LIKELIHOOD METHOD FOR MOLECULAR PHYLOGENY
PROPERTY AND EFFICIENCY OF THE MAXIMUM-LIKELIHOOD METHOD FOR MOLECULAR PHYLOGENY
复制标题
DOI：
10.1007/bf02100082
复制
发表时间：
1988-01-01
影响因子：
3.9
通讯作者：
SAITOU, N
中科院分区：
文献类型：
--
作者：
SAITOU, N
研究了从DNA序列数据构建系统发生树（包括有根树和无根树）的最大似然（ML）方法。虽然在比较每个拓扑的ML值条件时存在一些理论问题，但可以进行启发式论证来证明该方法的合理性。在此基础上，提出了一种新的ML树估计算法。结果表明，在恒定的进化速率的假设下，ML方法和UPGMA总是给出相同的根树的情况下，三个操作分类单元（OTU）。这似乎也大致适用于具有四个OTU的情况。当我们考虑无根树的假设的变化率的核苷酸取代，ML方法在获得正确的树的效率是类似的最大简约法和距离的方法。ML方法应用于Brown et al.的数据，得到的树拓扑结构与最大简约法得到的树拓扑结构相同，但与距离法得到的树拓扑结构不同。
The maximum likelihood (ML) method for constructing phylogenetic trees (both rooted and unrooted trees) from DNA sequence data was studied. Although there is some theoretical problem in the comparison of ML values conditional for each topology, it is possible to make a heuristic argument to justify the method. Based on this argument, a new algorithm for estimating the ML tree is presented. It is shown that under the assumption of a constant rate of evolution, the ML method and UPGMA always give the same rooted tree for the case of three operational taxonomic units (OTUs). This also seems to hold approximately for the case with four OTUs. When we consider unrooted trees with the assumption of a varying rate of nucleotide substitution, the efficiency of the ML method in obtaining the correct tree is similar to those of the maximum parsimony method and distance methods. The ML method was applied to Brown et al.''s data, and the tree topology obtained was the same as that found by the maximum parsimony method, but is was different from those obtained by distance methods.