Skip to search boxSkip to navigationSkip to main content

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

  • J. Byrka
    ,
  • P. Gawrychowski
    ,
  • K.T. Huber
    ,
  • S.M. Kelk
Output:
Contribution to journal
Article
Academic
Peer-review

Open access

Information

Output type

Output:
Contribution to journal
Article
Academic
Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 65-75

Journal (Volume, Issue Number)

Journal of Discrete Algorithms (Volume 8, Issue 1)

Publication milestones

  • Published - 2010

Publication status

Published - 2010

ISSN

1570-8667

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.

Metrics

Metrics

Scopus
citations
22
SciVal
citations
22
Download statistics
Download count
19
SciVal
FWCI
1.80
SciVal
Author count
4
SciVal
Paper percentile
84

PlumX, opens in new tab

Captures
9
Citation count
23