Pauplin Y
Laboratoire de Biométrie, Génétique et Biologie des Populations, UMR 5558, Université Claude Bernard, 69622 Villeurbanne Cedex,
J Mol Evol. 2000 Jul;51(1):41-7. doi: 10.1007/s002390010065.
Comparative studies of tree-building methods have shown minimum evolution to be in general an accurate criterion for selecting a true tree. To improve the use of this criterion, this paper proposes a method for rapidly and directly calculating a length of a dichotomous tree without having to resort to branch length calculations. This direct calculation (DC) method applies to the complete final topology, giving equal importance to each branch after a dichotomy. According to this method, the tree length S(DC) is S(DC) = sigma(i) sigma(j)(D(ij)/2(B(ij))) = (sigma(i<j) sigma D(ij)2(Bmax-B(ij)))/2(Bmax)(-1) where D(ij) is the observed distance between taxa i and j, B(ij) is the number of branches connecting i and j, Bmax is the greatest B(ij) in the tree, and the powers of two are due to the dichotomy of the tree. This tree length expression may be used as a rapid method for selecting the shortest tree from a set of hypothetical or subobtimal trees.
对建树方法的比较研究表明,一般来说,最小进化是选择真实树的准确标准。为了改进该标准的使用,本文提出了一种无需进行分支长度计算即可快速直接计算二叉树长度的方法。这种直接计算(DC)方法适用于完整的最终拓扑结构,在二叉划分后对每个分支赋予同等重要性。根据该方法,树长S(DC)为S(DC)=sigma(i) sigma(j)(D(ij)/2(B(ij)))=(sigma(i<j) sigma D(ij)2(Bmax - B(ij)))/2(Bmax)(-1),其中D(ij)是分类单元i和j之间的观察距离,B(ij)是连接i和j的分支数量,Bmax是树中最大的B(ij),2的幂次是由于树的二叉划分。该树长表达式可作为从一组假设或次优树中选择最短树的快速方法。