BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:81e930c5-538d-4c11-8774-e0eb59f48f2d
X-WR-CALNAME:[gt.go] - 'Algorithmic Aspects of the Comparison of Phylogenet
 ic Network' par Bertrand Marchand
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:81e930c5-538d-4c11-8774-e0eb59f48f2d
DTSTAMP:20260425T162231Z
CLASS:PUBLIC
DESCRIPTION:Phylogenetic networks are directed graphs used to represent evo
 lutionary histories in the presence of events in which several entities ma
 y combine to form a new one. Their reconstruction based on biological data
  is notoriously hard\, and the problem of comparing networks arises in the
  validation of reconstruction methods. In this talk\, I will present recen
 t developments regarding the comparison of phylogenetic networks through t
 he computation of a maximum common edge-contraction of two input networks.
  I will review links with contraction problems on undirected graphs\, a NP
 -hardness result\, and perspectives for parameterized algorithms. \n\nRefe
 rence: [ https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2
 024.16 ] \n\n[Bertrand Marchand] (University of Sherbrooke) \n[ https://ww
 w.unravel.rwth-aachen.de/cms/unravel/das-graduiertenkolleg/team/unravel-te
 am/~loqwy/muluk-komal/?lidx=1&allou=1 ] \n\nVérifiez que vous êtes bien in
 scrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/
 pmwiki/pmwiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/pmw
 iki/pmwiki.php/Equipes/Equipes#membres ] \n\nRemarks / Remarques \n\nFind 
 all the information of the working group on this [ https://graphesetoptimi
 sation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] . \nRetrouve
 z toutes les informations du GT sur cette [ https://graphesetoptimisation.
 labri.fr/pmwiki.php/Groupe/GT | page web ] . \n\n\n\nImport automatique de
 puis 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:20250214T140000
DTEND;TZID=Europe/Paris:20250214T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Algorithmic Aspects of the Comparison of Phylogenetic Ne
 twork' par Bertrand Marchand
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
