phylo provides memory-efficient data structures and algorithms for phylogenetic
analysis and inference — from tree manipulation (SPR, NNI, rerooting) to tree
statistics (phylogenetic diversity, RF distance, cophenetic distance). It leans
on Rust's memory safety, speed, and native WebAssembly support to stay both fast
and portable.
Tree traversals and operations are exposed as derivable traits, so you get
DFS/BFS/pre-/post-order, Euler tours, LCA queries, and distance metrics for free
on your own types — and a ready-made SimpleRootedTree when you don't want to
implement one.
- Trait-first design — compose narrow traits (
RootedTree,RootedMetaTree,EulerWalk,DFS,Clusters, …) onto any type, or use the batteries-includedPhyloTree. - Arena-allocated trees — cache-friendly
Vec-backed storage withusizenode IDs. - Constant-time LCA — an
LcaOracleborrows the tree immutably and answers LCA queries in O(1) via an Euler tour + RMQ. - Tree comparison — Robinson-Foulds, weighted RF, cluster affinity, and cophenetic distance, with distance-matrix builders.
- Maximum-likelihood modeling — GTR+I+G substitution models (JC69 through GTR), Felsenstein-pruning log-likelihood, and marginal/joint ancestral sequence reconstruction.
- I/O — Newick and Nexus parsing and serialization.
- Simulation — random trees (Yule, uniform).
- Optional parallelism — opt into
rayon-backed computation with theparallelfeature.
cargo add phyloOr add it to Cargo.toml:
[dependencies]
phylo = "5"| Feature | Default | Description |
|---|---|---|
simple_rooted_tree |
Yes | The concrete SimpleRootedTree / PhyloTree implementation. |
non_crypto_hash |
Yes | Use fxhash maps/sets instead of std for speed. |
parallel |
rayon-based parallel computation for the heavy metrics. |
|
serde |
Serialize/Deserialize for trees. |
Everything you need is in the prelude:
use phylo::prelude::*;Create an empty tree, then attach children to node IDs:
use phylo::prelude::*;
let mut tree = PhyloTree::new(1);
tree.add_child(tree.get_root_id(), PhyloNode::new(2));
tree.add_child(tree.get_root_id(), PhyloNode::new(3));
tree.add_child(2, PhyloNode::new(4));
tree.add_child(2, PhyloNode::new(5));use phylo::prelude::*;
let tree = PhyloTree::from_newick("((A:0.1,B:0.2),C:0.6);".as_bytes()).unwrap();
let newick = tree.to_newick();Traversals return an Iterator of nodes or node IDs in visiting order:
use phylo::prelude::*;
let tree = PhyloTree::from_newick("((A:0.1,B:0.2),C:0.6);".as_bytes()).unwrap();
let dfs = tree.dfs(tree.get_root_id());
let bfs = tree.bfs_ids(tree.get_root_id());
let postorder = tree.postord_ids(tree.get_root_id());Build an LcaOracle with tree.lca(); it borrows the tree immutably (so
staleness is a compile error, not a runtime bug) and answers queries in O(1):
use phylo::prelude::*;
let tree = PhyloTree::from_newick("((A,B),(C,D));".as_bytes()).unwrap();
let a = tree.get_taxa_node_id(&"A".to_string()).unwrap();
let b = tree.get_taxa_node_id(&"B".to_string()).unwrap();
let lca = tree.lca();
let ancestor = lca.get_lca_id(&[a, b]);Metrics account for both topology and branch lengths:
use phylo::prelude::*;
fn depth(tree: &PhyloTree, node_id: usize) -> f32 {
tree.depth(node_id) as f32
}
let mut tree_1 = PhyloTree::from_newick("((A:0.1,B:0.2):0.6,(C:0.3,D:0.4):0.5);".as_bytes()).unwrap();
let mut tree_2 = PhyloTree::from_newick("((D:0.3,C:0.4):0.5,(B:0.2,A:0.1):0.6);".as_bytes()).unwrap();
let _ = tree_1.set_zeta(depth);
let _ = tree_2.set_zeta(depth);
let cluster_affinity = tree_1.ca(&tree_2);
let cophenetic = tree_1.cophen_dist(&tree_2, 2);Score an alignment against a tree under a substitution model, or reconstruct
ancestral sequences at the internal nodes. log_likelihood runs Felsenstein's
pruning algorithm alone (no reconstruction); marginal_asr / joint_asr build
on the same pruning core:
use phylo::prelude::*;
let tree = PhyloTree::from_newick("((A:0.1,B:0.2):0.15,(C:0.3,D:0.1):0.05);".as_bytes()).unwrap();
// A nucleotide alignment in FASTA — one sequence per leaf taxon.
let fasta = b">A\nACGTACGT\n>B\nACGTATGT\n>C\nACGAACGT\n>D\nTCGTACGA\n";
let aln = Alignment::from_fasta_bytes(fasta).unwrap();
// HKY85 with gamma-distributed rate heterogeneity (+G, 4 categories).
let model = GtrModel::<Nucleotide>::hky85([0.25, 0.25, 0.25, 0.25], 2.0)
.unwrap()
.with_gamma(0.5, 4)
.unwrap();
// Log-likelihood of the alignment given the tree and model (pruning only).
let log_lik = tree.log_likelihood::<Nucleotide>(&model, &aln).unwrap();
// Marginal ancestral sequence reconstruction fills the internal nodes.
let recon = tree.marginal_asr::<Nucleotide>(&model, &aln, false).unwrap();
let root_sequence = recon.sequence_string(tree.get_root_id());| Module | What it does |
|---|---|
tree::simple_rtree |
Core tree traits and SimpleRootedTree. |
tree::ops |
Mutating operations: SPR, NNI, reroot, contraction, subtree extraction. |
tree::distances |
RF, weighted RF, cluster affinity, cophenetic distance, distance matrices. |
tree::io |
Newick and Nexus reading/writing. |
tree::simulation |
Random tree generation. |
iter |
Traversals, Euler walks, and the LCA oracle. |
models |
GTR+I+G substitution models and their named special cases. |
tree::likelihood |
Felsenstein-pruning log-likelihood. |
tree::asr |
Marginal and joint ancestral sequence reconstruction. |
Runnable analyses live in the examples/ directory. To visualize
their output, install the Python requirements first:
pip install -r examples/visualization/requirements.txtQuantifying phylogenetic diversity — the Faith index across a set of trees.
Run it, then plot with examples/visualization/pd.py:
cargo run --example phylogenetic-diversityVisualizing tree space — all pairwise distances across a set of trees. Run
it, then plot with examples/visualization/tree-space.py:
cargo run --example pairwise-distancesphylo builds for wasm32 targets out of the box, making it suitable for
in-browser phylogenetics. Use your usual wasm toolchain — e.g. wasm-pack, or
cargo build --target wasm32-unknown-unknown.
If you use phylo in your work, please cite
this paper:
@article{vijendran2025phylo,
title={Phylo-rs: an extensible phylogenetic analysis library in rust},
author={Vijendran, Sriram and Anderson, Tavis and Markin, Alexey and Eulenstein, Oliver},
journal={BMC bioinformatics},
volume={26},
pages={197},
year={2025}
}Licensed under the MIT License.