BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Tanglegrams for Rooted Phylogenetic Trees and Networks - Scornavac
 ca\, C (Tbingen)
DTSTART:20110621T103000Z
DTEND:20110621T105000Z
UID:TALK31807@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In systematic biology\, one is often faced with the task of co
 mparing different phylogenetic trees\, in particular in multi- gene analys
 is or cospeciation studies. One approach is to use a tanglegram in which t
 wo rooted phylogenetic trees are drawn opposite each other\, using auxilia
 ry lines to connect matching taxa. There is an increasing interest in usin
 g rooted phylogenetic networks to represent evolutionary history\, so as t
 o explicitly represent reticulate events\, such as horizontal gene transfe
 r\, hybridization or reassortment. Thus\, the question arises how to defin
 e and compute a tanglegram for such networks. \n\nHere we present the firs
 t formal definition of a tanglegram for rooted phylogenetic networks and p
 resent a heuristic approach for computing one. We compare the performance 
 of our method with existing tree tanglegram algorithms and also show a typ
 ical application to real biological data sets. For maximum usability\, the
  algorithm does not require that the trees or networks are bifurcating or 
 bicombining\, or that they are on identical taxon sets. The algorithm is i
 mplemented in our program Dendroscope 3\, which is freely available from w
 ww.dendroscope. org.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR