Felsenstein J
Department of Genetics, University of Washington, Box 357360, Seattle, Washington 98195-7360, USA.
Syst Biol. 1997 Mar;46(1):101-11. doi: 10.1093/sysbio/46.1.101.
A computational method is presented for minimizing the weighted sum of squares of the differences between observed and expected pairwise distances between species, where the expectations are generated by an additive tree model. The criteria of Fitch and Margoliash (1967, Science 155:279-284) and Cavalli-Sforza and Edwards (1967, Evolution 21:550-570) are both weighted least squares, with different weights. The method presented iterates lengths of adjacent branches in the tree three at a time. The weighted sum of squares never increases during the process of iteration, and the iterates approach a stationary point on the surface of the sum of squares. This iterative approach makes it particularly easy to maintain the constraint that branch lengths never become negative, although negative branch lengths can also be allowed. The method is implemented in a computer program, FITCH, which has been distributed since 1982 as part of the PHYLIP package of programs for inferring phylogenies, and is also implemented in PAUP*. The present method is compared, using some simulated data sets, with an implementation of the method of De Soete (1983, Psychometrika 48:621-626); it is slower than De Soete's method but more effective at finding the least squares tree. The relationship of this method to the neighbor-joining method is also discussed.
本文提出了一种计算方法,用于最小化物种间观察到的和期望的成对距离之差的加权平方和,其中期望由加性树模型生成。Fitch和Margoliash(1967年,《科学》155:279 - 284)以及Cavalli - Sforza和Edwards(1967年,《进化》21:550 - 570)的标准都是加权最小二乘法,只是权重不同。本文提出的方法每次迭代树中相邻分支的长度三个。在迭代过程中,加权平方和从不增加,并且迭代趋近于平方和表面上的一个驻点。这种迭代方法使得特别容易维持分支长度永远不会变为负数的约束,不过也可以允许负的分支长度。该方法在一个计算机程序FITCH中实现,自1982年以来,FITCH作为用于推断系统发育的PHYLIP程序包的一部分进行了分发,并且也在PAUP*中实现。使用一些模拟数据集将本方法与De Soete(1983年,《心理测量学》48:621 - 626)方法的一个实现进行了比较;它比De Soete的方法慢,但在找到最小二乘树方面更有效。还讨论了该方法与邻接法的关系。