Pages that link to "Item:Q729819"

The following pages link to A decomposition theorem and two algorithms for reticulation-visible networks (Q729819):

Displaying 11 items.

• Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
• When is a phylogenetic network simply an amalgamation of two trees? (Q1990144) (← links)
• The Sackin index of simplex networks (Q2163945) (← 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)
• Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
• Tree Containment With Soft Polytomies (Q5084686) (← links)
• (Q5116473) (← links)