Pages that link to "Item:Q1660112"
From MaRDI portal
The following pages link to Solving the tree containment problem for reticulation-visible networks in linear time (Q1660112):
Displaying 7 items.
- Reticulation-visible networks (Q281904) (← links)
- 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)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)