The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Encoding phylogenetic trees with weighted quartets

Moulton, V (East Anglia)
Tuesday 18 December 2007, 14:20-14:40

Seminar Room 1, Newton Institute


Various methods have been proposed for constructing phylogenetic trees (and networks) that work by trying to piece together quartet trees, i.e. phylogenetic trees with four leaves. Hence, it is of interest to characterise when a collection of quartet trees corresponds to a (unique) phylogenetic tree. Recently, Dress and Erdos provided such a characterisation for binary phylogenetic trees, that is, phylogenetic trees all of whose internal vertices have degree 3. Here we provide a new characterisation for arbitrary phylogenetic trees - or, equivalently, compatible split systems - and discuss some extensions of this result to more general split systems.

This is joint work with Stefan Gruenewald, Katharina Huber, Charles Semple and Andreas Spillner.




The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