apTreeshape: statistical analysis of phylogenetic tree shape

apTreeshape is a R package dedicated to simulation and analysis of phylogenetic tree topologies using statistical imbalance measures. It is a companion library of the R package 'ape', which provides additional functions for reading, plotting, manipulating phylogenetic trees and for connecting to public phylogenetic tree databases. One strength of the package is to include appropriate corrections of classical shape statistics as well as new tests based on the statistical theory of likelihood ratios.     

RRTree: relative-rate tests between groups of sequences on a phylogenetic tree

SUMMARY: RRTree is a user-friendly program for comparing substitution rates between lineages of protein or DNA sequences, relative to an outgroup, through relative rate tests. Genetic diversity is taken into account through use of several sequences, and phylogenetic relations are integrated by topological weighting. AVAILABILITY: The ANSI C source code of RRTree, and compiled versions for Macintosh, MS-DOS/Windows, SUN Solaris, and CGI, are freely available at http://pbil.univ-lyon1.fr/software/rrtree.html CONTACT: marc.robinson@ens-lyon.fr     

On the repeat-annotated phylogenetic tree reconstruction problem.

A new problem in phylogenetic inference is presented, based on recent biological findings indicating a strong association between reversals (i.e., inversions) and repeats. These biological findings are formalized here in a new mathematical model, called repeat-annotated phylogenetic trees (RAPT). We show that, under RAPT, the evolutionary process--including both the tree-topology as well as internal node genome orders--is uniquely determined, a property that is of major significance both in theory and in practice. Furthermore, the repeats are employed to provide linear-time algorithms for reconstructing both the genomic orders and the phylogeny, which are NP-hard problems under the classical model of sorting by reversals (SBR).     

RadCon: phylogenetic tree comparison and consensus

SUMMARY: RadCon is a Macintosh program for manipulating and analysing phylogenetic trees. The program can determine the Cladistic Information Content of individual trees, the stability of leaves across a set of bootstrap trees, produce the strict basic Reduced Cladistic Consensus profile of a set of trees and convert a set of trees into its matrix representation for supertree construction. AVAILABILITY: The program is free and available at http://taxonomy.zoology.gla.ac.uk/ approximately jthorley/radcon/radcon.html.     

PoInTree： A Polar and Interactive Phylogenetic Tree

PoInTree （Polar and Interactive Tree） is an application that allows to build, visualize, and customize phylogenetic trees in a polar, interactive, and highly flexible view. It takes as input a FASTA file or multiple alignment formats. Phylogenetic tree calculation is based on a sequence distance method and utilizes the Neighbor Joining （N J） algorithm. It also allows displaying precalculated trees of the major protein families based on Pfam classification. In PoInTree, nodes can be dynamically opened and closed and distances between genes are graphically represented. Tree root can be centered on a selected leaf. Text search mechanism, color-coding and labeling display are integrated. The visualizer can be connected to an Oracle database containing information on sequences and other biological data, helping to guide their interpretation within a given protein family across multiple species. The application is written in Borland Delphi and based on VCL Teechart Pro 6 graphical component （Steema software）.     

On tree intensity estimation for forest inventories: Some statistical issues

The effect of the plot shape, number of subplots and their spatial arrangement on the sample variance for spatially explicit point populations is analysed for a simple intensity estimator. We derive the sample variance and covariance for sampling designs involving more than one subplot. Some numerical approximations are also presented. If a clustered point pattern has to be sampled, the best strategy to reduce the sample variance is to consider as many rectangular subplots as possible, for a prescribed total sample area, distributed over a grid. In contrast, if a regular point pattern is to be sampled, then a single circular subplot should be considered. If we assume that the point configuration is Poisson, then we can consider any subplot shape and spatial distribution ensuring no overlapping between the subplots. A case study in forestry is considered to assess the validity of our results.     

Circular codes revisited: a statistical approach

