Pages that link to "Item:Q2798232"
From MaRDI portal
The following pages link to Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232):
Displaying 6 items.
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
- Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
- On cherry-picking and network containment (Q2219064) (← links)
- Linear Time Algorithm for Tree-Child Network Containment (Q5041129) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
