Computing a consensus of multilabeled trees

Huber, Katharina T., Moulton, Vincent ORCID:, Spillner, A, Storandt, S and Suchecki, Radoslaw (2012) Computing a consensus of multilabeled trees. In: Meeting on Algorithm Engineering & Experiments (ALENEX12), 2012-01-16 - 2012-01-16.

Full text not available from this repository. (Request a copy)


In this paper we consider two challenging problems that arise in the context of computing a consensus of a collection of multilabeled trees, namely (1) selecting a compatible collection of clusters on a multiset from an ordered list of such clusters and (2) optimally refining high degree vertices in a multilabeled tree. Forming such a consensus is part of an approach to reconstruct the evolutionary history of a set of species for which events such as genome duplication and hybridization have occurred in the past. We present exact algorithms for solving (1) and (2) that have an exponential run- time in the worst case. To give some impression of their performance in practice, we apply them to simulated input and to a real biological data set highlighting the impact of several structural properties of the input on the performance

Item Type: Conference or Workshop Item (Other)
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Rhiannon Harvey
Date Deposited: 01 Feb 2012 09:13
Last Modified: 24 Oct 2022 23:41

Actions (login required)

View Item View Item