In 1996 Arquès and Michel [1996. A complementary circular code in the protein coding genes. J. Theor. Biol. 182, 45-58] discovered the existence of a common circular code in eukaryote and prokaryote genomes. Since then, circular code theory has provoked great interest and underwent a rapid development. In this paper we discuss some theoretical issues related to the synchronization properties of coding sequences and circular codes with particular emphasis on the problem of retrieval and maintenance of the reading frame. Motivated by the theoretical discussion, we adopt a rigorous statistical approach in order to try to answer different questions. First, we investigate the covering capability of the whole class of 216 self-complementary, C³ maximal codes with respect to a large set of coding sequences. The results indicate that, on average, the code proposed by Arquès and Michel has the best covering capability but, still, there exists a great variability among sequences. Second, we focus on such code and explore the role played by the proportion of the bases by means of a hierarchy of permutation tests. The results show the existence of a sort of optimization mechanism such that coding sequences are tailored as to maximize or minimize the coverage of circular codes on specific reading frames. Such optimization clearly relates the function of circular codes with reading frame synchronization.     

Inferring the root of a phylogenetic tree

Phylogenetic trees can be rooted by a number of criteria. Here, we introduce a Bayesian method for inferring the root of a phylogenetic tree by using one of several criteria: the outgroup, molecular clock, and nonreversible model of DNA substitution. We perform simulation analyses to examine the relative ability of these three criteria to correctly identify the root of the tree. The outgroup and molecular clock criteria were best able to identify the root of the tree, whereas the nonreversible model was able to identify the root only when the substitution process was highly nonreversible. We also examined the performance of the criteria for a tree of four species for which the topology and root position are well supported. Results of the analyses of these data are consistent with the simulation results.     

Nodes in phylogenetic trees: the relation between imbalance and number of descendent species

The imbalance of a node in a phylogenetic tree can be defined in terms of the relative numbers of species (or higher taxa) on the branches that originate at the node. Empirically, imbalance also turns out to depend on the absolute total number of species on the branches: in a sample of large trees, nodes with more descendent species tend to be more unbalanced. Subsidiary analyses suggest that this pattern is not a result of errors in tree estimation. Instead, the increase in imbalance with species is consistent with a cumulative effect of differences in diversification rates between branches. [Equal-rates Markov model; imbalance; phylogeny shape; proportional-to-distinguishable-arrangements model.].     

Toward resolving the eukaryotic tree: the phylogenetic positions of jakobids and cercozoans

Resolving the global phylogeny of eukaryotes has proven to be challenging. Among the eukaryotic groups of uncertain phylogenetic position are jakobids, a group of bacterivorous flagellates that possess the most bacteria-like mitochondrial genomes known. Jakobids share several ultrastructural features with malawimonads and an assemblage of anaerobic protists (e.g., diplomonads and oxymonads). These lineages together with Euglenozoa and Heterolobosea have collectively been designated "excavates". However, published molecular phylogenies based on the sequences of nuclear rRNAs and up to six nucleus-encoded proteins do not provide convincing support for the monophyly of excavates, nor do they uncover their relationship to other major eukaryotic groups. Here, we report the first large-scale eukaryotic phylogeny, inferred from 143 nucleus-encoded proteins comprising 31,604 amino acid positions, that includes jakobids, malawimonads and cercozoans. We obtain compelling support for the monophyly of jakobids, Euglenozoa plus Heterolobosea (JEH group), and for the association of cercozoans with stramenopiles plus alveolates. Furthermore, we observe a sister-group relationship between the JEH group and malawimonads after removing fast-evolving species from the dataset. We discuss the implications of these results for the concept of "excavates" and for the elucidation of eukaryotic phylogeny in general.     

Characterization of a branch of the phylogenetic tree

We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the smallest species death rate are likely to survive much longer than genera with large species birth and death rates. A complete characterization of the behavior of a branch of the phylogenetic tree corresponding to a genus and accurate mathematical representations of the various stages are obtained. We apply our results to address certain controversial issues that have arisen in paleontology such as the importance of punctuated equilibrium and whether unique Cambrian phyla have survived to the present.     

Shaping the phylogenetic tree of influenza by cross-immunity

