Display Settings:

Format

Send to:

Choose Destination

    BMC Evol Biol. 2009 May 18;9:108.

    PhyloExplorer: a web server to validate, explore and query phylogenetic trees.

    Ranwez V, Clairon N, Delsuc F, Pourali S, Auberval N, Diser S, Berry V.

    Institut des Sciences de l'Evolution (ISEM, UMR 5554 CNRS), Université Montpellier II, Place E, Bataillon - 34095 Montpellier Cedex 05, France. vincent.ranwez@univ-montp2.fr

    BACKGROUND: Many important problems in evolutionary biology require molecular phylogenies to be reconstructed. Phylogenetic trees must then be manipulated for subsequent inclusion in publications or analyses such as supertree inference and tree comparisons. However, no tool is currently available to facilitate the management of tree collections providing, for instance: standardisation of taxon names among trees with respect to a reference taxonomy; selection of relevant subsets of trees or sub-trees according to a taxonomic query; or simply computation of descriptive statistics on the collection. Moreover, although several databases of phylogenetic trees exist, there is currently no easy way to find trees that are both relevant and complementary to a given collection of trees. RESULTS: We propose a tool to facilitate assessment and management of phylogenetic tree collections. Given an input collection of rooted trees, PhyloExplorer provides facilities for obtaining statistics describing the collection, correcting invalid taxon names, extracting taxonomically relevant parts of the collection using a dedicated query language, and identifying related trees in the TreeBASE database. CONCLUSION: PhyloExplorer is a simple and interactive website implemented through underlying Python libraries and MySQL databases. It is available at: http://www.ncbi.orthomam.univ-montp2.fr/phyloexplorer/ and the source code can be downloaded from: http://code.google.com/p/taxomanie/.

    PMID: 19450253 [PubMed - indexed for MEDLINE]

    PMCID: PMC2695458

    Supplemental Content

    Click here to read Click here to read