SPRSupertrees

swMATH14683MaRDI QIDQ26580FDOQ26580

Author name not available (Why is that?)

Cited In (14)

• 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
• Computing Maximum Agreement Forests without Cluster Partitioning is Folly
• Reconciliation of a gene network and species tree
• Approximating maximum agreement forest on multiple binary trees
• Reduction rules for the maximum parsimony distance on phylogenetic trees
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• 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
• 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