The following pages link to Counting phylogenetic networks (Q2343474):
Displaying 36 items.
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Transforming phylogenetic networks: moving beyond tree space (Q307586) (← links)
- Phylogenetic networks that display a tree twice (Q486637) (← links)
- Size of a phylogenetic network (Q516840) (← links)
- On the information content of discrete phylogenetic characters (Q667690) (← links)
- Recovering normal networks from shortest inter-taxa distance information (Q667692) (← links)
- A unifying characterization of tree-based networks and orchard networks using cherry covers (Q2040997) (← links)
- Asymptotic enumeration and distributional properties of galled networks (Q2120821) (← links)
- Non-essential arcs in phylogenetic networks (Q2136848) (← links)
- On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks (Q2143143) (← links)
- Bijections for ranked tree-child networks (Q2144491) (← links)
- The Sackin index of simplex networks (Q2163945) (← links)
- Counting phylogenetic networks with few reticulation vertices: a second approach (Q2166221) (← links)
- Counting and enumerating galled networks (Q2192120) (← links)
- Counting and enumerating tree-child networks and their subclasses (Q2194860) (← links)
- Caterpillars on three and four leaves are sufficient to binary normal networks (Q2204868) (← links)
- Counting phylogenetic networks of level 1 and 2 (Q2219260) (← links)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- On the asymptotic growth of the number of tree-child networks (Q2225459) (← links)
- Trinets encode orchard phylogenetic networks (Q2232132) (← links)
- Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
- Displaying trees across two phylogenetic networks (Q2333792) (← links)
- Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution? (Q2343794) (← links)
- On the quirks of maximum parsimony and likelihood on phylogenetic networks (Q2399624) (← links)
- The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
- The hybrid number of a ploidy profile (Q2673882) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← links)
- The SNPR neighbourhood of tree-child networks (Q4585061) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
- Counting General Phylogenetic networks (Q5863475) (← links)
- A branching process approach to level‐<i>k</i> phylogenetic networks (Q6052469) (← links)
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
- Exploring spaces of semi-directed level-1 networks (Q6057997) (← links)
- Combinatorial and stochastic properties of ranked tree‐child networks (Q6074698) (← links)
- Limit theorems for patterns in ranked tree‐child networks (Q6144574) (← links)
- Enumerative and distributional results for \(d\)-combining tree-child networks (Q6499442) (← links)
