The maximum agreement of two nested phylogenetic networks

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

Volumn 3341, Issue , 2004, Pages 581-593

  Jansson, Jesper ^a   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; POLYNOMIAL APPROXIMATION; COMPUTER SCIENCE; COMPUTERS;

BRANCHING STRUCTURES; FAST ALGORITHMS; NESTED STRUCTURES; NP-HARD; PHYLOGENETIC NETWORKS; PHYLOGENETICS; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; SUBNETWORKS; SUB-NETWORK;

PHYLOGENETIC; POLYNOMIAL APPROXIMATION;

EID: 35048843750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_51     Document Type: Article

References (21)

1. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM J. on Computing, 26:1656-1669, 1997.
2. D. Bryant. Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. PhD thesis, Univ. of Canterbury, New Zealand, 1997.
3. nd Workshop on Algorithms in Bioinformatics (WABI 2002), volume 2452 of LNCS, pages 375-391. Springer, 2002.
4. th Australasian Theory Symposium (CATS 2004), volume 91 of ENTCS, pages 134-147. Elsevier, 2004.
5. R. Cole, M. Farach-Colton, R. Hariharan, T. Przytycka, and M. Thorup. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. on Computing, 30(5):1385-1404, 2000.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, 1990.
7. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55:297-301, 1995.
8. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
9. 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.
10. 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.
11. J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences, 98(2):185-200, 1990.
12. th Workshop on Algorithms in Bioinformatics (WABI 2004), to appear.
13. th International Computing and Combinatorics Conference (COCOON 2004), to appear.
14. M.-Y. Kao, T.-W. Lam, W.-K. Sung, and H.-F. Ting. An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. Journal of Algorithms, 40(2):212-233, 2001.
15. W.-H. Li. Molecular Evolution. Sinauer Associates, Inc., Sunderland, 1997.
16. th Pacific Symposium on Biocomputing (PSB 2003), pages 315-326, 2003.
17. th Annual International Conf. on Research in Computational Molecular Biology (RECOMB 2004), pages 337-346, 2004.
18. D. Posada and K. A. Crandall. Intraspecific gene genealogies: trees grafting into networks. TRENDS in Ecology & Evolution, 16(1):37-45, 2001.
19. J. Setubal and J. Meidanis. Introduction to Comp. Molecular Biology. PWS, 1997.
20. M. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48:77-82, 1993.
21. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8(1):69-78, 2001.