Kernelizations for the hybridization number problem on multiple nonbinary trees
From MaRDI portal
Recommendations
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- A quadratic kernel for computing the hybridization number of multiple trees
- Hybridization number on three rooted binary trees is EPT
- A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
- New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- A quadratic kernel for computing the hybridization number of multiple trees
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Approximation algorithms for nonbinary agreement forests
- Bounding the number of hybridisation events for a consistent evolutionary history
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- Counting phylogenetic networks
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
- Fixed-parameter algorithms for maximum agreement forests
- On problems without polynomial kernels
- Reconstructing evolution of sequences subject to recombination using parsimony
Cited in
(16)- Hybridization number on three rooted binary trees is EPT
- Treewidth distance on phylogenetic trees
- Treewidth of display graphs: bounds, brambles and applications
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- A quadratic kernel for computing the hybridization number of multiple trees
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
- A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
- Embedding phylogenetic trees in networks of low treewidth
- Reflections on kernelizing and computing unrooted agreement forests
- Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
- Not all phylogenetic networks are leaf-reconstructible
- Deciding the existence of a cherry-picking sequence is hard on two trees
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees
This page was built for publication: Kernelizations for the hybridization number problem on multiple nonbinary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295644)