Search tips
Search criteria 


Logo of narLink to Publisher's site
Nucleic Acids Res. 2008 July 1; 36(Web Server issue): W465–W469.
Published online 2008 April 19. doi:  10.1093/nar/gkn180
PMCID: PMC2447785 robust phylogenetic analysis for the non-specialist


Phylogenetic analyses are central to many research areas in biology and typically involve the identification of homologous sequences, their multiple alignment, the phylogenetic reconstruction and the graphical representation of the inferred tree. The platform transparently chains programs to automatically perform these tasks. It is primarily designed for biologists with no experience in phylogeny, but can also meet the needs of specialists; the first ones will find up-to-date tools chained in a phylogeny pipeline to analyze their data in a simple and robust way, while the specialists will be able to easily build and run sophisticated analyses. offers three main modes. The ‘One Click’ mode targets non-specialists and provides a ready-to-use pipeline chaining programs with recognized accuracy and speed: MUSCLE for multiple alignment, PhyML for tree building, and TreeDyn for tree rendering. All parameters are set up to suit most studies, and users only have to provide their input sequences to obtain a ready-to-print tree. The ‘Advanced’ mode uses the same pipeline but allows the parameters of each program to be customized by users. The ‘A la Carte’ mode offers more flexibility and sophistication, as users can build their own pipeline by selecting and setting up the required steps from a large choice of tools to suit their specific needs. Prior to phylogenetic analysis, users can also collect neighbors of a query sequence by running BLAST on general or specialized databases. A guide tree then helps to select neighbor sequences to be used as input for the phylogeny pipeline. is available at:


Reconstructing the evolutionary history of molecular sequences through phylogenetic analysis is at the heart of many biological research areas such as comparative genomics, functional prediction, detection of lateral gene transfer or the identification of new micro-organisms. Starting from a sequence of interest, a typical phylogenetic analysis goes through successive steps that include the identification of homologous sequences, multiple alignment, phylogenetic reconstruction and graphical representation of the inferred tree. This process requires substantial computational resources depending on the number and length of the sequences, and on the methods used.

A huge variety of models, approaches and computer programs are currently available, as can be seen from Joe Felsenstein's phylogeny software inventory ( The task of deciding which method to use, installing the corresponding programs, and running them on a local computer, is beyond the reach of most occasional users. Yet, phylogenetic trees have become a compulsory illustration (and referee's request) in most sequence-related studies. As a consequence, user-friendly but ancient programs are still widely used, though much improved methods now exist and are only used by the specialists, typically involved in molecular evolution or systematics.

In this context, has been designed to provide a ready-to-use platform that transparently chains alignment and phylogeny programs in a comprehensive and flexible manner. Although phylogenetic specialists will be able to find up-to-date tools and run sophisticated analyses based on their favorite approaches and their own parameter settings, the primary philosophy of is to assist biologists with no experience in phylogeny in analyzing their data in a simple and robust way, using methods corresponding to well-accepted standards. Maximum-likelihood (ML) tree construction is the default option to infer phylogenies, which is commonly recognized (1) as the most accurate approach (along with Bayesian) in molecular phylogenetics. offers ‘one-stop-shopping’ among a variety of leading methods for multiple sequence alignment, phylogenetic reconstruction and graphical representation of trees, and chains these methods into a pipeline that can be executed in three modes. The ‘One Click’ mode is designed for biologists with no experience in bioinformatics; given a set of unaligned sequences, a predefined pipeline using MUSCLE (2), Gblocks (3), PhyML (4) and TreeDyn (5) outputs the corresponding phylogenetic tree in a ready-to-print format. The ‘Advanced’ mode allows the settings of each ‘One Click’ tool to be customized by users. The ‘A la Carte’ mode offers flexible choices in the pipeline steps, the tools and their settings to suit the more specific needs of experts.

Several other web sites propose related services. PhyloBuilder (6) and PhyloBlast (7) are dedicated to proteins and gather homologs of a query sequence to build a phylogenetic tree using a distance or a parsimony method. POWER (8) infers a phylogenetic tree from a sequence set using a pipeline involving ClustalW (9) and PHYLIP (10) programs. Tarraga et al. recently proposed Phylemon (11) which provides experts with a suite of online programs and a Java interface to build a phylogeny pipeline. The main specificity of is the combination of an interface designed for the non-specialists with up-to-date programs that are often reserved to experts. Moreover, is able to analyze both DNA and protein sequences.


