Computing the maximum agreement of phylogenetic networks

Theoretical Computer Science

Volumn 335, Issue 1, 2005, Pages 93-107

  Choy, Charles ^a   Jansson, Jesper ^a   Sadakane, Kunihiko ^b   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Algorithm; Computational complexity; Maximum agreement subnetwork; Phylogenetic network comparison

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; EVOLUTIONARY ALGORITHMS; GLOSSARIES; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

MAXIMUM AGREEMENT SUBNETWORK; PHYLOGENETIC NETWORK COMPARISON; SUBGRAPH; TRANSLATION SYSTEMS;

GENES;

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

References (30)

1. J. Alber, J. Gramm, and R. Niedermeier Faster exact algorithms for hard problems a parameterized point of view Discrete Math. 229 2001 3 27
2. A. Amir, and D. Keselman Maximum agreement subtree in a set of evolutionary trees Metrics and efficient algorithms SIAM J. Comput. 26 6 1997 1656 1669
3. C.H. Bennett, M. Li, and B. Ma Chain letters and evolutionary histories Sci. Amer. 288 6 2003 76 81
4. M. Bonet, C. Phillips, T. Warnow, and S. Yooseph Constructing evolutionary trees in the presence of polymorphic characters SIAM J. Comput. 29 1 1999 103 131
5. 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.
6. Canterbury Tales Project, De Montfort University, Harvard University, University of Leeds, National Library of Wales, Keio University, Brigham Young University, Virginia Polytechnic Institute and State University (Virginia Tech), University of Münster, and New York University, Website: http://www.cta.dmu.ac.uk/projects/ctp/.
7. 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. Comput. 30 5 2000 1385 1404
8. T. Cormen, C. Leiserson, and R. Rivest Introduction to Algorithms 1990 The MIT Press MA
9. M. Farach, T. Przytycka, and M. Thorup On the agreement of many trees Inform. Process. Lett. 55 1995 297 301
10. M. Farach, M. Thorup, Fast comparison of evolutionary trees, in: Proc. Fifth Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'94), 1994, pp. 481-488.
11. M. Farach, and M. Thorup Sparse dynamic programming for evolutionary-tree comparison SIAM J. Comput. 26 1 1997 210 230
12. C.R. Finden, and A.D. Gordon Obtaining common pruned trees J. Classification 2 1985 255 276
13. M. Garey, and D. Johnson Computers and Intractability - A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
14. L. Ga̧sieniec, J. Jansson, A. Lingas, and A. Östlin On the complexity of constructing evolutionary trees J. Combin. Optim. 3 2-3 1999 183 197
15. D. Gusfield, S. Eddhu, C. Langley, Efficient reconstruction of phylogenetic networks with constrained recombination, in: Proc. Comput. Systems Bioinformatics Conf. (CSB2003), 2003, pp. 363-374.
16. J. Hein Reconstructing evolution of sequences subject to recombination using parsimony Math. Biosci. 98 2 1990 185 200
17. J. Hein, T. Jiang, L. Wang, and K. Zhang On the complexity of comparing evolutionary trees Discrete Appl. Math. 71 1996 153 169
18. D.H. Huson, T. Dezulian, T. Klöpper, M. Steel, Phylogenetic super-networks from partial trees, in: Proc. Fourth Workshop on Algorithms in Bioinformatics (WABI 2004), 2004, pp. 388-399.
19. J. Jansson, W.-K. Sung, Inferring a level-1 phylogenetic network from a dense set of rooted triplets. in: Proc. Tenth Internat. Comput. and Combin. Conf. (COCOON 2004), 2004, pp. 462-472.
20. M.-Y. Kao Tree contractions and evolutionary trees SIAM J. Comput. 27 6 1998 1592 1616
21. 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 J. Algorithms 40 2 2001 212 233
22. W.-H. Li Molecular Evolution 1997 Sinauer Associates, Inc. Sunderland
23. C.R. Linder, B.M.E. Moret, L. Nakhleh, T. Warnow, Network (reticulate) evolution: biology, models, and algorithms, Tutorial Presented at the 9th Pacific Symposium on Biocomputing (PSB 2004), 2004.
24. A. Meyers, R. Yangarber, R. Grishman, Alignment of shared forests for bilingual corpora, in: Proc. 16th Internat. Conf. on Computational Linguistics (COLING-96), 1996, pp. 460-465.
25. 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.
26. L. Nakhleh, T. Warnow, C.R. Linder, Reconstructing reticulate evolution in species - theory and practice, in: Proc. Eighth Ann. Internat. Conf. on Research in Comput. Molecular Biology (RECOMB 2004), 2004, pp. 337-346.
27. D. Posada, and K.A. Crandall Intraspecific gene genealogies trees grafting into networks Trends Ecol. Evol. 16 1 2001 37 45
28. J.C. Setubal, and J. Meidanis Introduction to Computational Molecular Biology 1997 PWS Publishing Company Boston
29. M. Steel, and T. Warnow Kaikoura tree theorems computing the maximum agreement subtree Inform. Process. Lett. 48 1993 77 82
30. L. Wang, K. Zhang, and L. Zhang Perfect phylogenetic networks with recombination J. Comput. Biol. 8 1 2001 69 78