New results on optimizing rooted triplets consistency

Discrete Applied Mathematics

Volumn 158, Issue 11, 2010, Pages 1136-1147

  Byrka, Jaroslaw ^a,b   Guillemot, Sylvain ^c   Jansson, Jesper ^d  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c Université de Marne la Vallée   (France)

^d OCHANOMIZU UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Hardness of approximation; Phylogenetic tree; Pseudorandomness; Rooted triplet; Supertree

Indexed keywords

HARDNESS OF APPROXIMATION; PHYLOGENETIC TREES; PSEUDORANDOMNESS; ROOTED TRIPLETS; SUPERTREE;

APPROXIMATION ALGORITHMS; HARDNESS; MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION;

TREES (MATHEMATICS);

EID: 77951296610     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.03.004     Document Type: Article

References (40)

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 (1981) 405-421
2. Ailon N., and Alon N. Hardness of fully dense problems. Information and Computation 205 (2007) 1117-1129
3. Alon N. Ranking tournaments. SIAM Journal on Discrete Mathematics 20 (2006) 137-142
4. Alon N., Moshkovitz D., and Safra S. Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2 (2006) 153-177
5. Berry V., and Nicolas F. Maximum agreement and compatible supertrees. Journal of Discrete Algorithms 5 (2007) 564-591
6. 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.
7. Byrka J., Gawrychowski P., Huber K.T., and Kelk S. Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. Journal of Discrete Algorithms 8 (2010) 65-75
8. Chor B., Hendy M., and Penny D. Analytic solutions for three taxon ML trees with variable rates across sites. Discrete Applied Mathematics 155 (2007) 750-758
9. Downey R., and Fellows M. Parameterized Complexity (1999), Springer-Verlag
10. Felsenstein J. Inferring Phylogenies (2004), Sinauer Associates, Inc.
11. Garey M., and Johnson D. Computers and Intractability-A Guide to the Theory of NP-Completeness (1979), W. H. Freeman and Company, New York
12. Ga{ogonek}sieniec L., Jansson J., Lingas A., and Östlin A. Inferring ordered trees from local constraints. Proceedings of Computing: the 4th Australasian Theory Symposium. CATS'98. Australian Computer Science Communications vol. 20(3) (1998), Springer-Verlag, Singapore 67-76
13. Ga{ogonek}sieniec L., Jansson J., Lingas A., and Östlin A. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization 3 (1999) 183-197
14. Guillemot S., and Berry V. Fixed-parameter tractability of the maximum agreement supertree problem. Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching. CPM 2007. LNCS vol. 4580 (2007), Springer-Verlag 274-285
15. Guillemot S., Jansson J., and Sung W.-K. Computing a smallest multi-labeled phylogenetic tree from rooted triplets. Proceedings of the 20th Annual International Symposium on Algorithms and Computation. ISAAC 2009. LNCS vol. 5878 (2009), Springer-Verlag 1205-1214
16. He Y.J., Huynh T.N.D., Jansson J., and Sung W.-K. Inferring phylogenetic relationships avoiding forbidden rooted triplets. Journal of Bioinformatics and Computational Biology 4 (2006) 59-74
17. Henzinger M.R., King V., and Warnow T. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24 (1999) 1-13
18. Holm J., de Lichtenberg K., and Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM 48 (2001) 723-760
19. Jansson J. On the complexity of inferring rooted evolutionary trees. Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics. GRACO 2001. Electronic Notes in Discrete Mathematics vol. 7 (2001), Elsevier 121-125
20. J. Jansson, Consensus algorithms for trees and strings, Ph.D. Thesis, Lund Institute of Technology, Lund University, Lund, Sweden, 2003.
21. J. Jansson, A. Lingas, E.-M. Lundell, A triplet approach to approximations of evolutionary trees, Poster H15 presented at RECOMB 2004, 2004.
22. Jansson J., Ng J.H.-K., Sadakane K., and Sung W.-K. Rooted maximum agreement supertrees. Algorithmica 43 (2005) 293-307
23. Jansson J., Nguyen N.B., and Sung W.-K. Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM Journal on Computing 35 (2006) 1098-1121
24. Jansson J., and Sung W.-K. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theoretical Computer Science 363 (2006) 60-68
25. Jiang T., Kearney P., and Li M. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM Journal on Computing 30 (2001) 1942-1961
26. Kannan S., Lawler E., and Warnow T. Determining the evolutionary tree using experiments. Journal of Algorithms 21 (1996) 26-50
27. Kearney P. Phylogenetics and the quartet method. In: Jiang T., Xu Y., and Zhang M.Q. (Eds). Current Topics in Computational Molecular Biology (2002), The MIT Press, Massachusetts 111-133
28. Ng M.P., and Wormald N.C. Reconstruction of rooted trees from subtrees. Discrete Applied Mathematics 69 (1996) 19-31
29. Page R.D.M. Modified mincut supertrees. Proceedings of the 2nd Workshop on Algorithms in Bioinformatics. WABI 2002. LNCS vol. 2452 (2002), Springer-Verlag 537-552
30. Raz R., and Safra S. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. Proceedings of the 29th Annual ACM Symposium on the Theory of Computing. STOC'97 (1997), ACM 475-484
31. Semple C., and Steel M. A supertree method for rooted trees. Discrete Applied Mathematics 105 (2000) 147-158
32. Snir S., and Rao S. Using max cut to enhance rooted trees consistency. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 (2006) 323-333
33. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9 (1992) 91-116
34. Steel M., Dress A.W.M., and Böcker S. Simple but fundamental limitations on supertree and consensus tree methods. Systematic Biology 49 (2000) 363-368
35. To T.-H., and Habib M. Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time. Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching. CPM 2009. LNCS vol. 5577 (2009), Springer-Verlag 275-288
36. van Iersel L., Keijsper J., Kelk S., Stougie L., Hagen F., and Boekhout T. Constructing level-2 phylogenetic networks from triplets. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6 (2009) 667-681
37. van Iersel L., Kelk S., and Mnich M. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks. Journal of Bioinformatics and Computational Biology 7 (2009) 597-623
38. Wu B.Y. Constructing the maximum consensus tree from rooted triples. Journal of Combinatorial Optimization 8 (2004) 29-39
39. Wu B.Y. Constructing evolutionary trees from rooted triplets. Journal of Information Science and Engineering 20 (2004) 181-190
40. Zuckerman D. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3 (2007) 103-128