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