Counting phylogenetic networks
Type of content
Journal Article
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury. Mathematics and Statistics
Journal Title
Journal ISSN
Volume Title
Language
Date
2015
Authors
McDiarmid, C.
Semple, C.
Welsh, D.
Abstract
We give approximate counting formulae for the numbers of labelled general, treechild, and normal (binary) phylogenetic networks on n vertices. These formulae are of the form 2 γnlogn+O(n) , where the constant γ is 32 for general networks, and 54 for tree-child and normal networks. We also show that the number of leaf-labelled tree-child and normal networks with ℓ leaves are both 2 2ℓlogℓ+O(ℓ) . Further we determine the typical numbers of leaves, tree vertices, and reticulation vertices for each of these classes of networks.
Description
Citation
McDiarmid, C., Semple, C., Welsh, D. (2015) Counting phylogenetic networks. Annals of Combinatorics, 19(1), pp. 205-224.
Keywords
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Fields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics