Debian Med Phylogeny packages

ALTree was designed to perform association detection and localization of susceptibility sites using haplotype phylogenetic trees: first, it allows the detection of an association between a candidate gene and a disease, and second, it enables to make hypothesis about the susceptibility loci.

BEAST is a cross-platform program for Bayesian MCMC analysis of molecular sequences. It is entirely orientated towards rooted, time-measured phylogenies inferred using strict or relaxed molecular clock models. It can be used as a method of reconstructing phylogenies but is also a framework for testing evolutionary hypotheses without conditioning on a single tree topology. BEAST uses MCMC to average over tree space, so that each tree is weighted proportional to its posterior probability. Included is a simple to use user-interface program for setting up standard analyses and a suit of programs for analysing the results.

This program performs an alignment of multiple nucleotide or amino acid sequences. It recognizes the format of input sequences and whether the sequences are nucleic acid (DNA/RNA) or amino acid (proteins). The output format may be selected from in various formats for multiple alignments such as Phylip or FASTA. Clustal W is very well accepted.

The output of Clustal W can be edited manually but preferably with an alignment editor like SeaView or within its companion Clustal X. When building a model from your alignment, this can be applied for improved database searches. The Debian package hmmer creates such in form of an HMM.

Este paquete ofrece una interfaz gráfica para el programa de alineación de secuencia múltiple Clustal. Proporciona un entorno integrado para realizar múltiples alineaciones de secuencia y de perfil y analizar los resultados. El alineamiento de secuencias se muestra en una ventana por pantalla. Posee un esquema de colores versátil para resaltar las características conservadas en la alineación. Para presentaciones profesionales, debe usarse el paquete LaTeX texshade o boxshade.

Los menús desplegables en la parte superior de la ventana permiten seleccionar todas las opciones necesarias para la secuencia múltiple tradicional y el perfil de la alineación. Puede cortar y pegar secuencias para cambiar el orden de la alineación; también puede seleccionar un subconjunto de secuencias a ser alineado; puede seleccionar un sub-rango de la alineación para ser realineado e insertado de nuevo en la alineación original.

Se puede realizar un análisis de la calidad de alineación y los segmentos con baja puntuación o residuos excepcionales pueden señalarse.

DIALIGN2 is a command line tool to perform multiple alignment of protein or DNA sequences. It constructs alignments from gapfree pairs of similar segments of the sequences. This scoring scheme for alignments is the basic difference between DIALIGN and other global or local alignment methods. Note that DIALIGN does not employ any kind of gap penalty.

DIALIGN-TX es una aplicación basada en línea de comandos para realizar alineamientos múltiples de proteínas o secuencias de ADN. Es una re-implementación completa del enfoque fundamental que incluye nuevas mejoras y heurísticas que mejoran significativamente la calidad de los alineamientos de la salida, comparado con DIALIGN 2.2 y DIALIGN-T. Para el alineamiento de pares, DIALIGN-TX usa un algoritmo «fragment-chaining» que favorece cadenas de alineamientos locales de baja puntuación frente a los fragmentos aislados de alta puntuación. Para alineamientos múltiples, DIALIGN-TX emplea un procedimiento «greedy» mejorado que es menos sensible a las falsas similitudes entre secuencias locales.

Exonerate le permite alinear las secuencias usando muchos modelos de alineamiento, ya sea utilizando programación dinámica exhaustiva, o con una gran variedad de heurística. Gran parte de las funcionalidades de la suite de programación dinámica Wise se re-implementaron en C para una mayor eficiencia. Exonerate es un componente intrínseco de la construcción de las bases de datos del genoma de Ensembl, proporcionando coeficientes de similitud entre las secuencias del ANR y el ADN, permitiendo así determinar las uniones variables y las secuencias de la codificación en general.

Hay un sistema de simulación de experimentos «In-silico PCR» (consulte la página man ipcress) empaquetado con exonerate.

Este paquete también incluye una selección de utilidades para realizar manipulaciones sencillas y de forma rápida con archivos FASTA de más de 2Gb.

fastDNAml is a program derived from Joseph Felsenstein's version 3.3 DNAML (part of his PHYLIP package). Users should consult the documentation for DNAML before using this program.

fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML program from PASCAL to C.

Note that the homepage of this program is not available any more and so this program will probably not see any further updates.

