Computing a consensus of multilabeled trees

Katharina T. Huber, Vincent Moulton, A Spillner, S Storandt, Radoslaw Suchecki

Research output: Contribution to conferenceOther

9 Citations (Scopus)

Abstract

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
Original languageEnglish
Pages84-92
Number of pages9
Publication statusPublished - 16 Jan 2012
EventMeeting on Algorithm Engineering & Experiments (ALENEX12) - Kyoto, Japan
Duration: 16 Jan 201216 Jan 2012

Conference

ConferenceMeeting on Algorithm Engineering & Experiments (ALENEX12)
CountryJapan
CityKyoto
Period16/01/1216/01/12

Cite this