Uniqueness, intractability and exact algorithms: Reflections on level-κ phylogenetic networks

Journal of Bioinformatics and Computational Biology

Volumn 7, Issue 4, 2009, Pages 597-623

  Van Iersel, Leo ^a   Kelk, Steven ^b   Mnich, Matthias ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Exact algorithms; NP hardness; Phylogenetic networks

Indexed keywords

DNA;

ARTICLE; BAYES THEOREM; DNA HYBRIDIZATION; GENETIC CONSERVATION; GENETIC RECOMBINATION; HORIZONTAL GENE TRANSFER; MATHEMATICAL ANALYSIS; MAXIMUM LIKELIHOOD METHOD; MONTE CARLO METHOD; NEIGHBOR JOINING METHOD; PARSIMONY ANALYSIS; PHYLOGENETIC TREE; PHYLOGENY; PROBABILITY; TAXONOMY;

ALGORITHMS; ANIMALS; COMPUTER SIMULATION; GENE TRANSFER, HORIZONTAL; GENETICS, POPULATION; HUMANS; MODELS, GENETIC; PEDIGREE; PHYLOGENY;

EID: 68349083270     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720009004308     Document Type: Article

References (28)

1. Huson DH, Bryant D, Application of phylogenetic networks in evolutionary studies, Mol Biol Evol 23(2):254-267, 2006.
2. Gusfield D, Eddhu S, Langley C, Optimal, efficient reconstruction of phylogenetic networks with constrained recombination, J Bioinform Comput Biol 2:173-213, 2004.
3. Nakhleh L, Warnow T, Linder CR, St. John K, Reconstructing reticulate evolution in species - theory and practice, J Comput Biol 12 6):796-811, 2005.
4. Jansson J, Nguyen B, Sung WK, Algorithms for combining rooted triplets into a galled phylogenetic network, SIAM J Comput 35 5):1098-1121, 2006.
5. Choy C, Jansson J, Sadakane K, Sung WK, Computing the maximum agreement of phylogenetic networks, Theor Comput Sci 335(1):93-107, 2005.
6. Holder M, Lewis PO, Phylogeny estimation: Traditional and bayesian approaches, Nat Rev Genet 4:275-284, 2003.
7. St. John K, Warnow T, Moret BME, Vawter L, Performance study of phylogenetic methods:(Unweighted) quartet methods and neighbor-joining, J Algorithm 48(1):173-193, 2003.
8. Snir S, Warnow T, Rao S, Short quartet puzzling: A new quartet-based phylogeny reconstruction algorithm, J Comput Biol 15 1):91-103, 2008.
9. 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.
10. Steel M, The complexity of reconstructing trees from qualitative characters and subtrees, J Classif 9(1):91-116, 1992.
11. van Iersel LJJ, Keijsper JCM, Kelk SM, Stougie L, Hagen F, Boekhout T, Constructing level-2 phylogenetic networks from triplets, Research in Comp Mol Biol (RECOMB 2008), LNCS 4955, pp. 450-462, 2008.
12. van Iersel LJJ, Keijsper JCM, Kelk SM, Stougie L, Constructing level-2 phylogenetic networks from triplets, arXiv:0707.2890v1 [p-bio.PE], July 2007.
13. Bryant D, Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis, Thesis, University of Canterbury, Christchurch, New Zealand, 1997.
14. Jansson J, On the complexity of inferring rooted evolutionary trees, Brazilian Symposium on Graphs, Algorithms and Combinatorics in Electron Notes Discrete Math. 7, p. 4, 2001.
15. Wu BY, Constructing the maximum consensus tree from rooted triples, J Comb Optim 8(1):29-39, 2004.
16. Ga̧sieniec L, Jansson J, Lingas A, Östlin A, On the complexity of constructing evolutionary trees, J Comb Optim 3 2-3):183-197, 1999.
17. Byrka J, Gawrychowski P, Huber KT, Kelk SM, Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, to appear in J Discrete Algorithm doi:10.1016/j.jda.2009.01.004.
18. Semple C, Steel M, A supertree method for rooted trees, Discrete Appl Math 105(1-3): 147-158, 2000.
19. Page RDM, Modified Mincut Supertrees, Proc Workshop on Algorithms in Bioinformatics (WABI 2002), LNCS 2452, pp. 537-551, 2002.
20. Snir S, Rao S, Using Max Cut to enhance rooted trees consistency, IEEE/ACM Trans Comp Biol Bioinform 3(4):323-333, 2006.
21. Baum BR, Combining trees as a way of combining data sets for phylogenetic inference, Taxon 4:3-10, 1992.
22. Ragan MA, Matrix representation in reconstructing phylogenetic relationships among the eukaryotes, Biosystems 28:47-55, 1992.
23. Sanderson MJ, Purvis A, Henze C, Phylogenetic supertrees: Assembling the trees of life, Trends Ecol Evol 13:105-109, 1998.
24. Kelk SM, Level-3 generators, 2008, .
25. Jansson J, Sung WK, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theor Comput Sci 363(1 :60-68, 2006.
26. Garey MR, Johnson DS, Computers and Intractability, W. H. Freeman and Co., San Francisco, California, 1979.
27. Alon N, Ranking tournaments, SIAM J Discrete Math 20 1):137-142, 2006.
28. Charbit P, Thomassé S, Yeo A, The minimum feedback arc set problem is NP-hard for tournaments, Combin Probab Comput 16(1):1-4, 2007.