The platform proposes three major components:

  1. a pipeline to reconstruct a phylogenetic tree from a set of sequences through an automated process that successively performs multiple sequence alignment, alignment refinement, phylogenetic reconstruction and, finally, a graphical representation of the resulting tree;
  2. a fast parallel Blast (12) module to search for sequences similar to a query sequence. Sequence selection is facilitated by a ‘quick-and-dirty’ guide tree based on Blast results, and by an estimate of final alignment length;
  3. a suite of standalone phylogenetic programs.

All these components are offered in a user-friendly tabulated menu facilitating navigation, together with examples to familiarize users with the correct input and expected results. All programs used in the pipeline, their parameters, and their references are displayed in an ‘Analysis overview’ that provides the main information to be indicated in a publication. In addition, the web interface enables users to visualize, manipulate and locally edit their results through applet viewers such as Jalview (13) for alignment, or ATV (14) for phylogenetic tree.


At the core of the system lies the pipeline allowing a phylogenetic tree to be built at once from a set of sequences. This pipeline consists of a succession of Perl modules wrapping different external software programs, which can be executed through the three modes described below. This process requires many additional programs that are not detailed here: (i) to make the junction between the main programs (format compatibility), (ii) to output the results in several formats (e.g. PNG or PDF) or (iii) to rearrange and modify the tree (e.g. Retree from PHYLIP is used to root the tree with the midpoint method or using an outgroup).

‘One Click’ mode

The ‘One Click’ mode targets users who do not wish to deal with program and parameter selection. By default, the pipeline is already set up to run and connect well-recognized programs: MUSCLE for multiple alignment, Gblocks for automatic alignment curation, PhyML for tree building and TreeDyn for tree drawing.

Several studies showed that these programs are both fast and accurate. MUSCLE was assessed using several alignment databases, including the BAliBASE benchmark (15), on which it achieved the highest ranking of any method at the time of publication. PhyML was shown to be at least as accurate as other existing phylogeny programs using simulated data, while being one order of magnitude faster. Both programs have continuously been improved. These two programs are widely used (~650 and ~1000 citations in Web of Science, for MUSCLE and PhyML, respectively). It follows that they are robust, stable and bug free, and that the best way to use them has been reported by numerous users. Notably, the default options and parameter values have been selected with care; they are used in the ‘One Click’ mode and should be suited for most studies.

PhyML is run with the aLRT statistical test (16) of branch support. This test is based on an approximation of the standard Likelihood Ratio Test, and is much faster to compute than the usual bootstrap procedure. Both methods output the same trees; branch supports may differ but are generally highly correlated. Altogether, this mode makes routine phylogenetic analyses simple and fast. Users only need to load their set of sequences and submit their request. A few minutes later, the system will display a ready-to-print phylogenetic tree in a publication quality image. One has still the possibility to disable or not the alignment refinement performed by the Gblocks program, which eliminates poorly aligned positions and divergent regions. It is also possible to specify an outgroup (midpoint rooting is the default option).

‘Advanced’ mode

In the ‘Advanced’ mode, the pipeline is the same as the one used in the ‘One Click’ mode but users can now freely edit the settings of each program. The pipeline is flexible enough to enable users to select which steps to perform. In this manner, input data can be a set of non-aligned sequences, a sequence alignment or a tree in Newick format. Various file formats are supported as shown in Table 1. Furthermore, the system offers the possibility to inspect the results of each step before launching the next program, so that expert users can detect problems and adjust parameters accordingly.

Table 1.
Main tools available on

‘A la Carte’ mode

This mode presents the same interface as the ‘Advanced’ mode (e.g. step-by-step execution, parameter settings), but offers the possibility of running, testing and comparing the efficiency of a larger panel of methods and programs. It proposes a user-friendly customizable pipeline on which users can select the steps to perform, and the program to use for each of them.

For the alignment step, this mode proposes T-Coffee (17) which ranks high in accuracy but is slower than MUSCLE, and its derivative 3DCoffee (18) that offers the unique possibility of incorporating protein structure information to improve alignments.

For phylogeny reconstruction, a choice is offered among the following approaches: maximum likelihood method using PhyML, parsimony using NONA (for DNA, 19) or Protpars (for proteins, 10), or distance-based methods using BioNJ (20) or Neighbor (NJ, 21) from PHYLIP (10). With BioNJ and NJ, evolutionary distances are calculated using Protdist (10) for proteins and Fastdist (22) for DNA, while bootstrap analysis is achieved by combining Seqboot and Consense (10). Distance methods are very fast and should be preferred for large-scale analyses, or when performing bootstrap studies. Parsimony and ML methods are roughly as fast in practice (at least when using the programs selected here); they are able to analyze relatively large datasets, but become quite slow with bootstrap. ML is commonly reported as the most accurate approach, but parsimony does not require any substitution model to be selected, which appears preferable to some users. In practice, it is always a good idea to run several programs with various options and verify the stability of the results. greatly facilitates this conservative approach as users can easily modify the choices in the pipeline and run the server again.

