On Turning A Graph Into A Phylogenetic Network - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

On Turning A Graph Into A Phylogenetic Network

Résumé

Phylogenetic networks, both rooted and unrooted, are a versatile and invaluable tool for microbiological research. One of the many open theoretical questions sourrounding such networks is when it is possible to orient the edges of a given unrooted network into a valid rooted network, that is, a network in which all non-root nodes have in-degree one (corresponding to a speciation event) or out-degree one (corresponding to a hybridization event). We give a characterization based on the degree of the input graph, showing that graphs of maximum degree three can be oriented in linear time while orienting graphs that may contain degree-five nodes is NP-complete.
Fichier principal
Vignette du fichier
orient.pdf (415.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04085424 , version 1 (28-04-2023)

Identifiants

  • HAL Id : hal-04085424 , version 1

Citer

Laurent Bulteau, Mathias Weller, Louxin Zhang. On Turning A Graph Into A Phylogenetic Network. 2023. ⟨hal-04085424⟩
231 Consultations
134 Téléchargements

Partager

Gmail Facebook X LinkedIn More