Lake J A
Molecular Biology Institute, University of California, Los Angeles 90095, USA.
Proc Natl Acad Sci U S A. 1995 Oct 10;92(21):9662-6. doi: 10.1073/pnas.92.21.9662.
The reconstruction of multitaxon trees from molecular sequences is confounded by the variety of algorithms and criteria used to evaluate trees, making it difficult to compare the results of different analyses. A global method of multitaxon phylogenetic reconstruction described here, Bootstrappers Gambit, can be used with any four-taxon algorithm, including distance, maximum likelihood, and parsimony methods. It incorporates a Bayesian-Jeffreys'-bootstrap analysis to provide a uniform probability-based criterion for comparing the results from diverse algorithms. To examine the usefulness of the method, the origin of the eukaryotes has been investigated by the analysis of ribosomal small subunit RNA sequences. Three common algorithms (paralinear distances, Jukes-Cantor distances, and Kimura distances) support the eocyte topology, whereas one (maximum parsimony) supports the archaebacterial topology, suggesting that the eocyte prokaryotes are the closest prokaryotic relatives of the eukaryotes.
从分子序列重建多分类群树会因用于评估树的算法和标准的多样性而变得复杂，这使得比较不同分析的结果变得困难。这里描述的一种多分类群系统发育重建的全局方法——自展策略，可以与任何四分类群算法一起使用，包括距离法、最大似然法和简约法。它结合了贝叶斯-杰弗里斯自展分析，以提供一个基于概率的统一标准，用于比较不同算法的结果。为了检验该方法的实用性，通过分析核糖体小亚基RNA序列对真核生物的起源进行了研究。三种常用算法（准线性距离、朱克斯-坎托距离和木村距离）支持曙细胞拓扑结构，而一种算法（最大简约法）支持古细菌拓扑结构，这表明曙细胞原核生物是真核生物最接近的原核生物亲属。
