Constructing level-2 phylogenetic trees from triplets

46 mins 43 secs,  290.25 MB,  QuickTime  384x288,  25.0 fps,  44100 Hz,  848.28 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Stougie, L (Tu Eindhoven and CWI Amsterdam)
Tuesday 20 November 2007, 14:00-15:00
 
Created: 2007-12-10 11:15
Collection: Phylogenetics
Publisher: Isaac Newton Institute
Copyright: Stougie, L
Language: eng (English)
Distribution: World     (downloadable)
Credits:
Author:  Stougie, L
Explicit content: No
Aspect Ratio: 4:3
Screencast: No
Bumper: /sms-ingest/static/new-4x3-bumper.dv
Trailer: /sms-ingest/static/new-4x3-trailer.dv
 
Abstract: Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of species), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so to construct such a network. Here we extend this work by showing that this problem is even polynomial-time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily non-tree like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We implemented the algorithm and applied it to yeast data.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 644.46 MB View Download
WebM 480x360    661.36 kbits/sec 225.89 MB View Download
Flash Video 480x360    804.74 kbits/sec 275.35 MB View Download
iPod Video 480x360    505.28 kbits/sec 172.89 MB View Download
QuickTime * 384x288    848.28 kbits/sec 290.25 MB View Download
MP3 44100 Hz 125.0 kbits/sec 42.56 MB Listen Download
Windows Media Video 477.09 kbits/sec 163.24 MB View Download
Auto (Allows browser to choose a format it supports)