Title: | Combinatorial properties of phylogenetic networks | Language: | English | Authors: | Mansouri, Marefatollah | Qualification level: | Doctoral | Keywords: | phylogenetic networks; asymptotic enumeration; limiting distributions | Advisor: | Gittenberger, Bernhard | Issue Date: | 2020 | Number of Pages: | 162 | Qualification level: | Doctoral | Abstract: | 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. |
URI: | https://doi.org/10.34726/hss.2020.75903 http://hdl.handle.net/20.500.12708/14963 |
DOI: | 10.34726/hss.2020.75903 | Library ID: | AC15670835 | Organisation: | E104 - Institut für Diskrete Mathematik und Geometrie | Publication Type: | Thesis Hochschulschrift |
Appears in Collections: | Thesis |
Files in this item:
File | Description | Size | Format | |
---|---|---|---|---|
Combinatorial properties of phylogenetic networks.pdf | 2.84 MB | Adobe PDF | ![]() View/Open |
Page view(s)
22
checked on Feb 21, 2021
Download(s)
34
checked on Feb 21, 2021

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