Computing a smallest multi-labeled phylogenetic tree from rooted triplets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 1205-1214

  Guillemot, Sylvain ^a   Jansson, Jesper ^b   Sung, Wing Kin ^c,d  

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

^b OCHANOMIZU UNIVERSITY   (Japan)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; COMBINATORIAL PROBLEM; EXACT ALGORITHMS; INPUT SET; MINIMIZATION PROBLEMS; NP-HARD; PHYLOGENETIC TREES; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; ROOTED TRIPLETS; RUNNING-IN;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 75649108941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_121     Document Type: Conference Paper

References (13)

1. Aho, A.V., Sagiv, Y., Szymanski, T.G., 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), 405-421 (1981)
2. Brown, G.K., Nelson, G., Ladiges, P.Y.: Historical biogeography of Rhododendron section Vireya and the Malesian Archipelago. Journal of Biogeography 33, 1929-1944 (2006)
3. Byrka, J., Guillemot, S., Jansson, J.: New results on optimizing rooted triplets consistency. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 484-495. Springer, Heidelberg (2008)
4. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem (Article 21). Journal of the ACM 55(5) (2008)
5. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Journal of Computer and System Sciences 57(2), 187-199 (1998)
6. Fellows, M., Hallett, M., Stege, U.: Analogs & duals of the MAST problem for sequences & trees. Journal of Algorithms 49(1), 192-216 (2003)
7. Garey, M., Johnson, D.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
8. Huber, K.T., Oxelman, B., Lott, M., Moulton, V.: Reconstructing the evolutionary history of polyploids from multilabeled trees. Molecular Biology and Evolution 23(9), 1784-1791 (2006)
9. Neumann-Lara, V.: The dichromatic number of a digraph. Journal of Combinatorial Theory, Series B 33(3), 265-270 (1982)
10. Page, R.D.M., Charleston, M.A.: Trees within trees: phylogeny and historical associations. Trends in Ecology & Evolution 13(9), 356-359 (1998)
11. Scornavacca, C., Berry, V., Ranwez, V.: From gene trees to species trees through a supertree approach. In: Proc. of the 3rd Int. Conference on Language and Automata Theory and Applications (LATA 2009). LNCS, vol. 5457, pp. 702-714. Springer, Heidelberg (2009)
12. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281-288 (1995)
13. Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3(1), 103-128 (2007)