Sourdis J, Krimbas C
Department of Genetics, Agricultural College of Athens, Greece.
Mol Biol Evol. 1987 Mar;4(2):159-66. doi: 10.1093/oxfordjournals.molbev.a040432.
The relative merits of four different tree-making methods in obtaining the correct topology were studied by using computer simulation. The methods studied were the unweighted pair-group method with arithmetic mean (UPGMA), Fitch and Margoliash's (FM) method, thd distance Wagner (DW) method, and Tateno et al.'s modified Farris (MF) method. An ancestral DNA sequence was assumed to evolve into eight sequences following a given model tree. Both constant and varying rates of nucleotide substitution were considered. Once the DNA sequences for the eight extant species were obtained, phylogenetic trees were constructed by using corrected (d) and uncorrected (p) nucleotide substitutions per site. The topologies of the trees obtained were then compared with that of the model tree. The results obtained can be summarized as follows: (1) The probability of obtaining the correct rooted or unrooted tree is low unless a large number of nucleotide differences exists between different sequences. (2) When the number of nucleotide substitutions per sequence is small or moderately large, the FM, DW, and MF methods show a better performance than UPGMA in recovering the correct topology. The former group of methods is particularly good for obtaining the correct unrooted tree. (3) When the number of substitutions per sequence is large, UPGMA is at least as good as the other methods, particularly for obtaining the correct rooted tree. (4) When the rate of nucleotide substitution varies with evolutionary lineage, the FM, DW, and MF methods show a better performance in obtaining the correct topology than UPGMA, except when a rooted tree is to be produced from data with a large number of nucleotide substitutions per sequence.(ABSTRACT TRUNCATED AT 250 WORDS)
通过计算机模拟研究了四种不同建树方法在获得正确拓扑结构方面的相对优点。所研究的方法有算术平均的非加权配对组方法(UPGMA)、菲奇和马戈利亚什(FM)方法、距离瓦格纳(DW)方法以及立野等人改进的法里斯(MF)方法。假定一个祖先DNA序列按照给定的模型树演变成八个序列。同时考虑了核苷酸替换的恒定速率和变化速率。一旦获得了八个现存物种的DNA序列,就使用每个位点校正后的(d)和未校正的(p)核苷酸替换来构建系统发育树。然后将得到的树的拓扑结构与模型树的拓扑结构进行比较。得到的结果可总结如下:(1)除非不同序列之间存在大量核苷酸差异,否则获得正确的有根树或无根树的概率很低。(2)当每个序列的核苷酸替换数较少或适中时,FM、DW和MF方法在恢复正确拓扑结构方面比UPGMA表现更好。前一组方法在获得正确的无根树方面特别出色。(3)当每个序列的替换数很大时,UPGMA至少与其他方法一样好,特别是在获得正确的有根树方面。(4)当核苷酸替换速率随进化谱系变化时,FM、DW和MF方法在获得正确拓扑结构方面比UPGMA表现更好,除非要从每个序列有大量核苷酸替换的数据中生成有根树。(摘要截断于250字)