14:00
15:00

In computational biology, phylogenetics is the study of evolutionary histories, their reconstruction from data, their comparison, and interaction. While dealing with evolutionary trees is somewhat well understood, many problems become much harder when reticulate evolution (such as hybridization and lateral gene transfer) is taken into account, leading to so-called phylogenetic networks (rooted acyclic digraphs with leaf-labels). A recently proposed parameter, measuring how far such a network is from being a tree is called "scanwidth" and surprising parallels between scanwidth and treewidth can be drawn.

This talk will introduce scanwidth for phylogenetic networks and discuss a fundamental computational problem called "TreeContainment", asking whether a given network is "compatible" with a given tree. We then present an algorithm solving this problem in O*(sw^sw) time, where sw is the scanwidth of the input network. If there is time, we can talk about a version of TreeContainment that allows so-called "soft polytomies", a way of modeling evolutionary histories reconstructed from uncertain data.

[Mathias Weller] (LIGM)
[ https://www.unravel.rwth-aachen.de/cms/unravel/das-graduiertenkolleg/te… ]
[ https://igm.univ-mlv.fr/~mweller/ | https://igm.univ-mlv.fr/~mweller/ ]

Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres ]

Remarks / Remarques

Find all the information of the working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] .
Retrouvez toutes les informations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] .

LaBRI/Amphi