Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets

  • Sylvain Guillemot
  • Jesper Jansson
  • Wing-Kin Sung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5878)


We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent with each of the rooted triplets in a given set. We prove that even the restricted case of determining if there exists a MUL tree consistent with the input and having just one leaf duplication is NP-hard. Furthermore, we show that the general minimization problem is NP-hard to approximate within a ratio of n1 − ε for any constant 0 < ε ≤ 1, where n denotes the number of distinct leaf labels in the input set, although a simple polynomial-time approximation algorithm achieves the approximation ratio n. We also provide an exact algorithm for the problem running in O*(7n) time and O*(3n) space.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)MATHCrossRefMathSciNetGoogle Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)Google Scholar
  5. 5.
    Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Journal of Computer and System Sciences 57(2), 187–199 (1998)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fellows, M., Hallett, M., Stege, U.: Analogs & duals of the MAST problem for sequences & trees. Journal of Algorithms 49(1), 192–216 (2003)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)MATHGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 9.
    Neumann-Lara, V.: The dichromatic number of a digraph. Journal of Combinatorial Theory, Series B 33(3), 265–270 (1982)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Page, R.D.M., Charleston, M.A.: Trees within trees: phylogeny and historical associations. Trends in Ecology & Evolution 13(9), 356–359 (1998)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 12.
    Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281–288 (1995)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3(1), 103–128 (2007)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sylvain Guillemot
    • 1
  • Jesper Jansson
    • 2
  • Wing-Kin Sung
    • 3
    • 4
  1. 1.Institut Gaspard MongeUniversité Paris-EstMarne-la-ValléeFrance
  2. 2.Ochanomizu UniversityTokyoJapan
  3. 3.School of ComputingNational University of SingaporeSingapore
  4. 4.Genome Institute of SingaporeGenomeSingapore

Personalised recommendations