Pages that link to "Item:Q2149104"

The following pages link to New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104):

Displaying 8 items.

• Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
• Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
• Analyzing and reconstructing reticulation networks under timing constraints (Q604547) (← links)
• On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
• Orchard networks are trees with additional horizontal arcs (Q2155699) (← links)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
• Hybridization number on three rooted binary trees is EPT (Q2818206) (← links)