| Literature DB >> 20472542 |
Thomas Junier1, Evgeny M Zdobnov.
Abstract
SUMMARY: We present a suite of Unix shell programs for processing any number of phylogenetic trees of any size. They perform frequently-used tree operations without requiring user interaction. They also allow tree drawing as scalable vector graphics (SVG), suitable for high-quality presentations and further editing, and as ASCII graphics for command-line inspection. As an example we include an implementation of bootscanning, a procedure for finding recombination breakpoints in viral genomes. AVAILABILITY: C source code, Python bindings and executables for various platforms are available from http://cegg.unige.ch/newick_utils. The distribution includes a manual and example data. The package is distributed under the BSD License. CONTACT: thomas.junier@unige.chEntities:
Mesh:
Year: 2010 PMID: 20472542 PMCID: PMC2887050 DOI: 10.1093/bioinformatics/btq243
Source DB: PubMed Journal: Bioinformatics ISSN: 1367-4803 Impact factor: 6.937
Selected Newick utilities programs and their functions
| Program | Function |
|---|---|
| Extracts clades (subtrees), specified by labels | |
| Extracts branch lengths in various ways (from root, from parent, as matrix, etc.) | |
| Draws trees as ASCII or SVG (suitable for further editing for presentations or publications), several options | |
| Reports matches of a tree in a larger tree | |
| Orders tree nodes, without altering topology | |
| Changes node labels | |
| Reroots trees on an outgroup, specified by labels | |
| Trims a tree at a specified depth | |
| Retains topological information |
SVG, Scalable vector graphics.
Fig. 1.Bootscanning using PhyML, EMBOSS, Muscle, Newick utilities, GNUPlot and standard Unix shell programs. The species with the lowest distance is the reference's nearest neighbor (by distance along tree branches). A recombination breakpoint is predicted near position 450, as the nearest neighbor changes abruptly.
Fig. 2.Average run times (10 samples) of rerooting tasks on various tree sizes in different implementations. The task involved reading, rerooting and printing out the tree as Newick. Runs of the BioPerl and APE implementation on the 20 000-leaf tree did not complete. Error bars show 1 SD. Computer: 3 GHz 64 bit Intel Core 2 Duo, 1 GB RAM, Linux 2.6. Made with R (R Development Core Team, 2008).