Computing a consensus of multilabeled trees
| dc.contributor.author | Huber, K. | |
| dc.contributor.author | Moulton, V. | |
| dc.contributor.author | Spillner, A. | |
| dc.contributor.author | Suchecki, R. | |
| dc.contributor.conference | 14th Meeting on Algorithm Engineering and Experiments 2012 (ALENEX12) (16 Jan 2012 - 16 Jan 2012 : Kyoto, Japan) | |
| dc.contributor.editor | Bader, D.A. | |
| dc.contributor.editor | Mutzel, P. | |
| dc.date.issued | 2012 | |
| dc.description.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 runtime 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. Copyright © SIAM. | |
| dc.description.statementofresponsibility | Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt and Radoslaw Suchecki | |
| dc.identifier.citation | Proceedings of the Workshop on Algorithm Engineering and Experiments, 2012 / Bader, D.A., Mutzel, P. (ed./s), pp.84-92 | |
| dc.identifier.doi | 10.1137/1.9781611972924.9 | |
| dc.identifier.isbn | 9781618396242 | |
| dc.identifier.issn | 2164-0300 | |
| dc.identifier.orcid | Suchecki, R. [0000-0003-4992-9497] | |
| dc.identifier.uri | http://hdl.handle.net/2440/85204 | |
| dc.language.iso | en | |
| dc.publisher | Society for Industrial and Applied Mathematics | |
| dc.rights | Copyright status unknown | |
| dc.source.uri | http://dx.doi.org/10.1137/1.9781611972924.9 | |
| dc.title | Computing a consensus of multilabeled trees | |
| dc.type | Conference paper | |
| pubs.publication-status | Published |