Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

J. Byrka, P. Gawrychowski, K.T. Huber, S.M. Kelk

Research output: Contribution to journalArticleAcademicpeer-review

20 Citations (Scopus)
1 Downloads (Pure)

Abstract

The study of phylogenetic networks is of great interest to computational evolutionary biology and numerous different types of such structures are known. This article addresses the following question concerning rooted versions of phylogenetic networks. What is the maximum value of p [0,1] such that for every input set T of rooted triplets, there exists some network such that at least p|T| of the triplets are consistent with ? We call an algorithm that computes such a network (where p is maximum) worst-case optimal. Here we prove that the set containing all triplets (the full triplet set) in some sense defines p. Moreover, given a network that obtains a fraction p' for the full triplet set (for any p'), we show how to efficiently modify to obtain a fraction p' for any given triplet set T. We demonstrate the power of this insight by presenting a worst-case optimal result for level-1 phylogenetic networks improving considerably upon the 5/12 fraction obtained recently by Jansson, Nguyen and Sung. For level-2 phylogenetic networks we show that p 0.61. We emphasize that, because we are taking |T| as a (trivial) upper bound on the size of an optimal solution for each specific input T, the results in this article do not exclude the existence of approximation algorithms that achieve approximation ratio better than p. Finally, we note that all the results in this article also apply to weighted triplet sets.
Original languageEnglish
Pages (from-to)65-75
JournalJournal of Discrete Algorithms
Volume8
Issue number1
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks'. Together they form a unique fingerprint.

Cite this