Pages that link to "Item:Q881571"

The following pages link to Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571):

Displaying 32 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)
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← 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)
• Rotation distance is fixed-parameter tractable (Q989526) (← links)
• A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
• Note on the hybridization number and subtree distance in phylogenetics (Q1021896) (← 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)
• Reconstruction of certain phylogenetic networks from the genomes at their leaves (Q1794477) (← links)
• On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
• New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104) (← links)
• When two trees go to war (Q2261656) (← links)
• NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization (Q2295760) (← links)
• Properties of normal phylogenetic networks (Q2380836) (← links)
• Reconstruction of some hybrid phylogenetic networks with homoplasies from distances (Q2426378) (← links)
• A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
• The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
• The hybrid number of a ploidy profile (Q2673882) (← links)
• Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
• Hybridization number on three rooted binary trees is EPT (Q2818206) (← links)
• Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
• Heading in the right direction? Using head moves to traverse phylogenetic network space (Q4994346) (← links)
• Combining Networks Using Cherry Picking Sequences (Q5041128) (← links)
• Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
• A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
• Computing the rooted triplet distance between phylogenetic networks (Q5918288) (← links)
• The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings (Q6564619) (← links)
• Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)