Quartets and unrooted phylogenetic networks

Duration: 19 mins 41 secs

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/1150842/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Gambette, P (la Méditerranée (Aix-Marseille II)) Tuesday 21 June 2011, 10:00-10:20

Created:

2011-06-23 17:15

Collection:

Phylogenetics

Publisher:

Isaac Newton Institute

Gambette, P

Language:

eng (English)

Credits:

Author:	Gambette, P
Director:	Steve Greenham


Abstract:	Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract networks to visualize conﬂicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogenetic networks (whose nodes can be interpreted as biological events) from triplet data. In this presentation, we link abstract and explicit networks through their combinatorial properties, by introducing the unrooted analogue of level-k networks. In particular, we give an equivalence theorem between circular split systems and unrooted level-1 networks. We also show how to adapt to quartets some existing results on triplets, in order to reconstruct unrooted level-k phylogenetic networks. These results give an interesting perspective on the combinatorics of phylogenetic networks and also raise algorithmic and combinatorial questions.

Abstract:

Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract networks to visualize conﬂicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogenetic networks (whose nodes can be interpreted as biological events) from triplet data.

In this presentation, we link abstract and explicit networks through their combinatorial properties, by introducing the unrooted analogue of level-k networks. In particular, we give an equivalence theorem between circular split systems and unrooted level-1 networks. We also show how to adapt to quartets some existing results on triplets, in order to reconstruct unrooted level-k phylogenetic networks. These results give an interesting perspective on the combinatorics of phylogenetic networks and also raise algorithmic and combinatorial questions.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.84 Mbits/sec	273.03 MB	View	Download
WebM	640x360	626.7 kbits/sec	90.12 MB	View	Download
Flash Video	484x272	569.12 kbits/sec	82.05 MB	View	Download
iPod Video	480x270	506.6 kbits/sec	73.03 MB	View	Download
MP3	44100 Hz	125.1 kbits/sec	17.84 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)