Generation of level-k LGT Networks
Generation of level-k LGT Networks.
Résumé
Phylogenetic networks provide a mathematical model to represent the evolution of a set of species where reticulate evolutionary events have to be taken into account. Among these events, lateral gene transfers need special consideration due to the asymmetry in the roles of the species involved in such an event. To take into account this asymmetry, LGT networks were introduced. Contrarily to the case of phylogenetic trees, the combinatorial structure of phylogenetic networks is much less known and difficult to describe. One of the approaches in the literature is to classify them according to their level and find generators of the given level that can be used to construct networks. In this paper we adapt the concept of generators to the case of LGT networks. We show how these generators, classified by their level, give rise to simple LGT networks of the specified level, and how any LGT network can be obtained from these simple networks, that act as building blocks of the generic structure. We also introduce an stochastic model of evolution that generates LGT networks and use computer simulations using that model in order to investigate the complexity of the generated networks depending on the parameters of the model.
Fichier principal
Pons et al. - 2019 -Generation of level-k LGT Networks.pdf (646.46 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)