Pages that link to "Item:Q2388380"

The following pages link to Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380):

Displaying 27 items.

• Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
• Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
• On joint subtree distributions under two evolutionary models (Q304457) (← links)
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
• Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
• On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
• Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
• Analyzing and reconstructing reticulation networks under timing constraints (Q604547) (← links)
• A cluster reduction for computing the subtree distance between phylogenies (Q659644) (← links)
• Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
• Note on the hybridization number and subtree distance in phylogenetics (Q1021896) (← links)
• A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
• On the existence of a cherry-picking sequence (Q1694728) (← links)
• Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies (Q1738320) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
• When two trees go to war (Q2261656) (← links)
• A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
• Phylogenetic networks from multi-labelled trees (Q2500119) (← links)
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations (Q2634749) (← links)
• The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
• Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
• An Improved Approximation Algorithm for rSPR Distance (Q2817889) (← links)
• Hybridization Number on Three Rooted Binary Trees is EPT (Q2818206) (← links)
• Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)