Goloboff Pablo A, Catalano Santiago A, Marcos Mirande J, Szumik Claudia A, Salvador Arias J, Källersjö Mari, Farris James S
INSUE (Instituto Superior de Entomología), CONICET (Consejo Nacional de Investigaciones Científicas y Técnicas), Instituto Miguel Lillo, Miguel Lillo 205, 4000 S.M.Tucumán, Argentina.
CONICET (Consejo Nacional de Investigaciones Científicas y Técnicas), Fundación Miguel Lillo, Miguel Lillo 251, 4000 S.M.Tucumán, Argentina.
Cladistics. 2009 Jun;25(3):211-230. doi: 10.1111/j.1096-0031.2009.00255.x. Epub 2009 Apr 27.
Obtaining a well supported schema of phylogenetic relationships among the major groups of living organisms requires considering as much taxonomic diversity as possible, but the computational cost of calculating large phylogenies has so far been a major obstacle. We show here that the parsimony algorithms implemented in TNT can successfully process the largest phylogenetic data set ever analysed, consisting of molecular sequences and morphology for 73 060 eukaryotic taxa. The trees resulting from molecules alone display a high degree of congruence with the major taxonomic groups, with a small proportion of misplaced species; the combined data set retrieves these groups with even higher congruence. This shows that tree-calculation algorithms effectively retrieve phylogenetic history for very large data sets, and at the same time provides strong corroboration for the major eukaryotic lineages long recognized by taxonomists.
要获得一个得到充分支持的关于主要生物类群之间系统发育关系的模式,需要考虑尽可能多的分类多样性,但到目前为止,计算大型系统发育树的计算成本一直是一个主要障碍。我们在此表明,TNT中实现的简约算法能够成功处理有史以来分析过的最大的系统发育数据集,该数据集由73060个真核生物分类单元的分子序列和形态学数据组成。仅由分子数据得出的树与主要分类类群显示出高度的一致性,只有一小部分物种位置有误;合并后的数据集检索这些类群时一致性更高。这表明树计算算法能够有效地检索非常大型数据集的系统发育历史,同时也为分类学家长期认可的主要真核生物谱系提供了有力的佐证。