Pages that link to "Item:Q2862211"
From MaRDI portal
The following pages link to Counting Trees in a Phylogenetic Network Is \#P-Complete (Q2862211):
Displaying 8 items.
- Phylogenetic networks that display a tree twice (Q486637) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Tree-based networks: characterisations, metrics, and support trees (Q1731941) (← links)
- Non-essential arcs in phylogenetic networks (Q2136848) (← links)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks (Q5163512) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
- Counting General Phylogenetic networks (Q5863475) (← links)
