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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 462-471

  Jansson, Jesper ^a   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; POLYNOMIALS;

CARDINALITIES; LEVEL-1; PHYLOGENETIC NETWORKS; POLYNOMIAL-TIME; ROOTED TRIPLETS; SORTING NETWORK; TIME ALGORITHMS;

PROBLEM SOLVING;

EID: 35048857956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_49     Document Type: Article

References (20)

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 Journal on Computing, 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. Elsevier, 2004.
5. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, Massachusetts, 1990.
6. th Australasian Theory Symposium (CATS'98), volume 20(3) of Australian Computer Science Communications, pages 67-76. Springer-Verlag Singapore, 1998.
7. L. Ga̧sieniec, J. Jansson, A. Lingas, and A. Östlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3:183-197, 1999.
8. D. Gusfield, S. Eddhu, and C. Langley. Efficient reconstruction of phylogenetic networks with constrained recombination. In Proc. of the Computational Systems Bioinformatics Conference (CSB2003), pages 363-374, 2003.
9. J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences, 98(2):185-200, 1990.
10. 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.
11. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM, 48(4):723-760, 2001.
12. J. Jansson. On the complexity of inferring rooted evolutionary trees. In Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO'01), 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. of Latin American Theoretical Informatics (LATIN 2004), volume 2976 of LNCS, pages 499-508, 2004.
14. T. Jiang, P. Kearney, and M. Li. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM Journal on Computing, 30(6):1942-1961, 2001.
15. S. Kannan, E. Lawler, and T. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21(1):26-50, 1996.
16. 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.
17. th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), to appear.
18. D. Posada and K. A. Crandall. Intraspecific gene genealogies: trees grafting into networks. TRENDS in Ecology & Evolution, 16(1):37-45, 2001.
19. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9(1):91-116, 1992.
20. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8(1):69-78, 2001.