SPRSupertrees
From MaRDI portal
Software:26580
No author found.
Related Items (14)
Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees ⋮ Reduction rules for the maximum parsimony distance on phylogenetic trees ⋮ Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees ⋮ On the enumeration of tanglegrams and tangled chains ⋮ A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ Reconciliation of a gene network and species tree ⋮ Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Computing nearest neighbour interchange distances between ranked phylogenetic trees ⋮ Phylogenetic incongruence through the lens of Monadic Second Order logic ⋮ Approximating maximum agreement forest on multiple binary trees ⋮ Reflections on kernelizing and computing unrooted agreement forests ⋮ Computing Maximum Agreement Forests without Cluster Partitioning is Folly ⋮ A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
This page was built for software: SPRSupertrees
