Constructing the simplest possible phylogenetic network from triplets

Algorithmica (New York)

Volumn 60, Issue 2, 2011, Pages 207-235

  Van Iersel, Leo ^a   Kelk, Steven ^b  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

^b CWI   (Netherlands)

Author keywords

Minimising reticulations; Phylogenetic networks; Phylogenetics; Polynomial time algorithm; Triplets

Indexed keywords

MINIMISING RETICULATIONS; PHYLOGENETIC NETWORKS; PHYLOGENETICS; POLYNOMIAL-TIME ALGORITHM; TRIPLETS;

ALGORITHMS; GENE TRANSFER; GENES;

POLYNOMIALS;

EID: 79953171600     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9333-0     Document Type: Article

References (25)

1. A.V. Aho Y. Sagiv T.G. Szymanski J.D. Ullman 1981 Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions SIAM J. Comput. 10 3 405 421 10.1137/0210030 0462.68086 623055
2. M. Baroni C. Semple M. Steel 2004 A framework for representing reticulate evolution Ann. Comb. 8 391 408 10.1007/s00026-004-0228-0 1059.05034 2112692 (Pubitemid 40167161)
3. M. Baroni S. Grünewald V. Moulton C. Semple 2005 Bounding the number of hybridisation events for a consistent evolutionary history Math. Biol. 51 171 182 10.1007/s00285-005-0315-9 1068.92034 2213137 (Pubitemid 41040209)
4. M. Bordewich C. Semple 2007 Computing the minimum number of hybridization events for a consistent evolutionary history Discrete Appl. Math. 155 8 914 928 10.1016/j.dam.2006.08.008 1111.92041 2319868 (Pubitemid 46436152)
5. M. Bordewich S. Linz K. St. John C. Semple 2007 A reduction algorithm for computing the hybridization number of two trees Evol. Bioinform. 3 86 98
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. C. Choy J. Jansson K. Sadakane W.-K. Sung 2005 Computing the maximum agreement of phylogenetic networks Theor. Comput. Sci. 335 1 93 107 10.1016/j.tcs.2004.12.012 1091.68057 2136632 (Pubitemid 40574419)
8. D. Gusfield S. Eddhu C. Langley 2004 Optimal, efficient reconstructing of phylogenetic networks with constrained recombination J. Bioinform. Comput. Biol. 2 1 173 213 10.1142/S0219720004000521 (Pubitemid 38996817)
9. D. Gusfield D. Hickerson S. Eddhu 2007 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 10.1016/j.dam.2005.05.044 05144485 2309849 (Pubitemid 46215768)
10. Y.-J. He T.N.D. Huynh J. Jansson W.-K. Sung 2006 Inferring phylogenetic relationships avoiding forbidden rooted triplets J. Bioinform. Comput. Biol. 4 1 59 74 10.1142/S0219720006001709
11. M.R. Henzinger V. King T. Warnow 1999 Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology Algorithmica 24 1 113 10.1007/PL00009268 1674624
12. D.H. Huson D. Bryant 2006 Application of phylogenetic networks in evolutionary studies Mol. Biol. Evol. 23 2 254 267 10.1093/molbev/msj030 (Pubitemid 43100040)
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) (Pubitemid 41420669)
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. 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)
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. J. Jansson N.B. Nguyen W.-K. Sung 2006 Algorithms for combining rooted triplets into a galled phylogenetic network SIAM J. Comput. 35 5 1098 1121 10.1137/S0097539704446529 1100.68081 2217139 (Pubitemid 44599920)
18. J. Jansson W.-K. Sung 2006 Inferring a level-1 phylogenetic network from a dense set of rooted triplets Theor. Comput. Sci. 363 60 68 10.1016/j.tcs.2006.06.022 1110.68032 2263491 (Pubitemid 44508784)
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)
20. MARLON: constructing level one phylogenetic networks with a minimum amount of reticulation. http://homepages.cwi.nl/~kelk/marlon.html
21. D.A. Morrison 2005 Networks in phylogenetic analysis: new tools for population biology Int. J. Parasitol. 35 5 567 582 10.1016/j.ijpara.2005.02.007 2146374
22. B.M.E. Moret L. Nakhleh T. Warnow C.R. Linder A. Tholse A. Padolina J. Sun R. Timme 2004 Phylogenetic networks: modeling, reconstructibility, and accuracy IEEE/ACM Trans. Comput. Biol. Bioinform. 1 1 13 23 10.1109/TCBB.2004.10
23. Y.S. Song J. Hein 2004 On the minimum number of recombination events in the evolutionary history of DNA sequences J. Math. Biol. 48 160 186 10.1007/s00285-003-0227-5 1063.92041 2041499 (Pubitemid 40882747)
24. Y.S. Song Y. Wu D. Gusfield 2005 Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution Bioinformatics 21 1 i413 i422 10.1093/bioinformatics/bti1033 (Pubitemid 41794515)
25. L. Wang K. Zhang L. Zhang 2001 Perfect phylogenetic networks with recombination J. Comput. Biol. 8 1 69 78 10.1089/106652701300099119 (Pubitemid 32679479)