Print Email Facebook Twitter Encoding undirected and semi-directed binary phylogenetic networks by quarnets Title Encoding undirected and semi-directed binary phylogenetic networks by quarnets Author Nipius, Leonie (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor van Iersel, L.J.J. (mentor) Murakami, Yukihiro (graduation committee) Nane, G.F. (graduation committee) Degree granting institution Delft University of Technology Programme Applied Mathematics Date 2022-07-07 Abstract Phylogenetic networks generalize evolutionary trees and are commonly used to represent evolutionary relationships between species that undergo reticulate evolutionary processes such as hybridization, recombination and lateral gene transfer. In this thesis all quarnets, networks on four species, of a network are assumed to be known. We prove that each recoverable undirected or semi-directed binary level-2 phylogenetic network without redundant biconnected components is encoded by its set of quarnets, meaning that the network is uniquely determined by its quarnets. Furthermore, two decomposition theorems for undirected and semi-directed binary phylogenetic networks are presented. These decomposition theorems are proved for undirected binary phylogenetic networks for all levels and for semi-directed binary phylogenetic networks that are at most level-2. Subject Phylogenetic networkUndirectedSemi-directedEncodingQuarnetDecomposition To reference this document use: http://resolver.tudelft.nl/uuid:eaeb4293-6349-4d6e-ab53-94b781fc65e1 Part of collection Student theses Document type master thesis Rights © 2022 Leonie Nipius Files PDF Encoding_undirected_and_s ... s_2022.pdf 608.01 KB Close viewer /islandora/object/uuid:eaeb4293-6349-4d6e-ab53-94b781fc65e1/datastream/OBJ/view