Algorithms for combining rooted triplets into a galled phylogenetic network

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 349-358

  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

[No Author keywords available]

Indexed keywords

INTEGERS; PHYLOGENETIC NETWORKS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; ROOTED TRIPLETS;

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

TREES (MATHEMATICS);

EID: 20744451882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

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. Comp., 10(3): 405-421, 1981.
2. D. Bryant. Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury, Christchurch, New Zealand, 1997.
3. st Workshop on Algorithms in Bioinformatics (WABI 2001), volume 2149 of LNCS, pages 204-213. Springer, 2001.
4. th Australasian Theory Symposium (CATS 2004), pages 33-45, 2004.
5. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
6. th Australasian Theory Symposium (CATS'98), volume 20(3) of Australian Computer Science Communications, pages 67-76. Springer-Verlag Singapore, 1998.
7. L. Gasieniec, J. Jansson, A. Lingas, and A. Östlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2-3):183-197, 1999.
8. D. Gusfield, S. Eddhu, and C. Langley. Efficient reconstruction of phylogenetic networks with constrained recombination. In Proc. of Computational Systems Bioinformatics (CSB2003), pages 363-374, 2003.
9. M. R. Henzinger, V. King, and T. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica, 24(1):1-13, 1999.
10. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM, 48(4):723-760, 2001.
11. th Workshop on Algorithms in Bioinformatics (WABI 2004), to appear.
12. J. Jansson. On the complexity of inferring rooted evolutionary trees. In Proc. of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001), volume 7 of Electronic Notes in Discrete Mathematics, pages 121-125. Elsevier, 2001.
13. J. Jansson, J. H.-K. Ng, K. Sadakane, and W.-K. Sung. Rooted maximum agreement supertrees. In Proc. Latin American Theoretical Informatics (LATIN'04), volume 2976 of LNCS, pages 499-508. Springer, 2004.
14. th International Computing and Combinatorics Conference (COCOON 2004), volume 3106 of LNCS, pages 462-471. Springer, 2004.
15. T. Jiang, P. Kearney, and M. Li. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comp., 30(6):1942-1961, 2001.
16. S. Kannan, E. Lawler, and T. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21(1):26-50, 1996.
17. P. Kearney. Phylogenetics and the quartet method. In T. Jiang, Y. Xu, and M. Q. Zhang, editors, Current Topics in Computational Molecular Biology, pages 111-133. The MIT Press, Massachusetts, 2002.
18. th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), pages 337-346, 2004.
19. M. P. Ng, M. Steel, and N. C. Wormald. The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees. Discrete Applied Mathematics, 98(3):227-235, 2000.
20. M. P. Ng and N. C. Wormald. Reconstruction of rooted trees from subtrees. Discrete Applied Mathematics, 69(1-2):19-31, 1996.
21. D. Posada and K. A. Crandall. Intraspecific gene genealogies: trees grafting into networks. TRENDS in Ecology & Evolution, 16(1):37-45, 2001.
22. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9(1):91-116, 1992.
23. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8(1):69-78, 2001.
24. B. Y. Wu. Constructing the maximum consensus tree from rooted triples. Journal of Combinatorial Optimization, 8:29-39, 2004.