Algorithms for combining rooted triplets into a galled phylogenetic network

SIAM Journal on Computing

Volumn 35, Issue 5, 2006, Pages 1098-1121

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Algorithm; Galled network; NP hardness; Phylogenetic network; Rooted triplet; SN tree

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGER PROGRAMMING; NUMBER THEORY; POLYNOMIALS; TREES (MATHEMATICS);

PHYLOGENETIC NETWORK; POSITIVE INTEGER; ROOTED TRIPLETS; TIME ALGORITHM;

PROBLEM SOLVING;

EID: 33750185868     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704446529     Document Type: Article

References (25)

1. A. V. AHO, Y. SAGIV, T. G. SZYMANSKI, AND J. D. ULLMAN, Inferring a tree, from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput., 10 (1981), pp. 405-421.
2. 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.
3. MC frees with variable rates across sites, in Proceedings of the 1st Annual Workshop on Algorithms in Bioinformatics (WABI 2001), Lecture Notes in Comput. Sci. 2149, Springer-Verlag, Berlin, 2001, pp. 204-213.
4. C. CHOY, J. JANSSON, K. SADAKANE, AND W.-K. SUNG, Computing the maximum agreement of phylogenetic networks, Theoret. Comput. Sci., 335 (2005), pp. 93-107.
5. M. GAREY AND D. JOHNSON, Computers and Intractability - A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
6. L. GA̧SIENIEC, J. JANSSON, A. LINGAS, AND A. ÖSTLIN, Inferring ordered trees from local constraints, in Proceedings the 4th Annual Australasian Theory Symposium of Computing (CATS'98), Aust. Comput. Sci. Commun. 20, Springer-Verlag, Singapore, 1998, pp. 67-76.
7. L. GA̧SIENIEC, J. JANSSON, A. LINGAS, AND A. ÖSTLIN, On the complexity of constructing evolutionary trees, 3. Comb. Optim., 3 (1999), pp. 183-197.
8. D. GUSFIELD, S. EDDHU, AND C. LANGLEY, Optimal, efficient reconstruction of phylogenetic networks with constrained recombination, J. Bioinform. Comput. Biol., 2 (2004), pp. 173-213.
9. J. HEIN, Reconstructing evolution of sequences subject to recombination using parsimony, Math. Biosci., 98 (1990), pp. 185-200.
10. M. R. HENZINGER, V. KING, AND T. WARNOW, Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, Algorithmica, 24 (1999), pp. 1-13.
11. J. HOLM, K. DE LICHTENBERG, AND M. THORUP, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, J. ACM, 48 (2001), pp. 723-760.
12. D. H. HUSON, T. DEZULIAN, T. KLöPPER, AND M. STEEL, Phylogenetic super-networks from partial trees, in Proceedings of the 4th Annual Workshop on Algorithms in Bioinformatics (WABI 2004), Lecture Notes in Comput. Sci. 3240, Springer-Verlag, Berlin, 2004, pp. 388-399.
13. J. JANSSON, On the complexity of inferring rooted evolutionary trees, in Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001), Electron. Notes Discrete Math. 7, Elsevier, 2001, pp. 121-125.
14. J. JANSSON, J. H.-K. NG, K. SADAKANE, AND W.-K. SUNG, Rooted maximum agreement super-trees, Algorithmica, 43 (2005), pp. 293-307.
15. J. JANSSON AND W.-K. SUNG, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theoret. Comput. Sci., to appear.
16. T. JIANG, P. KEARNEY, AND M. LI, A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application, SIAM J. Comput., 30 (2001), pp. 1942-1961.
17. S. KANNAN, E. LAWLER, AND T. WARNOW, Determining the evolutionary tree using experiments, J. Algorithms, 21 (1996), pp. 26-50.
18. P. KEARNEY, Phylogenetics and the quartet method, in Current Topics in Computational Molecular Biology, T. Jiang, Y. Xu, and M. Q. Zhang, eds., The MIT Press, Cambridge, MA, 2002, pp. 111-133.
19. L. NAKHLEH, T. WARNOW, C. R. LINDER, AND K. ST. JOHN, Reconstructing reticulate evolution in species - Theory and practice, J. Comput. Biol., 12 (2005), pp. 796-811.
20. M. P. NG, M. STEEL, AND N. C. WORMALD, The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees, Discrete Appl. Math., 98 (2000), pp. 227-235.
21. M. P. No AND N. C. WORMALD, Reconstruction of rooted trees from subtrees, Discrete Appl. Math., 69 (1996), pp. 19-31.
22. D. POSADA AND K. A. CRANDALL, Intraspecific gene genealogies; Trees grafting into networks, Trends Ecol. Evol., 16 (2001), pp. 37-45.
23. M. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.
24. L. WANG, K. ZHANG, AND L. ZHANG, Perfect phylogenetic networks with recombination, J. Comput. Biol., 8 (2001), pp. 69-78.
25. B. Y. Wu, Constructing the maximum consensus tree from rooted triples, J. Comb. Optim., 8 (2004), pp. 29-39.