The optimization principle in phylogenetic analysis tends to give incorrect topologies when the number of nucleotides or amino acids used is small

Evolutionary relationships among the true vipers (Reptilia: Viperidae) inferred from mitochondrial DNA sequences

Nucleotide sequences of mitochondrial cytochrome b and 16S rRNA genes, totaling 946 bp, were used to reconstruct a molecular phylogeny of 42 species of the subfamily Viperinae representing 12 of the 13 recognized genera. Maximum-parsimony and maximum-likelihood were used as methods for phylogeny reconstruction with and without a posteriori weighting. When representatives of the Causinae were taken as outgroup, five major monophyletic groups were consistently identified: Bitis, Cerastes, Echis, the Atherini (Atheris s.l.), and the Eurasian viperines. Proatheris was affiliated with Atheris, and Adenorhinos clustered within Atheris. The African Bitis consisted of at least three monophyletic groups: (i) the B. gabonica group, (ii) the B. caudalis group, and (iii) the B. cornuta group. B. worthingtoni and B. arietans are not included in any of these lineages. Eurasian viperines could be unambiguously devided into four monophyletic groups: (i) Pseudocerastes and Eristicophis, (ii) European vipers (Vipera s.str.), (iii) Middle East Macrovipera plus Montivipera (Vipera xanthina group), and (iv) North African Macrovipera plus Vipera palaestinae and Daboia russelii. These evolutionary lineages are consistent with historical biogeographical patterns. According to our analyses, the viperines originated in the Oligocene in Africa and successively underwent a first radiation leading to the five basal groups. The radiation might have been driven by the possession of an effective venom apparatus and a foraging startegy (sit-wait-strike) superior in most African biomes and might have been adaptive. The next diversifications led to the Proatheris-Atheris furcation, the basal Bitis splitting, and the emergence of the basal lineages within the Eurasian stock. Thereafter, lineages within Echis, Atheris, and Cerastes evolved. The emergence of three groups within Vipera s.l. might have been forced by the existence of three land masses during the early Miocene in the area of the Paratethys and the Mediterranean Seas. Taxonomic consequences of these findings are discussed.

Independent and combined analyses of sequences from all three genomic compartments converge on the root of flowering plant phylogeny

Plant phylogenetic estimates are most likely to be reliable when congruent evidence is obtained independently from the mitochondrial, plastid, and nuclear genomes with all methods of analysis. Here, results are presented from separate and combined genomic analyses of new and previously published data, including six and nine genes (8, 911 bp and 12,010 bp, respectively) for different subsets of taxa that suggest Amborella + Nymphaeales (water lilies) are the first-branching angiosperm lineage. Before and after tree-independent noise reduction, most individual genomic compartments and methods of analysis estimated the Amborella + Nymphaeales basal topology with high support. Previous phylogenetic estimates placing Amborella alone as the first extant angiosperm branch may have been misled because of a series of specific problems with paralogy, suboptimal outgroups, long-branch taxa, and method dependence. Ancestral character state reconstructions differ between the two topologies and affect inferences about the features of early angiosperms.

NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods

In the reconstruction of a large phylogenetic tree, the most difficult part is usually the problem of how to explore the topology space to find the optimal topology. We have developed a "divide-and-conquer" heuristic algorithm in which an initial neighbor-joining (NJ) tree is divided into subtrees at internal branches having bootstrap values higher than a threshold. The topology search is then conducted by using the maximum-likelihood method to reevaluate all branches with a bootstrap value lower than the threshold while keeping the other branches intact. Extensive simulation showed that our simple method, the neighbor-joining maximum-likelihood (NJML) method, is highly efficient in improving NJ trees. Furthermore, the performance of the NJML method is nearly equal to or better than existing time-consuming heuristic maximum-likelihood methods. Our method is suitable for reconstructing relatively large molecular phylogenetic trees (number of taxa >/= 16).

A rapid heuristic algorithm for finding minimum evolution trees

The minimum sum of branch lengths (S), or the minimum evolution (ME) principle, has been shown to be a good optimization criterion in phylogenetic inference. Unfortunately, the number of topologies to be analyzed is computationally prohibitive when a large number of taxa are involved. Therefore, simplified, heuristic methods, such as the neighbor-joining (NJ) method, are usually employed instead. The NJ method analyzes only a small number of trees (compared with the size of the entire search space); so, the tree obtained may not be the ME tree (for which the S value is minimum over the entire search space). Different compromises between very restrictive and exhaustive search spaces have been proposed recently. In particular, the "stepwise algorithm" (SA) utilizes what is known in computer science as the "beam search," whereas the NJ method employs a "greedy search." SA is virtually guaranteed to find the ME trees while being much faster than exhaustive search algorithms. In this study we propose an even faster method for finding the ME tree. The new algorithm adjusts its search exhaustiveness (from greedy to complete) according to the statistical reliability of the tree node being reconstructed. It is also virtually guaranteed to find the ME tree. The performances and computational efficiencies of ME, SA, NJ, and our new method were compared in extensive simulation studies. The new algorithm was found to perform practically as well as the SA (and, therefore, ME) methods and slightly better than the NJ method. For searching for the globally optimal ME tree, the new algorithm is significantly faster than existing ones, thus making it relatively practical for obtaining all trees with an S value equal to or smaller than that of the NJ tree, even when a large number of taxa is involved.

Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used

In phylogenetic inference by maximum-parsimony (MP), minimum-evolution (ME), and maximum-likelihood (ML) methods, it is customary to conduct extensive heuristic searches of MP, ME, and ML trees, examining a large number of different topologies. However, these extensive searches tend to give incorrect tree topologies. Here we show by extensive computer simulation that when the number of nucleotide sequences (m) is large and the number of nucleotides used (n) is relatively small, the simple MP or ML tree search algorithms such as the stepwise addition (SA) plus nearest neighbor interchange (NNI) search and the SA plus subtree pruning regrafting (SPR) search are as efficient as the extensive search algorithms such as the SA plus tree bisection-reconnection (TBR) search in inferring the true tree. In the case of ME methods, the simple neighbor-joining (NJ) algorithm is as efficient as or more efficient than the extensive NJ+TBR search. We show that when ME methods are used, the simple p distance generally gives better results in phylogenetic inference than more complicated distance measures such as the Hasegawa-Kishino-Yano (HKY) distance, even when nucleotide substitution follows the HKY model. When ML methods are used, the simple Jukes-Cantor (JC) model of phylogenetic inference generally shows a better performance than the HKY model even if the likelihood value for the HKY model is much higher than that for the JC model. This indicates that at least in the present case, selecting of a substitution model by using the likelihood ratio test or the AIC index is not appropriate. When n is small relative to m and the extent of sequence divergence is high, the NJ method with p distance often shows a better performance than ML methods with the JC model. However, when the level of sequence divergence is low, this is not the case.

On the optimization principle in phylogenetic analysis and the minimum-evolution criterion

This paper discusses the optimization principle in phylogenetic analysis, in the case of distance data. We argue that the use of this principle cannot be called into question, except for computing time reasons. We show that the minimum-evolution criterion is not perfectly suited for distance data estimated from sequences, and we present another approach, implemented in the BIONJ algorithm, which allows the data features to be taken into account, while being less demanding in computing time. Simulations show that BIONJ significantly outperforms NJ.

Molecular evolution of a developmental pathway: phylogenetic analyses of transforming growth factor-beta family ligands, receptors and Smad signal transducers

Intercellular signaling by transforming growth factor-beta (TGF-beta) proteins coordinates developmental decisions in many organisms. A receptor complex and Smad signal transducers are required for proper responses to TGF-beta signals. We have taken a phylogenetic approach to understanding the developmental evolutionary history of TGF-beta signaling pathways. We were interested in detecting evolutionary influences among the physically interacting multigene families encoding TGF-beta ligands, receptors, and Smads. Our analyses included new ligands and Smads identified from genomic sequence as well as the newest published family members. From an evolutionary perspective we find that (1) TGF-beta pathways do not predate the divergence of animals, plants, and fungi; (2) ligands of the TGF-beta/activin subfamily likely originated after the divergence of nematodes and arthropods; (3) type I receptors from Caenorhabditis elegans are distinct from other receptors and may reflect an ancestral transitional state between type I and type II receptors; and (4) the Smad family appears to be evolving faster than, and independently of, ligands and receptors. From a developmental perspective we find (1) numerous phylogenetic associations not previously detected in each multigene family; (2) that there are unidentified pathway components that discriminate between type I and type II receptors; (3) that there are more Smads to be discovered in Drosophila and mammals; and (4) that the number of C-terminal serines is the best predictor of a Smad's role in TGF-beta signal transduction. We discuss these findings with respect to the coevolution of physically interacting genes.