Pages that link to "Item:Q2814579"
From MaRDI portal
The following pages link to Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579):
Displaying 11 items.
- Reticulation-visible networks (Q281904) (← links)
- 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)
- Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← 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)
- Phylogenetic networks that are their own fold-ups (Q2280359) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5116473) (← links)
