BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:From evolutionary trees to networks and back again - Mike Steel (U
 niversity of Canterbury\, New Zealand)
DTSTART;VALUE=DATE-TIME:20190614T140000
DTEND;VALUE=DATE-TIME:20190614T150000
UID:https://talks.ox.ac.uk/talks/id/7c15e755-6a7c-4ccc-89b1-c06226f1b169/
DESCRIPTION:Phylogenetic networks can provide a more complete description 
 of evolutionary history than trees\, by allowing reticulate events such as
  hybridization and lateral gene transfer.  In the first part of this talk\
 , we explore the question: ‘when is a phylogenetic network merely a tree
  with additional links between its edges?’ It turns out that the class o
 f ‘tree-based’ networks can be efficiently characterized.  More recent
  results on this question have followed\, motivated by Dilworth’s theore
 m (for posets)\, and matching theory in bipartite graphs.  This allows for
  fast algorithms to determine when a network is tree-based and\, if not\, 
 to calculate how ‘close’ to tree-based it is.  In the second part of t
 he talk\, we model lateral gene transfer by a simple stochastic process on
  trees. By connecting this process to a simple random walk on a graph it i
 s possible to analyze the extent to which an underlying species tree T can
  be inferred from sampled gene trees that have undergone random transfers 
 on T. \nSpeakers:\nMike Steel (University of Canterbury\, New Zealand)
LOCATION:24-29 St Giles' (Large Lecture Theatre (LG.01))\, 24-29 St Giles'
  OX1 3LB
TZID:Europe/London
URL:https://talks.ox.ac.uk/talks/id/7c15e755-6a7c-4ccc-89b1-c06226f1b169/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:From evolutionary trees to networks and back again - Mike
  Steel (University of Canterbury\, New Zealand)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR