BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3466a4ed-c6d8-4d5e-88b8-a68c7d3fd418
X-WR-CALNAME:[gt.go] - 'TScanwidth and Tree Containment (in phylogenetic ne
 tworks)' par Mathias Weller
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20241027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3466a4ed-c6d8-4d5e-88b8-a68c7d3fd418
DTSTAMP:20260404T083552Z
CLASS:PUBLIC
DESCRIPTION:In computational biology\, phylogenetics is the study of evolut
 ionary histories\, their reconstruction from data\, their comparison\, and
  interaction. While dealing with evolutionary trees is somewhat well under
 stood\, many problems become much harder when reticulate evolution (such a
 s hybridization and lateral gene transfer) is taken into account\, leading
  to so-called phylogenetic networks (rooted acyclic digraphs with leaf-lab
 els). A recently proposed parameter\, measuring how far such a network is 
 from being a tree is called 'scanwidth' and surprising parallels between s
 canwidth and treewidth can be drawn. \n\nThis talk will introduce scanwidt
 h for phylogenetic networks and discuss a fundamental computational proble
 m 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-ca
 lled 'soft polytomies'\, a way of modeling evolutionary histories reconstr
 ucted from uncertain data. \n\n\n[Mathias Weller] (LIGM) \n[ https://www.u
 nravel.rwth-aachen.de/cms/unravel/das-graduiertenkolleg/team/unravel-team/
 ~loqwy/muluk-komal/?lidx=1&allou=1 ] \n[ https://igm.univ-mlv.fr/~mweller/
  | https://igm.univ-mlv.fr/~mweller/ ] \n\nVérifiez que vous êtes bien ins
 crits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/p
 mwiki/pmwiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/pmwi
 ki/pmwiki.php/Equipes/Equipes#membres ] \n\nRemarks / Remarques \n\nFind a
 ll the information of the working group on this [ https://graphesetoptimis
 ation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] . \nRetrouvez
  toutes les informations du GT sur cette [ https://graphesetoptimisation.l
 abri.fr/pmwiki.php/Groupe/GT | page web ] . \n\n\n\nImport automatique dep
 uis https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.ics 
 par sync_icals_to_drupal.py pour GT-GO
DTSTART;TZID=Europe/Paris:20250207T140000
DTEND;TZID=Europe/Paris:20250207T150000
LOCATION:LaBRI/Amphi
SEQUENCE:0
SUMMARY:[gt.go] - 'TScanwidth and Tree Containment (in phylogenetic network
 s)' par Mathias Weller
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
