Pages that link to "Item:Q476442"
From MaRDI portal
The following pages link to Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442):
Displaying 10 items.
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Hybridization Number on Three Rooted Binary Trees is EPT (Q2818206) (← links)
- Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← 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)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
