Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2017.28
URN: urn:nbn:de:0030-drops-73284
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7328/
Lafond, Manuel ; Scornavacca, Celine
On the Weighted Quartet Consensus Problem
| pdf-format: |
|
Abstract
In phylogenetics, the consensus problem consists in summarizing a set of phylogenetic trees that all classify the same set of species into a single tree. Several definitions of consensus exist in the literature; in this paper we focus on the Weighted Quartet Consensus problem, a problem with unknown complexity status so far. Here we prove that the Weighted Quartet Consensus problem is NP-hard and we give a 1/2-factor approximation for this problem. During the process, we propose a derandomization procedure of a previously known randomized 1/3-factor approximation. We also investigate the fixed-parameter tractability of this problem.
BibTeX - Entry
@InProceedings{lafond_et_al:LIPIcs:2017:7328,
author = {Manuel Lafond and Celine Scornavacca},
title = {{On the Weighted Quartet Consensus Problem}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7328},
URN = {urn:nbn:de:0030-drops-73284},
doi = {10.4230/LIPIcs.CPM.2017.28},
annote = {Keywords: phylogenetic tree, consensus tree, quartets, complexity, fixed-parameter tractability}
}
| Keywords: | phylogenetic tree, consensus tree, quartets, complexity, fixed-parameter tractability | |
| Seminar: | 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 30.06.2017 |
