Cited in
(23)- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Faster exact computation of rSPR distance
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- Approximating maximum agreement forest on multiple binary trees
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- FastHN
- HybridNET
- SPRSupertrees
- RIATA-HGT
- PhyloNet
- T-REX
- spr_neighbors
- tcp_package
- treeOclock
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
- An improved approximation algorithm for rSPR distance
- A new algorithm for inferring hybridization events based on the detection of horizontal gene transfers
- A duality based 2-approximation algorithm for maximum agreement forest
This page was built for software: rSPR