FastTree infers approximately-maximum-likelihood phylogenetic trees from alignments of nucleotide or protein sequences. It handles alignments with up to a million of sequences in a reasonable amount of time and memory. For large alignments, FastTree is 100-1,000 times faster than PhyML 3.0 or RAxML 7.

FastTree is more accurate than PhyML 3 with default settings, and much more accurate than the distance-matrix methods that are traditionally used for large alignments. FastTree uses the Jukes-Cantor or generalized time-reversible (GTR) models of nucleotide evolution and the JTT (Jones-Taylor-Thornton 1992) model of amino acid evolution. To account for the varying rates of evolution across sites, FastTree uses a single rate for each site (the "CAT" approximation). To quickly estimate the reliability of each split in the tree, FastTree computes local support values with the Shimodaira-Hasegawa test (these are the same as PhyML 3's "SH-like local supports").

This package contains a single threaded version (fasttree) and a parallel version which uses OpenMP (fasttreMP).

FigTree is designed as a graphical viewer of phylogenetic trees and as a program for producing publication-ready figures. In particular it is designed to display summarized and annotated trees produced by BEAST.

This package contains the programs GMAP and GSNAP as well as utilities to manage genome databases in GMAP/GSNAP format. GMAP (Genomic Mapping and Alignment Program) is a tool for aligning EST, mRNA and cDNA sequences. GSNAP (Genomic Short-read Nucleotide Alignment Program) is a tool for aligning single-end and paired-end transcriptome reads. Both tools can use a database of

• known splice sites and identify novel splice sites.
• known single-nucleotide polymorphisms (SNPs). GSNAP can align bisulfite-treated DNA.

HMMER es una implementación de los métodos del modelo de Markov de perfiles ocultos para búsquedas en bases de datos de secuencias biológicas usando alineamientos múltiples como consultas.

Dado un alineamiento múltiple de secuencias como entrada, HMMER construye un modelo estadístico llamado modelo oculto de Markov que se puede usar como una consulta a una base de datos de secuencias para encontrar (y/o alinear) homólogos adicionales de la familia de secuencias.

IQ-TREE is a very efficient maximum likelihood phylogenetic software with following key features among others:

• A novel fast and effective stochastic algorithm to estimate maximum likelihood trees. IQ-TREE outperforms both RAxML and PhyML in terms of likelihood while requiring similar amount of computing time (see Nguyen et al., 2015)
• An ultrafast bootstrap approximation to assess branch supports (see Minh et al., 2013).
• A wide range of substitution models for binary, DNA, protein, codon, and morphological alignments.
• Ultrafast model selection for all data types, 10 to 100 times faster than jModelTest and ProtTest.
• Finding best partition scheme like PartitionFinder.
• Partitioned models with mixed data types for phylogenomic (multi- gene) alignments, allowing for separate, proportional, or joint branch lengths among genes.
• Supporting the phylogenetic likelihod library (PLL) (see Flouri et al., 2014)

jModelTest is a tool to carry out statistical selection of best-fit models of nucleotide substitution. It implements five different model selection strategies: hierarchical and dynamical likelihood ratio tests (hLRT and dLRT), Akaike and Bayesian information criteria (AIC and BIC), and a decision theory method (DT). It also provides estimates of model selection uncertainty, parameter importances and model-averaged parameter estimates, including model-averaged tree topologies. jModelTest 2 includes High Performance Computing (HPC) capabilities and additional features like new strategies for tree optimization, model- averaged phylogenetic trees (both topology and branch length), heuristic filtering and automatic logging of user activity.

Kalign es una herramienta de consola para realizar el alineamiento de múltiples secuencias biológicas. Emplea el algoritmo de la cadena de equiparación Muth-Manber, a fin de mejorar tanto la precisión como la velocidad de la adaptación. Se utiliza la adaptación global progresiva, enriquecida mediante el empleo de un algoritmo de aproximación de la cadena de equiparación para calcular las secuencias de distancias y la incorporación de las coincidencias locales en otras adaptaciones globales.

Bayesian inference of phylogeny is based upon a quantity called the posterior probability distribution of trees, which is the probability of a tree conditioned on the observations. The conditioning is accomplished using Bayes's theorem. The posterior probability distribution of trees is impossible to calculate analytically; instead, MrBayes uses a simulation technique called Markov chain Monte Carlo (or MCMC) to approximate the posterior probabilities of trees.

MUSCLE is a multiple alignment program for protein sequences. MUSCLE stands for multiple sequence comparison by log-expectation. In the authors tests, MUSCLE achieved the highest scores of all tested programs on several alignment accuracy benchmarks, and is also one of the fastest programs out there.

Muscle v5 is a major re-write of MUSCLE based on new algorithms.

Users should be aware that command line arguments compared to version 3.x of MUSCLE have changed!

Highest accuracy, scalable to thousands of sequences

Compared to previous versions, Muscle v5 is much more accurate, is often faster, and scales to much larger datasets. At the time of writing (late 2021), Muscle v5 has the highest scores on multiple alignment benchmarks including Balibase, Bralibase, Prefab and Balifam. It can align tens of thousands of sequences with high accuracy on a low-cost commodity computer (say, an 8-core Intel CPU with 32 Gb RAM). On large datasets, Muscle v5 is 20-30% more accurate than MAFFT and Clustal-Omega.

Alignment ensembles

Muscle v5 can generate ensembles of high-accuracy alternative alignments. All replicates have equal average accuracy on benchmark test, including the MSA made with default parameters. By comparing results of downstream analysis (trees, structure prediction...) on different replicates, you can assess the effects of alignment errors on your study.

MUSCLE is a multiple alignment program for protein sequences. MUSCLE stands for multiple sequence comparison by log-expectation. In the authors tests, MUSCLE achieved the highest scores of all tested programs on several alignment accuracy benchmarks, and is also one of the fastest programs out there.

This is version 3 of the muscle program. It is a different program than muscle version 5 which is packaged as muscle in Debian.

Mustang es un algoritmo para alinear estructuras de múltiples proteínas. Dado un conjunto de archivos PDB, el programa utiliza la información espacial en los átomos Calpha del conjunto para producir una secuencia de alineación. Basado en un par progresivo heurístico, el algoritmo procede a través de una serie de pasos de refinamiento. Mustang reporta las secuencias múltiples de alineación y la superposición correspondiente de las estructuras.

NJplot is able to draw any dendrogram expressed in the Newick standard phylogenetic tree format (e.g., the format used by the Phylip package). NJplot is especially convenient for rooting the unrooted trees obtained from parsimony, distance or maximum likelihood tree-building methods.

The PHYLogeny Inference Package is a package of programs for inferring phylogenies (evolutionary trees) from sequences. Methods that are available in the package include parsimony, distance matrix, and likelihood methods, including bootstrapping and consensus trees. Data types that can be handled include molecular sequences, gene frequencies, restriction sites, distance matrices, and 0/1 discrete characters.

PhyML is a software that estimates maximum likelihood phylogenies from alignments of nucleotide or amino acid sequences. It provides a wide range of options that were designed to facilitate standard phylogenetic analyses. The main strengths of PhyML lies in the large number of substitution models coupled to various options to search the space of phylogenetic tree topologies, going from very fast and efficient methods to slower but generally more accurate approaches. It also implements two methods to evaluate branch supports in a sound statistical framework (the non-parametric bootstrap and the approximate likelihood ratio test).

PhyML was designed to process moderate to large data sets. In theory, alignments with up to 4,000 sequences 2,000,000 character-long can be analyzed. In practice however, the amount of memory required to process a data set is proportional of the product of the number of sequences by their length. Hence, a large number of sequences can only be processed provided that they are short. Also, PhyML can handle long sequences provided that they are not numerous. With most standard personal computers, the “comfort zone” for PhyML generally lies around 3 to 500 sequences less than 2,000 character long.

This package also includes PhyTime.

POA is Partial Order Alignment, a fast program for multiple sequence alignment (MSA) in bioinformatics. Its advantages are speed, scalability, sensitivity, and the superior ability to handle branching / indels in the alignment. Partial order alignment is an approach to MSA, which can be combined with existing methods such as progressive alignment. POA optimally aligns a pair of MSAs and which therefore can be applied directly to progressive alignment methods such as CLUSTAL. For large alignments, Progressive POA is 10-30 times faster than CLUSTALW.

Populations is a population genetic software. It computes genetic distances between populations or individuals. It builds phylogenetic trees (NJ or UPGMA) with bootstrap values.

Pplacer places reads on a phylogenetic tree. guppy (Grand Unified Phylogenetic Placement Yanalyzer) yanalyzes them. rppr is a helpful tool for working with reference packages.

Pplacer places query sequences on a fixed reference phylogenetic tree to maximize phylogenetic likelihood or posterior probability according to a reference alignment. Pplacer is designed to be fast, to give useful information about uncertainty, and to offer advanced visualization and downstream analysis.

ProAlign performs probabilistic sequence alignments using hidden Markov models (HMM). It includes a graphical interface (GUI) allowing to (i) perform alignments of nucleotide or amino-acid sequences, (ii) view the quality of solutions, (iii) filter the unreliable alignment regions and (iv) export alignments to other software.

ProAlign uses a progressive method, such that multiple alignment is created stepwise by performing pairwise alignments in the nodes of a guide tree. Sequences are described with vectors of character probabilities, and each pairwise alignment reconstructs the ancestral (parent) sequence by computing the probabilities of different characters according to an evolutionary model.

Probalign uses partition function posterior probability estimates to compute maximum expected accuracy multiple sequence alignments. It performs statistically significantly better than the leading alignment programs Probcons v1.1, MAFFT v5.851, and MUSCLE v3.6 on BAliBASE 3.0, HOMSTRAD, and OXBENCH benchmarks. Probalign improvements are largest on datasets containing N/C terminal extensions and on datasets with long and heterogeneous length sequences. On heteregeneous length datasets containing repeats Probalign alignment accuracy is 10% and 15% higher than the other three methods when standard deviation of length is at least 300 and 400.

Tool for generating multiple alignments of protein sequences. Using a combination of probabilistic modeling and consistency-based alignment techniques, PROBCONS has achieved the highest accuracies of all alignment methods to date. On the BAliBASE benchmark alignment database, alignments produced by PROBCONS show statistically significant improvement over current programs, containing an average of 7% more correctly aligned columns than those of T-Coffee, 11% more correctly aligned columns than those of CLUSTAL W, and 14% more correctly aligned columns than those of DIALIGN.

ProDA es un sistema para la detección automática y alineamiento de regiones homólogas en colecciones de proteínas con arquitecturas dominantes arbitrarias. Dado un conjunto de entrada de secuencias no alineadas, ProDA identifica todas las regiones homólogas que aparezcan en una o más secuencias, y devuelve una colección de alineaciones múltiples locales para estas regiones.

PROTTEST (ModelTest's relative) is a program for selecting the model of protein evolution that best fits a given set of sequences (alignment). This java program is based on the Phyml program (for maximum likelihood calculations and optimization of parameters) and uses the PAL library as well. Models included are empirical substitution matrices (such as WAG, LG, mtREV, Dayhoff, DCMut, JTT, VT, Blosum62, CpREV, RtREV, MtMam, MtArt, HIVb, and HIVw) that indicate relative rates of amino acid replacement, and specific improvements (+I:invariable sites, +G: rate heterogeneity among sites, +F: observed amino acid frequencies) to account for the evolutionary constraints impossed by conservation of protein structure and function. ProtTest uses the Akaike Information Criterion (AIC) and other statistics (AICc and BIC) to find which of the candidate models best fits the data at hand.

QuickTree is an efficient implementation of the Neighbor-Joining algorithm (PMID: 3447015), capable of reconstructing phylogenies from huge alignments in time less than the age of the universe.

QuickTree accepts both distance matrix and multiple-sequence-aligment inputs. The former should be in PHYLIP format. The latter should be in Stockholm format, which is the native alignment format for the Pfam database. Alignments in various formats can be converted to Stockholm format with the sreformat program, which is part of the HMMer package (hmmer.org).

The tress are written to stdout, in the Newick/New-Hampshire format use by PHYLIP and many other programs

SeaView is a viewer and editor of multiple sequence alignments, i.e. DNA or protein sequences are positioned each in their own separate line, such that the nucleotide/amino acid at a particular position (column) is presumed to have the same biochemical property.

SeaView reads and writes various file formats (NEXUS, MSF, CLUSTAL, FASTA, PHYLIP, MASE, Newick) of DNA and protein sequences and of phylogenetic trees. Alignments can be manually edited. It drives the programs Muscle or Clustal Omega for multiple sequence alignment, and also allows one to use any external alignment algorithm able to read and write FASTA-formatted files. It computes phylogenetic trees by parsimony using PHYLIP's dnapars/protpars algorithm, by distance with NJ or BioNJ algorithms on a variety of evolutionary distances, or by maximum likelihood using the program PhyML 3.0.

SeaView draws phylogenetic trees on screen or PostScript files, and allows one to download sequences from EMBL/GenBank/UniProt using the Internet.

Sigma (“Simple greedy multiple alignment”) is an alignment program. It's algorithm and scoring scheme are designed specifically for non-coding DNA sequence.

It uses a strategy of seeking the best possible gapless local alignments. This happens at each step making the best possible alignment consistent with existing alignments. It scores the significance of the alignment based on the lengths of the aligned fragments and a background model. These may be supplied or estimated from an auxiliary file of intergenic DNA.

SPREAD is a user-friendly application to analyze and visualize phylogeographic reconstructions resulting from Bayesian inference of spatio-temporal diffusion.

There is a tutorial for SPREAD online at http://www.kuleuven.be/aidslab/phylogeography/tutorial/spread_tutorial.html

Originally this program is named "spread". However, there is just such a package inside Debian and thus a 'phy' for phylogeny was prepended.

T-Coffee is a multiple sequence alignment package. Given a set of sequences (Proteins or DNA), T-Coffee generates a multiple sequence alignment. Version 2.00 and higher can mix sequences and structures.

T-Coffee allows the combination of a collection of multiple/pairwise, global or local alignments into a single model. It can also estimate the level of consistency of each position within the new alignment with the rest of the alignments. See the pre-print for more information

T-Coffee has a special called M-Coffee that makes it possible to combine the output of many multiple sequence alignment packages. In its published version, it uses MUSCLE, PROBCONS, POA, DiAlign-TS, MAFFT, Clustal W, PCMA and T-Coffee. A special version has been made for Debian, DM-Coffee, that uses only free software by replacing Clustal W by Kalign. Using the 8 Methods of M-Coffee can sometimes be a bit heavy. You can use a subset of your favorite methods if you prefer.

TM-align is a computer algorithm for protein structure alignment using dynamic programming. The scoring is performed by the TM-score rotation matrix. This is similar to the RMSD in that unaligned portions of the structure influence the scoring less than the more structurally conserved regions.

TREE-PUZZLE (el nuevo nombre de PUZZLE) es un programa de consola interactivo que implementa un algoritmo de búsqueda rápida en árbol, dividiendo en cuartetos, que permite el análisis de grandes conjuntos de datos y les asigna automáticamente estimaciones de soporte de cada rama interna. TREE-PUZZLE también calcula las distancias de probabilidad máxima por parejas así como las longitudes de las ramas para los árboles que especifique el usuario. Las longitudes de las ramas también se pueden calcular bajo el uso del reloj. Además, TREE-PUZZLE ofrece un método nuevo, el mapeado de probabilidad, para investigar el soporte de ramas internas hipotéticas sin calcular todo el árbol y para ver el contenido filogenético de una alineación de secuencia.

Esta es la versión paralelizada de tree-puzzle.

TREE-PUZZLE (el nuevo nombre de PUZZLE) es un programa de consola interactivo que implementa un algoritmo de búsqueda rápida en árbol, dividiendo en cuartetos, que permite el análisis de grandes conjuntos de datos y les asigna automáticamente estimaciones de soporte de cada rama interna. TREE-PUZZLE también calcula las distancias de probabilidad máxima por parejas así como las longitudes de las ramas para los árboles que especifique el usuario. Las longitudes de las ramas también se pueden calcular bajo el uso del reloj. Además, TREE-PUZZLE ofrece un método nuevo, el mapeado de probabilidad, para investigar el soporte de ramas internas hipotéticas sin calcular todo el árbol y para ver el contenido filogenético de una alineación de secuencia.

TreeView creates a matrix-like display of expression data, known as Eisen clustering. The original implementation was a Windows program named TreeView by Michael Eisen. This TreeView package, sometimes also referred to as jTreeView, was rewritten in Java under a free license.

Java TreeView is an extensible viewer for microarray data in PCL or CDT format.

TreeView X is an open source and multi-platform program to display phylogenetic trees. It can read and display NEXUS and Newick format tree files (such as those output by PAUP*, ClustalX, TREE-PUZZLE, and other programs). It allows one to order the branches of the trees, and to export the trees in SVG format.

VeryFastTree is a highly efficient implementation inspired by the FastTree-2 tool, designed to expedite the inference of approximately-maximum-likelihood phylogenetic trees from nucleotide or protein sequence alignments. It is an optimized implementation designed to accelerate the estimation of phylogenies for large alignments. By leveraging parallelization and vectorization strategies, VeryFastTree significantly improves the performance and scalability of phylogenetic analysis, allowing it to construct phylogenetic trees in a fraction of the time previously required.

Maintaining the integrity of FastTree-2, VeryFastTree retains the same phases, methods, and heuristics used for estimating phylogenetic trees. This ensures that the topological accuracy of the trees produced by VeryFastTree remains equivalent to that of FastTree-2. Moreover, unlike the parallel version of FastTree-2, VeryFastTree guarantees deterministic results, eliminating any potential variations in the output.

To facilitate a seamless transition for users, VeryFastTree adopts the exact same command line arguments as FastTree-2. This means that by simply substituting FastTree-2 with VeryFastTree, and using the same set of options, users can significantly enhance the overall performance of their phylogenetic analyses.

TreeTime provides routines for ancestral sequence reconstruction and the maximum likelihoo inference of molecular-clock phylogenies, i.e., a tree where all branches are scaled such that the locations of terminal nodes correspond to their sampling times and internal nodes are placed at the most likely time of divergence.

TreeTime aims at striking a compromise between sophisticated probabilistic models of evolution and fast heuristics. It implements GTR models of ancestral inference and branch length optimization, but takes the tree topology as given. To optimize the likelihood of time-scaled phylogenies, treetime uses an iterative approach that first infers ancestral sequences given the branch length of the tree, then optimizes the positions of unconstraine d nodes on the time axis, and then repeats this cycle. The only topology optimization are (optional) resolution of polytomies in a way that is most (approximately) consistent with the sampling time constraints on the tree. The package is designed to be used as a stand-alone tool or as a library used in larger phylogenetic analysis workflows.

Features

• ancestral sequence reconstruction (marginal and joint maximum likelihood)
• molecular clock tree inference (marginal and joint maximum likelihood)
• inference of GTR models
• rerooting to obtain best root-to-tip regression
• auto-correlated relaxed molecular clock (with normal prior)

This package provides the Python 3 module.

Archaeopteryx is a software tool for the visualization, analysis, and editing of potentially large and highly annotated phylogenetic trees. It can be used both as applet (ArchaeopteryxA and ArchaeopteryxE) and as a standalone application.

Patristic overcomes some logistic barriers to analysing signals in sequences. In additional to calculating patristic distances, it provides plots for any combination of matrices, calculates commonly used statistics, allows data such as isolation dates to be entered and reorders matrices with matching species or gene labels. It will be used to analyse rates of mutation and substitutional saturation and the evolution of viruses.

Phylo_win is a graphical colour interface for molecular phylogenetic inference. It performs neighbor-joining, parsimony and maximum likelihood methods and bootstrap with any of them. Many distances can be used including Jukes & Cantor, Kimura, Tajima & Nei, HKY, Galtier & Gouy (1995), LogDet for nucleotidic sequences, Poisson correction for protein sequences, Ka and Ks for codon sequences. Species and sites to include in the analysis are selected by mouse. Reconstructed trees can be drawn, edited, printed, stored and evaluated according to numerous criteria.

This program uses sources files from the Phylip program, which forbids its use for profit. Therfore, Phylo_win will unfortunately have to be distributed in contrib or non-free.

gBioSeq is in an early stage of development, but it is already running. The goal is to provide an easy to use software to edit DNA sequences under Linux, Windows, MacOsX, using GTK C# (Mono).

A concise viewer/editor for phylogenetic trees in the Newick format. The core functions are written in JavaScript, using the canvas tag proposed by HTML 5. No server side support is needed for rendering the picture and therefore you can grab this page together with knhx.js and canvastext.js to locally view your trees in a supported web browser.

The source can be downloaded at http://www.sanger.ac.uk/Users/lh3/download/jstreeview.zip

PhpPhylotree is a web application that is able to draw phylogenetic trees. It produces an SVG (Scalable Vector Graphic) file from phylip/newick tree files.

TreeTime is controlled by input files in nexus format and does bayesian sampling of phylogenetic trees from these data.