Title: Combinatorial properties of phylogenetic networks
Language: English
Authors: Mansouri, Marefatollah 
Qualification level: Doctoral
Advisor: Gittenberger, Bernhard 
Issue Date: 2020
Number of Pages: 162
Qualification level: Doctoral
This thesis is concerned with combinatorial properties of some subclasses of rooted and unrooted phylogenetic networks. We consider several phylogenetic networks and provide enumeration formulas (exact and asymptotic) for them with a given number of leaves and also analyze some of their characterizing parameters. We extend the work of Semple and Steel to rooted and unrooted level 2 networks and can show with generating functions that the studied parameters are asymptotically normally distributed. Furthermore, tree-child and normal networks are treated. Asymptotic and exact formulas are derived, which solves some open problems listed in the literature. Finally, we extend the investigation to general networks.
Keywords: phylogenetic networks; asymptotic enumeration; limiting distributions
URI: https://doi.org/10.34726/hss.2020.75903
DOI: 10.34726/hss.2020.75903
Library ID: AC15670835
Organisation: E104 - Institut für Diskrete Mathematik und Geometrie 
Publication Type: Thesis
Appears in Collections:Thesis

Files in this item:

Page view(s)

checked on May 11, 2021


checked on May 11, 2021

Google ScholarTM


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.