Pages that link to "Item:Q504072"

The following pages link to On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072):

Displaying 19 items.

• On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
• A cluster reduction for computing the subtree distance between phylogenies (Q659644) (← links)
• Treewidth distance on phylogenetic trees (Q1637220) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• Exploring the tiers of rooted phylogenetic network space using tail moves (Q1786929) (← links)
• Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
• Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics (Q2195553) (← links)
• New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
• Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
• Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
• On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625) (← links)
• Phylogenetic incongruence through the lens of monadic second order logic (Q2790162) (← links)
• Fixed-parameter algorithms for maximum agreement forests (Q2862198) (← links)
• Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
• The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)
• Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
• (Q5111799) (← links)
• Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
• A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)