Encoding phylogenetic trees with weighted quartets
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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.