Cited in
(22)- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- On the enumeration of tanglegrams and tangled chains
- Reconciliation of a gene network and species tree
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Approximating maximum agreement forest on multiple binary trees
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
- PhyML
- ComputeTW
- rSPR
- HybridNET
- Dendroscope
- Tanglegrams
- 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
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
- Computing maximum agreement forests without cluster partitioning is folly
- Reflections on kernelizing and computing unrooted agreement forests
- Phylogenetic incongruence through the lens of monadic second order logic
This page was built for software: SPRSupertrees