The ‘A la Carte’ mode makes it easy to integrate and compare both old reference programs—such as the basic tree viewers Drawgram and Drawtree, from PHYLIP—and new ones which are not yet well diffused in the scientific community—such as TreeDyn that offers sophisticated tools and options to draw trees. For example, this mode still provides ClustalW which is still the most popular alignment tool to date even though it has been shown to be less accurate than modern alignment programs (23).

Tree visualization and drawing

Following phylogenetic tree reconstruction by any of these three modes, an image of the tree is produced to facilitate its interpretation. allows the tree image to be drawn and modified using a variety of TreeDyn options. These include: change of the tree shape (rectangular or radial), font style, color of the text and branches, display of branch supports, edition of taxon names and root selection. The tree image can then be obtained in PNG and PDF formats and eventually incorporated in any artwork for publication.


Prior to a phylogenetic analysis, users can also build their initial dataset by running Blastall against several public sequence databases (e.g. 16S Database, GenBank NT, Swissprot). This search is performed in parallel on a 25-node Linux cluster, and allows for a quick exploration of the neighbors of a query sequence. A rough multiple alignment of the query and hit sequences is generated on the fly by piling the individual Blast pairwise alignments. This alignment serves to construct and display a NJ tree using uncorrected p-distances, so that sequences can be selected and incorporated into the dataset by simply clicking on the tree image. To facilitate this process, sequence names are colored according to the taxonomic group of the species they belong to. Furthermore, to help in the choice of sequences maximizing the number of gap-free sites available for phylogenetic reconstruction, an estimation of the length of the final multiple alignment is dynamically computed each time a sequence is selected. Once the selection step is completed, users can run the phylogeny pipeline or retrieve the selected sequences in FASTA format.


The platform currently runs on a dedicated server (PowerEdge 2850-Xeon 2.8 GHz/2 × 2 MB Dual Core), except for the Blast module which is parallelized on a 25-CPU cluster. Input limitations depend on the selected program and its computational speed, as shown in Table 1. MUSCLE and ClustalW are limited to 200 sequences, while T-Coffee and 3D-Coffee limitations are <50 sequences and <2000 sites. Distance-based phylogeny programs (i.e. NJ and BioNJ) have no limitation, while all other phylogeny programs are limited to: (sequence size) × (number of taxa)2 < 10 000 000 (e.g. 100 sequences with length 1000). The number of bootstrap replicates—a highly sensitive parameter in terms of computational burden—is limited to 100 with all phylogeny programs, except NJ and BioNJ which are allowed 500 replicates. These limitations shall be relaxed in the near future, as the platform will be implemented on more powerful servers and multiple sites.


To our knowledge, is the first web server designed for both non-specialists and experts, which provides a complete automated phylogenetic analysis—from FASTA file to tree image—thanks to a pipeline of well-trusted tools. has been advertised in 2007 on a few diffusion lists. It currently processes about 2500 submissions per month from about 800 different users, who beta-tested the initial platform and now seem to be satisfied. Current waiting times with the ‘One Click’ mode (without bootstrap) are ~2 and ~6 min for alignments of 50 DNA sequences with 1463 sites and of 40 proteins with 430 sites, respectively. When a bootstrap analysis is performed (‘Advanced’ and ‘A la carte’ modes) waiting times are much longer (~100 times with 100 replicates) and the results are sent by email.

The modular architecture of the pipeline will facilitate the addition of new features and new programs according to the evolution of the field. is not committed to a particular set of programs. The methods constituting the backbone of the ‘One Click’ mode today will be replaced by newer ones, if considered better by a large consensus in the field. The dethroned methods will then become part of the ‘A la carte’ mode, to ensure compatibility with previous studies.

Among the further developments to come shortly, we will add the possibility of selecting the best substitution model to reconstruct the phylogeny, using MODELTEST (DNA, 24) or ProtTest (proteins, 25). Additional tools facilitating the selection of sequences after a BLAST search will be integrated, and the final output tree will become clickable to help recovering information on the sequences, e.g. functional annotations from the Gene Ontology. Moreover, we plan to provide password-protected accounts to enable users to store and load their results, and to refine their previous analyses; researchers will thus be able to create and share online projects with their collaborators.


