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

Journal of Discrete Algorithms

Volumn 8, Issue 1, 2010, Pages 65-75

  Byrka, Jaroslaw ^a,b   Gawrychowski, Pawel ^c   Huber, Katharina T ^d   Kelk, Steven ^a  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF WROC AW   (Poland)

^d UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

Level k network; Phylogenetic network; Triplet

Indexed keywords

APPROXIMATION RATIOS; COMPUTATIONAL EVOLUTIONARY BIOLOGY; INPUT SET; LEVEL-1; LEVEL-K NETWORK; MAXIMUM VALUES; OPTIMAL APPROXIMATION; OPTIMAL RESULTS; OPTIMAL SOLUTIONS; PHYLOGENETIC NETWORK; PHYLOGENETIC NETWORKS; ROOTED TRIPLETS; TRIPLET; UPPER BOUND;

BIOLOGY; COMPUTATIONAL EFFICIENCY; OPTIMIZATION; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 70350543734     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2009.01.004     Document Type: Article

References (28)

1. Aho A.V., Sagiv Y., Szymanski T.G., and Ullman J.D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing 10 3 (1981) 405-421
2. Baroni M., Semple C., and Steel M. A framework for representing reticulate evolution. Annals of Combinatorics 8 4 (2004) 391-408
3. Bininda-Emonds O. Phylogenetic supertrees: Combining information to reveal the tree of life. Computational Biology Series vol. 4 (2004), Kluwer
4. D. Bryant, Building trees, hunting for trees, and comparing trees: Theory and methods in phylogenetic analysis, Ph.D. thesis, University of Canterbury, Christchurch, New Zealand, 1997
5. Byrka J., Gawrychowski P., Huber K.T., and Kelk S. Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (February 2008). arXiv:0710.3258v3 [q-bio.PE]
6. Cardona G., Rossello F., and Valiente G. Tripartitions do not always discriminate phylogenetic networks (2007). arXiv:0707.2376v1 [q-bio.PE]
7. Cassens I., Mardulyn P., and Milinkovitch M.C. Evaluating intraspecific "network" construction methods using simulated sequence data: Do existing algorithms outperform the global maximum parsimony approach?. Systematic Biology 54 (2005) 363-372
8. Doolittle W.F. Phylogenetic classification and the universal tree. Nature 284 (1999) 2124-2128
9. Ga̧sieniec L., Jansson J., Lingas A., and Östlin A. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization 3 (1999) 183-197
10. J. Håstad, Some optimal approximability results, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1997, pp. 1-10
11. Huber K.T., and Moulton V. Phylogenetic networks. In: Gascuel O. (Ed). Mathematics of Evolution and Phylogeny (2005), Oxford University Press
12. Huson D.H., and Bryant D. Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution 23 2 (2006) 254-267
13. He Y., Huynh T., Jansson J., and Sung W. Inferring phylogenetic relationships avoiding forbidden rooted triplets. Journal of Bioinformatics and Computational Biology 4 1 (2006) 59-74
14. van Iersel L., Keijsper J., Kelk S., and Stougie L. Constructing level-2 phylogenetic networks from triplets (2007). arXiv:0707.2890v1 [q-bio.PE]
15. Jansson J. On the complexity of inferring rooted evolutionary trees. Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001). Electron. Notes Discrete Math. vol. 7 (2001), Elsevier 121-125
16. Jansson J., Nguyen N., and Sung W. Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM Journal on Computing 35 5 (2006) 1098-1121
17. Jansson J., and Sung W. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theoretical Computer Science 363 (2006) 60-68
18. Kunin V., Goldovsky L., Darzentas N., and Ouzounis C.A. The net of life: Reconstructing the microbial phylogenetic network. Genome Research 15 (2005) 954-959
19. Linder C.R., and Rieseberg L.H. Reconstructing patterns of reticulate evolution in plants. American Journal of Botany 91 (2004) 1700-1708
20. Martin W. Mosaic bacterial chromosomes: A challenge on route to a tree of genomes. BioEssays 21 (1999) 99-104
21. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, New York
22. Nakhleh L., Sun J., Warnow T., Linder C.R., Moret B.M.E., and Tholse A. Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. Pacific Symposium on Biocomputing 8 (2003) 315-326
23. A. Newman, S. Vempala, Fences are futile: On relaxations for the linear ordering problem, in: Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization, in: LNCS, vol. 2081, 2001, pp. 333-347
24. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43 (1991) 425-440
25. Rivera M.C., and Lake J.A. The ring of life provides evidence for a genome fusion origin of eukaryotes. Nature 43 (2004) 152-155
26. Semple C., and Steel M. Phylogenetics (2003), Oxford University Press
27. Wu B. Constructing the maximum consensus tree from rooted triples. Journal of Combinatorial Optimization 8 (2004) 29-39
28. http://homepages.cwi.nl/~kelk/tripletverify/