Rooted maximum agreement supertrees

Algorithmica (New York)

Volumn 43, Issue 4, 2005, Pages 293-307

  Jansson, Jesper ^a   Ng, Joseph H K ^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 supertree; Phylogenetic tree; Rooted triplet

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY; TOPOLOGY;

MAXIMUM AGREEMENT SUPERTREE; PHYLOGENETIC TREES; ROOTED TRIPLET;

TREES (MATHEMATICS);

EID: 29544440147     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-004-1147-5     Document Type: Article

References (28)

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. T. Akutsu and M. M. Halldórsson. On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science, 233(1-2):33-50, 2000.
3. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM Journal on Computing, 26(6):1656-1669, 1997.
4. th Annual Symposium on Combinatorial Pattern Matching (CPM 2004), pages 205-219. Volume 3109 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.
5. O. Bininda-Emonds, J. Gittleman, and M. Steel. The (super)tree of life: procedures, problems, and prospects. Annual Review of Ecology and Systematics, 33:265-289, 2002.
6. D. Bryant. Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. Ph.D. thesis, University of Canterbury, Christchurch, 1997.
7. st'International Conference on Biology, Informatics, and Mathematics (JOBIM 2000), pages 24-31. Volume 2066 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
8. stWorkshop on Algorithms in Bioinformatics (WABI2001), pages 204-213. Volume 2149 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
9. 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 Journal on Computing, 30(5):1385-1404, 2000.
10. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55:297-301, 1995.
11. thAnnual ACM-SIAM Symposium on Discrete Algorithms (SODA '94), pages 481-88, 1994.
12. M. Farach and M. Thorup. Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing, 26(1):210-230, 1997.
13. C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
14. st Workshop on Algorithms in Bioinformatics (WABI 2001), pages 156-163. Volume 2149 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
15. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
16. L. Ga̧sieniec, J. Jansson, A. Lingas, and A. Östlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2-3): 183-197, 1999.
17. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71:153-169, 1996.
18. 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.
19. 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.
20. J. Jansson. On the complexity of inferring rooted evolutionary trees. In Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001), pages 121-125. Volume 7 of Electronic Notes in Discrete Mathematics. Elsevier, Amsterdam, 2001.
21. M.-Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, 27(6):1592-1616, 1998.
22. th Annual ACM Symposium on the Theory of Computing (STOC '97), pages 54-65, 1997.
23. 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.
24. 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, Cambridge, MA, 2002.
25. th International Conference on Computational Linguistics (COLING-96), pages 460-465, 1996.
26. M. J. Sanderson, A. Purvis, and C. Henze. Phylogenetic supertrees: assembling the trees of life. TRENDS in Ecology & Evolution, 13(3):105-109, 1998.
27. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9(1):91-116, 1992.
28. M. Steel and T. Warnow. Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters, 48:77-82, 1993.