IGS and MAB-LIRMM teams equally contributed to this work. A.D., V.G.: conceived and implemented the server, wrote the manuscript; G.B., S.A., S.B., F.C., J.F.D., S.G., V.L., M.L.: helped in the design of the server and/or implemented specific tools; J.M.C.: initiated the project, managed the alignment side, wrote the manuscript; O.G.: managed the phylogeny side, wrote the manuscript.

Conflict of interest statement. None declared.


Sincere thanks to the authors of the many tools used by This project was supported by fundings from the ‘Réseau National des Génopoles’ (RNG) and CNRS. Funding to pay the Open Access publication charges for this article was provided by RNG.


1. Kuhner MK, Felsenstein J. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol. 1994;11:459–468. [PubMed]
2. Edgar RC. MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics. 2004;32:1792–1797.
3. Castresana J. Selection of conserved blocks for multiple alignments for their use in phylogenetic alignments. Mol. Biol. Evol. 2000;17:540–552. [PubMed]
4. Guindon S, Gascuel O. A simple, fast and accurate algorithm to estimate larges phylogenies by maximum likelihood. Syst. Biol. 2003;52:696–704. [PubMed]
5. Chevenet F, Brun C, Banuls AL, Jacq B, Christen R. TreeDyn: towards dynamic graphics and annotations for analyses of trees. BMC Bioinformatics. 2006;7:439. [PMC free article] [PubMed]
6. Glanville JG, Kirshner D, Krishnamurthy N, Sjölander K. Berkeley Phylogenomics Group web servers: resources for structural phylogenomic analysis. Nucleic Acids Res. 2007;35(web server issue):W27–W32. [PMC free article] [PubMed]
7. Brinkman FS, Wan I, Hancock RE, Rose AM, Jones SJ. PhyloBLAST: facilitating phylogenetic analysis of BLAST results. Bioinformatics. 2001;17:385–387. [PubMed]
8. Lin CY, Lin FK, Lin CH, Lai LW, Hsu HJ, Chen SH, Hsiung CA. POWER: PhylOgenetic WEb Repeater – an integrated and user-optimized framework for biomolecular phylogenetic analysis. Nucleic Acids Res. 2005;33(web server issue):W553–W556. [PMC free article] [PubMed]
9. Thompson JD, Higgins DG, Gibson TJ. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acid Res. 1994;22:4673–4680. [PMC free article] [PubMed]
10. Felsenstein J. PHYLIP (PHYLogeny Inference Package) version 3.6a2. Seattle: Department of Genetics, University of Washington; 1993. distributed by the author.
11. Tarraga J, Medina I, Arbiza L, Huerta-Cepas J, Gabaldon T, Dopazo J, Dopazo H. Phylemon: a suite of web tools for molecular evolution, phylogenetics and phylogenomics. Nucleic Acid Res. 2007;35:38–42.
12. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic local alignment search tool. J. Mol. Biol. 1990;215:403–410. [PubMed]
13. Clamp M, Cuff J, Searle SM, Barton GJ. The Jalview Java alignment editor. Bioinformatics. 2004;20:426–427. [PubMed]
14. Zmasek CM, Eddy SR. ATV: display and manipulation of annotated phylogenetic trees. Bioinformatics. 2001;17:383–384. [PubMed]
15. Thompson JD, Plewniak F, Poch O. BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics. 1999;15:87–88. [PubMed]
16. Anisimova M, Gascuel O. Approximate likelihood ratio test for branches: a fast, accurate and powerful alternative. Syst. Biol. 2006;55:539–552. [PubMed]
17. Notredame C, Higgins DG, Heringa J. T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 2000;302:205–217. [PubMed]
18. O'Sullivan O, Suhre K, Abergel C, Notredame C. 3DCoffee: combining protein sequences and structures within multiple sequence alignments. J. Mol. Biol. 2004;340:385–395. [PubMed]
19. Goloboff P. NONA (NO NAME) Version 2. Tucumán, Argentina: 1999. Published by the author.
20. Gascuel O. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 1997;14:685–695. [PubMed]
21. Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 1987;4:406–425. [PubMed]
22. Elias I, Lagergren J. Fast computation of distance estimators. BMC Bioinformatics. 2007;13:8–89.
23. Wallace IM, Blackshields G, Higgins DG. Multiple sequence alignments. Curr. Opin. Struct. Biol. 2005;15:261–266. [PubMed]
24. Posada D, Crandall KA. MODELTEST: testing the model of DNA substitution. Bioinformatics. 1998;14:817–818. [PubMed]
25. Abascal F, Zardoya R, Posada D. ProtTest: selection of best-fit models of protein evolution. Bioinformatics. 2005;21:2104–2105. [PubMed]

Articles from Nucleic Acids Research are provided here courtesy of Oxford University Press