Algorithmica

, Volume 60, Issue 2, pp 207–235 | Cite as

Constructing the Simplest Possible Phylogenetic Network from Triplets

Open Access
Article

Abstract

A phylogenetic network is a directed acyclic graph that visualizes an evolutionary history containing so-called reticulations such as recombinations, hybridizations or lateral gene transfers. Here we consider the construction of a simplest possible phylogenetic network consistent with an input set T, where T contains at least one phylogenetic tree on three leaves (a triplet) for each combination of three taxa. To quantify the complexity of a network we consider both the total number of reticulations and the number of reticulations per biconnected component, called the level of the network. We give polynomial-time algorithms for constructing a level-1 respectively a level-2 network that contains a minimum number of reticulations and is consistent with T (if such a network exists). In addition, we show that if T is precisely equal to the set of triplets consistent with some network, then we can construct such a network with smallest possible level in time O(|T|k+1), if k is a fixed upper bound on the level of the network.

Keywords

Phylogenetics Polynomial-time algorithm Phylogenetic networks Triplets Minimising reticulations 

References

  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 J. Comput. 10(3), 405–421 (1981) CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Ann. Comb. 8, 391–408 (2004) CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Baroni, M., Grünewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. Math. Biol. 51, 171–182 (2005) CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155(8), 914–928 (2007) CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Bordewich, M., Linz, S., John, K. St., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform. 3, 86–98 (2007) Google Scholar
  6. 6.
    Byrka, J., Gawrychowski, P., Kelk, S.M., Huber, K.T.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. arXiv:0710.3258v3 [q-bio.PE] (2008)
  7. 7.
    Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1), 93–107 (2005) CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstructing of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2(1), 173–213 (2004) CrossRefGoogle Scholar
  9. 9.
    Gusfield, D., Hickerson, D., Eddhu, S.: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study. Discrete Appl. Math. 155(6–7), 806–830 (2007) CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    He, Y.-J., Huynh, T.N.D., Jansson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. J. Bioinform. Comput. Biol. 4(1), 59–74 (2006) CrossRefGoogle Scholar
  11. 11.
    Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 113 (1999) CrossRefMathSciNetGoogle Scholar
  12. 12.
    Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Mol. Biol. Evol. 23(2), 254–267 (2006) CrossRefGoogle Scholar
  13. 13.
    Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.-K.: Constructing a smallest refining galled phylogenetic network. In: Proceedings of Research in Computational Molecular Biology (RECOMB 2005). LNCS, vol. 3500, pp. 265–280 (2005) Google Scholar
  14. 14.
    van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L.: Constructing level-2 phylogenetic networks from triplets. arXiv:0707.2890v1 [p-bio.PE] (2007)
  15. 15.
    van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L., Hagen, F., Boekhout, T.: Constructing level-2 phylogenetic networks from triplets. In: Proceedings of Research in Computational Molecular Biology (RECOMB 2008). LNBI, vol. 4955, pp. 450–462 (2008) Google Scholar
  16. 16.
    van Iersel, L.J.J., Kelk, S.M., Mnich, M.: Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks. arXiv:0712.2932v3 [q-bio.PE] (2008)
  17. 17.
    Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J. Comput. 35(5), 1098–1121 (2006) CrossRefMATHMathSciNetGoogle Scholar
  18. 18.
    Jansson, J., Sung, W.-K.: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363, 60–68 (2006) CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    Makarenkov, V., Kevorkov, D., Legendre, P.: Phylogenetic network reconstruction approaches. In: Applied Mycology and Biotechnology. Bioinformatics, vol. 6, pp. 61–97. Elsevier, Amsterdam (2006) Google Scholar
  20. 20.
    MARLON: constructing level one phylogenetic networks with a minimum amount of reticulation. http://homepages.cwi.nl/~kelk/marlon.html
  21. 21.
    Morrison, D.A.: Networks in phylogenetic analysis: new tools for population biology. Int. J. Parasitol. 35(5), 567–582 (2005) CrossRefMathSciNetGoogle Scholar
  22. 22.
    Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE/ACM Trans. Comput. Biol. Bioinform. 1(1), 13–23 (2004) CrossRefGoogle Scholar
  23. 23.
    Song, Y.S., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. J. Math. Biol. 48, 160–186 (2004) CrossRefMATHMathSciNetGoogle Scholar
  24. 24.
    Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Bioinformatics 21(1), i413–i422 (2005) CrossRefGoogle Scholar
  25. 25.
    Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. J. Comput. Biol. 8(1), 69–78 (2001) CrossRefGoogle Scholar

Copyright information

© The Author(s) 2009

Authors and Affiliations

  1. 1.Department of Mathematics and StatisticsUniversity of CanterburyChristchurchNew Zealand
  2. 2.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations