Inferring a level-1 phylogenetic network from a dense set of rooted triplets

Theoretical Computer Science

Volumn 363, Issue 1, 2006, Pages 60-68

  Jansson, Jesper ^a   Sung, Wing Kin ^a,b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Algorithm; Phylogenetic network construction; Rooted triplet; Sorting network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; POLYNOMIALS;

PHYLOGENETIC NETWORK CONSTRUCTION; ROOTED TRIPLET; SORTING NETWORK;

PROBLEM SOLVING;

EID: 33749437273     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.06.022     Document Type: Article

References (25)

1. Aho A.V., Sagiv Y., Szymanski T.G., and Ullman J.D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10 3 (1981) 405-421
2. M. Ajtai, J. Komlós, E. Szemerédi, An O (n log n) sorting network, in: Proc. 15th Annu. ACM Symp. on the Theory of Computing (STOC'83), 1983, pp. 1-9.
3. D. Bryant. Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, Ph.D. Thesis, University of Canterbury, Christchurch, New Zealand, 1997.
4. Bryant D., and Moulton V. Neighbor-net: an agglomerative method for the construction of phylogenetic networks. Mol. Biol. Evol. 21 2 (2004) 255-265
5. MC trees with variable rates across sites. in: Proc. of the First Workshop on Algorithms in Bioinformatics (WABI 2001), Lecture Notes in Computer Science Vol. 2149 (2001), Springer, Berlin 204-213
6. Choy C., Jansson J., Sadakane K., and Sung W.-K. Computing the maximum agreement of phylogenetic networks. Theoret. Comput. Sci. 335 1 (2005) 93-107
7. Cormen T., Leiserson C., and Rivest R. Introduction to Algorithms (1990), The MIT Press, MA
8. Ga̧sieniec L., Jansson J., Lingas A., and Östlin A. Inferring ordered trees from local constraints. in: Proc. of Computing: the Fourth Australasian Theory Symposium (CATS'98), Australian Computer Science Communications Vol. 20(3) (1998), Springer, Singapore 67-76
9. Ga̧sieniec L., Jansson J., Lingas A., and Östlin A. On the complexity of constructing evolutionary trees. J. Combin. Optim. 3 2-3 (1999) 183-197
10. D. Gusfield, S. Eddhu, C. Langley, Efficient reconstruction of phylogenetic networks with constrained recombination, in: Proc. of the Computational Systems Bioinformatics Conference (CSB2003), 2003, pp. 363-374.
11. Hein J. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98 2 (1990) 85-200
12. Henzinger M.R., King V., and Warnow T. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24 1 (1999) 1-13
13. Holm J., de Lichtenberg K., and Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48 4 (2001) 723-760
14. Jansson J. On the complexity of inferring rooted evolutionary trees. in: Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO 2001), Electronic Notes in Discrete Mathematics Vol. 7 (2001), Elsevier, Amsterdam 121-125
15. J. Jansson, J.H.-K. Ng, K. Sadakane, W.-K. Sung, Rooted maximum agreement supertrees. Algorithmica 43 (4) (2005) 293-307.
16. Jiang T., Kearney P., and Li M. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30 6 (2001) 1942-1961
17. Kannan S., Lawler E., and Warnow T. Determining the evolutionary tree using experiments. J. Algorithms 21 1 (1996) 26-50
18. Kearney P. Phylogenetics and the quartet method. In: Jiang T., Xu Y., and Zhang M.Q. (Eds). Current Topics in Computational Molecular Biology (2002), The MIT Press, MA 111-133
19. L. Nakhleh, J. Sun, T. Warnow, C.R. Linder, B.M.E. Moret, A. Tholse, Towards the development of computational tools for evaluating phylogenetic reconstruction methods, in: Proc. Eighth Pacific Symp. on Biocomputing (PSB 2003), 2003, pp. 315-326.
20. L. Nakhleh, T. Warnow, C.R. Linder, Reconstructing reticulate evolution in species-theory and practice, in: Proc. Eighth Annu. Internat. Conf. on Research in Computational Molecular Biology (RECOMB 2004), 2004, pp. 337-346.
21. Posada D., and Crandall K.A. Intraspecific gene genealogies: trees grafting into networks. TRENDS Ecol. Evol. 16 1 (2001) 37-45
22. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification 9 1 (1992) 91-116
23. Wang L., Zhang K., and Zhang L. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8 1 (2001) 69-78
24. Wu B.Y. Constructing the maximum consensus tree from rooted triples. J. Combin. Optim. 8 (2004) 29-39
25. Jansson J., Nguyen N.B., and Sung W.-K. Rooted maximum agreement supertrees. Algorithmica. 43 4 (2005) 293-307