Cross-immunity among related strains can account for the selection producing the slender phylogenetic tree of influenza A and B in humans. Using a model of seasonal influenza epidemics with drift (Andreasen, 2003. Dynamics of annual influenza A epidemics with immuno-selection. J. Math. Biol. 46, 504-536), and assuming that two mutants arrive in the host population sequentially, we determine the threshold condition for the establishment of the second mutant in the presence of partial cross-protection caused by the first mutant and their common ancestors. For fixed levels of cross-protection, the chance that the second mutant establishes increases with rho the basic reproduction ratio and some temporary immunity may be necessary to explain the slenderness of flu's phylogenetic tree. In the presence of moderate levels of temporary immunity, an asymmetric situation can arise in the season after the two mutants were introduced and established: if the offspring of the new mutant arrives before the offspring of the resident type, then the mutant-line may produce a massive epidemic suppressing the original lineage. However, if the original lineage arrives first then both strains may establish and the phylogenetic tree may bifurcate.     

CONSEL: for assessing the confidence of phylogenetic tree selection.

CONSEL is a program to assess the confidence of the tree selection by giving the p-values for the trees. The main thrust of the program is to calculate the p-value of the Approximately Unbiased (AU) test using the multi-scale bootstrap technique. This p-value is less biased than the other conventional p-values such as the Bootstrap Probability (BP), the Kishino-Hasegawa (KH) test, the Shimodaira-Hasegawa (SH) test, and the Weighted Shimodaira-Hasegawa (WSH) test. CONSEL calculates all these p-values from the output of the phylogeny program packages such as Molphy, PAML, and PAUP*. Furthermore, CONSEL is applicable to a wide class of problems where the BPs are available. AVAILABILITY: The programs are written in C language. The source code for Unix and the executable binary for DOS are found at http://www.ism.ac.jp/~shimo/ CONTACT: shimo@ism.ac.jp     

Rooting the tree of life: the phylogenetic jury is still out

This article aims to shed light on difficulties in rooting the tree of life (ToL) and to explore the (sociological) reasons underlying the limited interest in accurately addressing this fundamental issue. First, we briefly review the difficulties plaguing phylogenetic inference and the ways to improve the modelling of the substitution process, which is highly heterogeneous, both across sites and over time. We further observe that enriched taxon samplings, better gene samplings and clever data removal strategies have led to numerous revisions of the ToL, and that these improved shallow phylogenies nearly always relocate simple organisms higher in the ToL provided that long-branch attraction artefacts are kept at bay. Then, we note that, despite the flood of genomic data available since 2000, there has been a surprisingly low interest in inferring the root of the ToL. Furthermore, the rare studies dealing with this question were almost always based on methods dating from the 1990s that have been shown to be inaccurate for much more shallow issues! This leads us to argue that the current consensus about a bacterial root for the ToL can be traced back to the prejudice of Aristotle''s Great Chain of Beings, in which simple organisms are ancestors of more complex life forms. Finally, we demonstrate that even the best models cannot yet handle the complexity of the evolutionary process encountered both at shallow depth, when the outgroup is too distant, and at the level of the inter-domain relationships. Altogether, we conclude that the commonly accepted bacterial root is still unproven and that the root of the ToL should be revisited using phylogenomic supermatrices to ensure that new evidence for eukaryogenesis, such as the recently described Lokiarcheota, is interpreted in a sound phylogenetic framework.     

Interior-branch and bootstrap tests of phylogenetic trees

