Counting phylogenetic networks

DOI10.1007/s00026-015-0260-2zbMath1310.05120OpenAlexW2061017441MaRDI QIDQ2343474

Charles Semple, Dominic J. A. Welsh, Colin J. H. McDiarmid

Publication date: 5 May 2015

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-015-0260-2

zbMATH Keywords

phylogenetic networkstree-child networksnormal networks

Mathematics Subject Classification ID

Problems related to evolution (92D15) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (35)

Asymptotic enumeration and distributional properties of galled networks ⋮ Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ Non-essential arcs in phylogenetic networks ⋮ Transforming phylogenetic networks: moving beyond tree space ⋮ On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks ⋮ Bijections for ranked tree-child networks ⋮ The Sackin index of simplex networks ⋮ Counting General Phylogenetic networks ⋮ Counting phylogenetic networks with few reticulation vertices: a second approach ⋮ On the quirks of maximum parsimony and likelihood on phylogenetic networks ⋮ The rigid hybrid number for two phylogenetic trees ⋮ The SNPR neighbourhood of tree-child networks ⋮ The hybrid number of a ploidy profile ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Exploring spaces of semi-directed level-1 networks ⋮ Combinatorial and stochastic properties of ranked tree‐child networks ⋮ Counting and enumerating galled networks ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Limit theorems for patterns in ranked tree‐child networks ⋮ Caterpillars on three and four leaves are sufficient to binary normal networks ⋮ A QUBO formulation for the tree containment problem ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ Display sets of normal and tree-child networks ⋮ On the asymptotic growth of the number of tree-child networks ⋮ Phylogenetic networks that display a tree twice ⋮ Trinets encode orchard phylogenetic networks ⋮ On the information content of discrete phylogenetic characters ⋮ Recovering normal networks from shortest inter-taxa distance information ⋮ Size of a phylogenetic network ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ A unifying characterization of tree-based networks and orchard networks using cherry covers ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ Displaying trees across two phylogenetic networks ⋮ Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average height of binary trees and other simple trees
• Properties of normal phylogenetic networks
• Unique determination of some homoplasies at hybridization events
• Isomorphism and Symmetries in Random Phylogenetic Trees
• On the shape of a random acyclic digraph
• Almost all cubic graphs are Hamiltonian

This page was built for publication: Counting phylogenetic networks