Quartets and unrooted phylogenetic networks

Journal of Bioinformatics and Computational Biology

Volumn 10, Issue 4, 2012, Pages

  Gambette, Philippe ^a   Berry, Vincent ^b   Paul, Christophe ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b LIRMM   (France)

Author keywords

exact algorithms; level k networks; NP hardness; Phylogenetic networks; quartets

Indexed keywords

ALGORITHM; ARTICLE; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; EVOLUTION, MOLECULAR; PHYLOGENY;

EID: 84863713320     PISSN: 02197200     EISSN: 17576334     Source Type: Journal    
DOI: 10.1142/S0219720012500047     Document Type: Article

References (38)

1. Morrison DA, Networks in phylogenetic analysis: New tools for population biology, Int J Parasitol 35:567-582, 2005.
2. Buneman P, The recovery of trees from measures of dissimilarity. In FR Hodson, DG Kendall, and P Tautu, eds., Mathematics in Archeological and Historical Sciences, pages 387-395. Edimburgh University Press, 1971.
3. Makarenkov V, T-REX: Reconstructing and visualizing phylogenetic trees and reticulation networks, Bioinformatics 17(7):664-668, 2001.
4. Whitfield JB, Cameron SA, Huson DH, Steel M, Filtered Z-closure supernetworks for extracting and visualizing recurrent signal from incongruent gene trees, Syst Biol 57 (6):939-947, 2008.
5. Holland BR, Benthin S, Lockhart PJ, Moulton V, Huber KT, Using supernetworks to distinguish hybridization from lineage-sorting, BMC Evol Biol 8:202, 2008.
6. Dress AWM, Huson DH, Constructing splits graphs, IEEE/ACM Transact Comput Biol Bioinform 1(3):109-115, 2004.
7. Holland BR, Delsuc F, Moulton V, Visualizing con̊icting evolutionary hypotheses in large collections of trees: Using consensus networks to study the origins of placentals and hexapods, Syst Biol 54(1):66-76, 2005.
8. Grünewald S, Forslund K, Dress AWM, Moulton V, QNet: An agglomerative method for the construction of phylogenetic networks from weighted quartets, Mol Biol and Evol, 24(2):532-538, 2007.
9. Grünewald S, Spillner A, Forslund K, Moulton V, Constructing phylogenetic supernetworks from quartets, Proc 8th Workshop Algorithms Bioinformatics (WABI'08), Vol. 5251, LNCS, pp. 284-295. Springer Verlag, 2008.
10. Huson DH, Kloepper T, Lockhart PJ, Steel M, Reconstruction of reticulate networks from gene trees, Proc 9th Annu Int Conf Res in Comput Mol Biol (RECOMB'05), Vol. 3500, LNCS, pp. 233-249, 2005.
11. Huson DH, Kloepper T, Beyond galled trees - decomposition and computation of galled networks, Proc 11th Annu Int Conf on Res in Comput Mol Biol (RECOMB'07), Vol. 4453, LNCS, pp. 211-225, 2007.
12. Kloepper T, Algorithms for the Calculation and Visualisation of Phylogenetic Networks, Ph.D. thesis, Eberhard-Karls-Universität Tübingen, Germany, 2008.
13. Bininda-Emonds ORP, Beck RMD, Purvis A, Getting to the roots of matrix representation, Syst Biol 54(4):668-672, 2005.
14. Dufayard J-F, Duret L, Penel S, Gouy M, Rechenmann F, Perri-ere G, Tree pattern matching in phylogenetic trees: Automatic search for orthologs or paralogs in homologous gene sequence databases, Bioinformatics 21:2596-2603, 2005.
15. Huerta-Cepas J, Capella-Gutierrez S, Pryszcz LP, Denisov I, Kormes D, Marcet-Houben M, Gabald-on T, Phylome DB v3.0: An expanding repository of genome-wide collections of trees, alignments and phylogeny-based orthology and paralogy predictions, Nucleic Acids Res 39(Supp. 1):D556-D560, 2011.
16. Jansson J, Sung W-K, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theor Comp Sci 363(1):60-68, 2006.
17. He Y-J, Huynh TND, Jansson J, Sung W-K, Inferring phylogenetic relationships avoiding forbidden rooted triplets, J Bioinform Comput Biol 4(1):59-74, 2006.
18. Jansson J, Nguyen NB, Sung W-K, Algorithms for combining rooted triplets into a galled phylogenetic network, SIAM J Comput 35(5):1098-1121, 2006.
19. Van Iersel L, Keijsper J, Kelk S, Stougie L, Hagen F, Boekhout T, Constructing level-2 phylogenetic networks from triplets, IEEE/ACM Transact Comput Biol Bioinform 6 (4):667-681, 2009.
20. van Iersel L, Kelk S, Constructing the simplest possible phylogenetic network from triplets, Algorithmica 60(2):207-235, 2011.
21. To T-H, Habib M, Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time, Proc 20th Annu Symp Combinatorial Pattern Matching (CPM'09), Vol. 5577, LNCS, pp. 275-288, 2009.
22. Byrka J, Gawrychowski P, Huber KT, Kelk S, Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, J Discrete Algorithms 8(1):65-75, 2010.
23. Gambette P, Huber KT, On encodings of phylogenetic networks of bounded level, J Math Biol, 2012, to appear.
24. Aho AV, Sagiv Y, Szymanski TG, Ullman JD, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J Comput 10(3):405-421, 1981.
25. Steel M, The complexity of reconstructing trees from qualitative characters and subtrees, J Classification 9:91-116, 1992.
26. Gusfield D, Bansal V, Bafna V, Song YS, A decomposition theory for phylogenetic networks and incompatible characters, J Comput Biol 14(10):1247-1272, 2007.
27. Gusfield D, Eddhu S, Langley C, Optimal, ecient reconstruction of phylogenetic networks with constrained recombination, J Bioinform Comput Biol 2(1):173-213, 2004.
28. van Iersel L, Kelk S, Mnich M, Uniqueness, intractability and exact algorithms: Re̊ections on level-k phylogenetic networks, J Bioinform Comput Biol 7(4):597-623, 2009.
29. Woolley SM, Posada D, Crandall KA, A comparison of phylogenetic network methods using computer simulation, PLoS ONE 3(4):e1913, 2008.
30. Brandes U, Cornelsen S, Phylogenetic graph models beyond trees, Discrete Appl Math 157(10):2361-2369, 2010.
31. Tholey T, Improved algorithms for the 2-vertex disjoint paths problem, Proc 35th Int Conf Current Trends in Theory and Practice of Computer Science (SOFSEM'09), Vol. 5404, LNCS, pp. 546-557, 2009.
32. Opatrny J, Total ordering problem, SIAM J Comput 8(1):111-114, 1979.
33. Grünewald S, Moulton V, Spillner A, Consistency of the QNet algorithm for generating planar split networks from weighted quartets, Discrete Appl Math 157:2325-2334, 2009.
34. Berry V, Gascuel O, Inferring evolutionary trees with strong combinatorial evidence, Theor Comput Sci 240(2):271-298, 2000.
35. Harel D, Tarjan RE, Fast algorithms for finding nearest common ancestors, SIAM J Comput 13(2):338-355, 1984.
36. Guttmann W, Maucher M, Variations on an ordering theme with constraints, Proc 4th IFIP Int Conf on Theor Comp Sci (TCS'06), Vol. 209, IFIP, pp. 77-90, 2006.
37. Gambette P, Berry V, Paul C, The structure of level-k phylogenetic networks, Proc 20th Annu Symp Combinatorial Pattern Matching (CPM'09), Vol. 5577, LNCS, pp. 289-300, 2009.
38. Kelk S, Scornavacca C, van Iersel L, On the elusiveness of clusters, IEEE/ACM Transact Comput Biol Bioinform 9(2):517-534, 2012.