Inferring phylogenetic relationships avoiding forbidding rooted triplets

Journal of Bioinformatics and Computational Biology

Volumn 4, Issue 1, 2006, Pages 59-74

  He, Ying Jun ^a   Huynh, Trinh N D ^a   Jansson, Jesper ^a   Sung, Wing Kin ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Algorithm; Galled network; NP hardness; Phylogenetic network construction; Rooted triplet

Indexed keywords

ARTICLE; CONTROLLED STUDY; GENETIC ALGORITHM; HARDNESS; MATHEMATICAL COMPUTING; MOLECULAR BIOLOGY; MOLECULAR EVOLUTION; NULL ALLELE; PHYLOGENETIC TREE; SPECIES;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DNA; EVOLUTION, MOLECULAR; MODELS, GENETIC; PHYLOGENY;

EID: 33645295463     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720006001709     Document Type: Article

References (28)

1. 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.
2. Ajtai M, Komlós J, Szemerédi E, An O(n log n) sorting network, Proc 15th Annu ACM Symp Theory Comput, pp. 1-9, 1983.
3. Berry V, Nicolas F, Maximum agreement and compatible supertrees, Proc of 15th Annu Symp Combinatorial Pattern Matching, LNCS 3109:205-219, Springer-Verlag, Berlin Heidelberg 2004.
4. Bininda-Emonds O, Gittleman J, Steel M, The (super)tree of life: Procedures, problems, and prospects, Annu Review Ecology Systematics 33:265-289, 2002.
5. Bryant D, Building trees, hunting for trees, and comparing trees: Theory and methods in phylogenetic analysis, PhD thesis, University of Canterbury, Christchurch, New Zealand, 1997.
6. MC trees with variable rates across sites, Proc 1st Workshop Algorithms Bioinformatics LNCS 2149: 204-213, 2001.
7. Choy C, Jansson J, Sadakane K, Sung W-K, Computing the maximum agreement of phylogenetic networks, Proc Comput: 10th Australasian Theory Symp, Elsevier, pp. 33-45, 2004.
8. Ga̧sieniec L, Jansson J, Lingas A, Östlin A, Inferring ordered trees from local constraints, Proc Comput: 4th Australasian Theory Symp, Australian Computer Science Communications 20(3):67-76, Springer-Verlag, Singapore, 1998.
9. Ga̧sieniec L, Jansson J, Lingas A, Östlin A, On the complexity of constructing evolutionary trees, J Combinatorial Optimization 3(2-3):183-197, 1999.
10. Gusfield D, Eddhu S, Langley C, Efficient reconstruction of phylogenetic networks with constrained recombination, Proc Computational Systems Bioinformatics Conference, pp. 363-374, 2003.
11. Henzinger MR, King V, Warnow T, Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, Algorithmica 24(1):1-13, 1999.
12. Huson DH, Dezulian T, Klöpper T, Steel M, Phylogenetic super-networks from partial trees, Proc 4th Workshop Algorithms Bioinformatics, LNCS 3240:388-399, Springer-Verlag, Berlin Heidelberg 2004.
13. Jansson J, On the complexity of inferring rooted evolutionary trees, Proc Brazilian Symp Graphs, Algorithms, Combinatorics, Electronic Notes Discrete Math 7:121-125, Elsevier, 2001.
14. Jansson J, Ng JH-K, Sadakane K, Sung W-K, Rooted maximum agreement supertrees, Proc Latin American Theoretical Informatics, LNCS 2976:499-508, Springer-Verlag, Berlin Heidelberg 2004.
15. Jansson J, Nguyen NB, Sung W-K, Algorithms for combining rooted triplets into a galled phylogenetic network, Proc 16th Annu ACM-SIAM Symp Discrete Algorithms, pp. 349-358, 2005.
16. Jansson J, Sung W-K, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Proc 10th Int Comput Combinatorics Conf, LNCS 3106:462-471, Springer-Verlag, Berlin Heidelberg 2004.
17. Kannan S, Lawler E, Warnow T, Determining the evolutionary tree using experiments. J Algorithms 21(1):26-50, 1996.
18. Kearney P, Phylogenetics and the quartet method, in Jiang T, Xu Y, Zhang M., (eds.), Current Topics in Computational Molecular Biology, The MIT Press, Massachusetts, pp. 111-133, 2002.
19. Li W-H, Molecular Evolution, Sinauer Associates, Inc., Sunderland, 1997.
20. Linder CR, Moret BME, Nakhleh L, Warnow T, Network (reticulate) evolution: Biology, models, and algorithms, Tutorial presented at the 9th Pacific Symp Biocomput, 2004.
21. Nakhleh L, Warnow T, Linder CR, Reconstructing reticulate evolution in species - theory and practice. Proc 8th Annu Int Conf Research Computational Mol Biol, pp. 337-346, 2004.
22. Ng MP, Steel M, Wormald NC, The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees, Discrete Applied Math 98(3):227-235, 2000.
23. Posada D, Crandall KA, Intraspecific gene genealogies: Trees grafting into networks, TRENDS Ecology 6 Evolution 16(1):37-45, 2001.
24. Sanderson MJ, Purvis A, Henze C, Phylogenetic supertrees: Assembling the trees of life. TRENDS Ecology & Evolution 13(3):105-109, 1998.
25. Setubal JC, Meidanis J, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, 1997.
26. Steel M, The complexity of reconstructing trees from qualitative characters and subtrees, J Classification 9(1):91-116, 1992.
27. Wang L, Zhang K, Zhang L, Perfect phylogenetic networks with recombination, J Computational Biol 8(1):69-78, 2001.
28. Wu BY, Constructing the maximum consensus tree from rooted triples, J Combinatorial Optimization 8:29-39, 2004.