The following pages link to Reticulation-visible networks (Q281904):
Displaying 18 items.
- Size of a phylogenetic network (Q516840) (← 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)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- When is a phylogenetic network simply an amalgamation of two trees? (Q1990144) (← links)
- Non-essential arcs in phylogenetic networks (Q2136848) (← links)
- Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
- Counting and enumerating galled networks (Q2192120) (← links)
- Counting and enumerating tree-child networks and their subclasses (Q2194860) (← links)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- Phylogenetic networks that are their own fold-ups (Q2280359) (← links)
- Displaying trees across two phylogenetic networks (Q2333792) (← links)
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks (Q2404037) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5116473) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
- Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks (Q6564779) (← links)
