Algorithms for processing multi-labeled trees

In evolutionary studies, multi-labeled trees occur, for example, when different paralogs of the same gene, or when multiple representatives
of the same species are present. A number of different algorithms have been proposed for reconciling a  multi-labeled into a singly-labeled network.
The aim of this thesis is to survey the existing methods,
to implement them as part of the SplitsTree and Dendroscope programs and then to compare their performance.

This thesis will be supervised by the Huson lab (Uni Tuebingen)

Please contact: Regula Rupp or Daniel Huson