Tree building with FastTree
This page provides access to FastTree, an open-source C program that infers approximately-maximum-likelihood phylogenetic trees from aligned nucleotide or protein sequences. Per the documentation provided by the inventors of FastTree, it provides estimated phylogenies with superior statistical properties to fast distance-based methods (like the Neighbor-Joining algorithm used by our CladeBuilder) and slow, rigorous Maximum Likelihood (ML) tools (like RAxML or IQ-TREE), running 1many times faster than traditional ML software. Although our BI-308L project uses only 14 taxa, FastTree scales up to 1,000,000 sequences.
About this app
CODE_FastTree uses the published FastTree 2.1.11 WebAssembly build. It downloads the engine from Biowasm and runs the tree search locally in a Web Worker. The alignment stays in the browser. biowasm.com
- Input: Paste or upload aligned DNA or protein FASTA.
- No alignment? Go to our Protein sequence alignment explorer app.
- Analysis: Choose GTR or Jukes–Cantor for DNA, or JTT, WAG, or LG for protein. Optionally enable Gamma20 likelihood and branch-length scaling or SH-like local support.
- Results: View the unrooted tree with branch lengths and support labels, download Newick, and save the run log with the exact command and engine version.
- Also includes optiopn to opeon the tree in our CladePivot tree viewer.
- FastTree shows a Model fit summary above the inferred tree. It reports the substitution model and final CAT log-likelihood. With Gamma20 enabled, it also shows the Gamma20 log-likelihood, estimated gamma shape (α), and branch-length scale factor.
- For comparisons across runs on the same alignment, use the Gamma20 scores. CAT scores are useful as search diagnostics.
Note 1
Protein Sequence Alignment Explorer includes a port to this page. Alternatively, users may upload FASTA alignment files to this page to proceed with advanced tree building.
Infer an approximate maximum-likelihood tree from aligned DNA or protein FASTA. FastTree 2.1.11 runs in your browser. Your alignment stays on your device. Ambiguous residues and gaps are treated as missing. RNA U is read as DNA T. Unrooted tree drawn from an arbitrary internal node. Horizontal lengths represent expected substitutions per site. Internal labels, when present, are SH-like local support on a 0–1 scale.FastTree WebAssembly
Model fit
Inferred tree
Newick text
Run details
Engine output