We have compared statistical properties of the interior-branch and bootstrap tests of phylogenetic trees when the neighbor-joining tree- building method is used. For each interior branch of a predetermined topology, the interior-branch and bootstrap tests provide the confidence values, PC and PB, respectively, that indicate the extent of statistical support of the sequence cluster generated by the branch. In phylogenetic analysis these two values are often interpreted in the same way, and if PC and PB are high (say, > or = 0.95), the sequence cluster is regarded as reliable. We have shown that PC is in fact the complement of the P-value used in the standard statistical test, but PB is not. Actually, the bootstrap test usually underestimates the extent of statistical support of species clusters. The relationship between the confidence values obtained by the two tests varies with both the topology and expected branch lengths of the true (model) tree. The most conspicuous difference between PC and PB is observed when the true tree is starlike, and there is a tendency for the difference to increase as the number of sequences in the tree increases. The reason for this is that the bootstrap test tends to become progressively more conservative as the number of sequences in the tree increases. Unlike the bootstrap, the interior-branch test has the same statistical properties irrespective of the number of sequences used when a predetermined tree is considered. Therefore, the interior-branch test appears to be preferable to the bootstrap test as long as unbiased estimators of evolutionary distances are used. However, when the interior-branch is applied to a tree estimated from a given data set, PC may give an overestimate of statistical confidence. For this case, we developed a method for computing a modified version (P'C) of the PC value and showed that this P'C tends to give a conservative estimate of statistical confidence, though it is not as conservative as PB. In this paper we have introduced a model in which evolutionary distances between sequences follow a multivariate normal distribution. This model allowed us to study the relationships between the two tests analytically.      

A comparative test of phylogenetic diversity indices

Traditional measures of biodiversity, such as species richness, usually treat species as being equal. As this is obviously not the case, measuring diversity in terms of features accumulated over evolutionary history provides additional value to theoretical and applied ecology. Several phylogenetic diversity indices exist, but their behaviour has not yet been tested in a comparative framework. We provide a test of ten commonly used phylogenetic diversity indices based on 40 simulated phylogenies of varying topology. We restrict our analysis to a topological fully resolved tree without information on branch lengths and species lists with presence-absence data. A total of 38,000 artificial communities varying in species richness covering 5-95% of the phylogenies were created by random resampling. The indices were evaluated based on their ability to meet a priori defined requirements. No index meets all requirements, but three indices turned out to be more suitable than others under particular conditions. Average taxonomic distinctness (AvTD) and intensive quadratic entropy (J) are calculated by averaging and are, therefore, unbiased by species richness while reflecting phylogeny per se well. However, averaging leads to the violation of set monotonicity, which requires that species extinction cannot increase the index. Total taxonomic distinctness (TTD) sums up distinctiveness values for particular species across the community. It is therefore strongly linked to species richness and reflects phylogeny per se weakly but satisfies set monotonicity. We suggest that AvTD and J are best applied to studies that compare spatially or temporally rather independent communities that potentially vary strongly in their phylogenetic composition-i.e. where set monotonicity is a more negligible issue, but independence of species richness is desired. In contrast, we suggest that TTD be used in studies that compare rather interdependent communities where changes occur more gradually by species extinction or introduction. Calculating AvTD or TTD, depending on the research question, in addition to species richness is strongly recommended.     

Generalized neighbor-joining: more reliable phylogenetic tree reconstruction.

We have developed a phylogenetic tree reconstruction method that detects and reports multiple topologically distant low-cost solutions. Our method is a generalization of the neighbor-joining method of Saitou and Nei and affords a more thorough sampling of the solution space by keeping track of multiple partial solutions during its execution. The scope of the solution space sampling is controlled by a pair of user-specified parameters--the total number of alternate solutions and the number of alternate solutions that are randomly selected--effecting a smooth trade-off between run time and solution quality and diversity. This method can discover topologically distinct low-cost solutions. In tests on biological and synthetic data sets using either the least-squares distance or minimum-evolution criterion, the method consistently performed as well as, or better than, both the neighbor-joining heuristic and the PHYLIP implementation of the Fitch-Margoliash distance measure. In addition, the method identified alternative tree topologies with costs within 1% or 2% of the best, but with topological distances of 9 or more partitions from the best solution (16 taxa); with 32 taxa, topologies were obtained 17 (least-squares) and 22 (minimum-evolution) partitions from the best topology when 200 partial solutions were retained. Thus, the method can find lower-cost tree topologies and near-best tree topologies that are significantly different from the best topology.     

分子系统发育树构建的简易方法

以系统发育树构建的原有距离方法为基础,吸取了NJ法和FM法中的部分理论,提出了以节点引入为手段的新的简易方法,通过该方法构建了分子系统发育树,结果表明这种方法更加快捷,而且所得结果与FM法完全一致。