Maximum agreement and compatible supertrees

Journal of Discrete Algorithms

Volumn 5, Issue 3, 2007, Pages 564-591

  Berry, Vincent ^a   Nicolas, François ^b  

^a LIRMM   (France)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Algorithms; Computational biology; Isomorphism and refinement relations; Supertrees; Trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GENETIC ENGINEERING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; MAST PROBLEM; MCT PROBLEM; PHYLOGENETICS;

DECISION TREES;

EID: 34248632522     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.08.005     Document Type: Article

References (38)

1. Aho A.V., Sagiv Y., Szymanski T.G., and Ullman J.D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing 10 3 (1981) 405-421
2. Amir A., and Keselman D. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithm. SIAM Journal on Computing 26 6 (1997) 1656-1669
3. Baum B.R. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41 (1992) 3-10
4. Baum B.R., and Ragan M.A. The MRP method. In: Bininda-Emonds O.R.P. (Ed). Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life (2004), Kluwer, Dordrecht 17-34
5. M. Bellare, S. Goldwasser, C. Lund, A. Russeli, Efficient probabilistically checkable proofs and applications to approximations, in: Proc. of the 25th Annual A.C.M. Symposium on Theory of Computing (STOC'93), 1993, pp. 294-304
6. Berger-Wolf T. Online consensus and agreement of phylogenetic trees. Proc. of the 4th Workshop on Algorithms in Bioinformatics (WABI'04). Lecture Notes in Computer Science vol. 3240 (2004), Springer, Berlin 350-361
7. Berry V., Guillemot S., Nicolas F., and Paul C. On the approximation of computing evolutionary trees. In: Wang L. (Ed). Proc. of the 11th Annual International Conference on Computing and Combinatorics (COCOON'05). Lecture Notes in Computer Science vol. 3595 (2005), Springer, Berlin 115-125
8. Berry V., and Nicolas F. Improved parametrized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 3 (2006) 289-302
9. In: Bininda-Edmonds O.R.P. (Ed). Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology Series vol. 4 (2004), Kluwer Academic, Dordrecht
10. Bininda-Edmonds O.R.P., Gittleman J.L., and Steel M.A. The (super)tree of life: procedures, problems, and prospects. Annual Review of Ecology and Systematics 33 (2002) 265-289
11. Bininda-Edmonds O.R.P., and Sanderson M.J. Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Systematic Biology 50 4 (2001) 565-579
12. D. Bryant, Building trees, hunting for trees and comparing trees: theory and method in phylogenetic analysis, PhD thesis, University of Canterbury, Department of Mathematics, 1997
13. Bryant D., and Steel M.A. Extension operations on sets of leaf-labelled trees. Advances in Applied Mathematics 16 4 (1995) 425-453
14. Cole R., Farach-Colton M., Hariharan R., Przytycka T.M., and Thorup M. An O(n log n) algorithm for the Maximum Agreement SubTree problem for binary trees. SIAM Journal on Computing 30 5 (2001) 1385-1404
15. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press, Cambridge, MA
16. U. Feige, M.M. Halldórsson, G. Kortsarz, Approximating the domatic number, in: Proc. of the 32nd Annual A.C.M. Symposium on Theory of Computing (STOC'00), 2000, pp. 134-143
17. Finden C.R., and Gordon A.D. Obtaining common pruned trees. Journal of Classification 2 (1985) 255-276
18. G. Ganapathy, T.J. Warnow, Approximating the complement of the maximum compatible subset of leaves of k trees, in: Proc. of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'02), 2002, pp. 122-134
19. G. Ganapathysaravanabavan, T.J. Warnow, Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time, in: O. Gascuel, B.M.E. Moret, (Eds.), Proc. of the 1st International Workshop on Algorithms in Bioinformatics (WABI'01), 2001, pp. 156-163
20. Ga̧sieniec L., Jansson J., Lingas A., and Östlin A. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization 3 2-3 (1999) 183-197
21. Gordon A.G. Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labelled leaves. Journal of Classification 3 (1986) 335-348
22. S. Guillemot, F. Nicolas, Tight bounds on the complexity of the maximum agreement subtree and maximum compatible tree problems, Technical Report, LIRMM, Univ. of Montpellier, 2005
23. Gupta A., and Nishimura N. Finding largest subtrees and smallest supertrees. Algorithmica 21 2 (1998) 183-210
24. Hamel A.M., and Steel M.A. Finding a maximum compatible tree is NP-hard for sequences and trees. Applied Mathematics Letters 9 2 (1996) 55-59
25. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestor. SIAM Journal on Computing 13 2 (1984) 338-355
26. Hein J., Jiang T., Wang L., and Zhang K. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics 71 1-3 (1996) 153-169
27. J. Jansson, A. Lingas, E.-L. Lundell, A triplet approach to approximations of evolutionary trees, in: Proc. of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB'04), 2004
28. Jansson J., Ng J.H.-K., Sadakane K., and Sung W.-K. Rooted maximum agreement supertrees. Algorithmica 43 4 (2005) 293-307
29. M.-Y. Kao, T.W. Lam, W.-K. Sung, H.-F. Ting, A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees, in: Proc. of the 7th Annual European Symposium on Algorithms (ESA'99), 1999, pp. 438-449
30. Kao M.-Y., Lam T.W., Sung W.-K., and Ting H.-F. An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. Journal of Algorithms 40 2 (2001) 212-233
31. In: Littlewood D.T.J., and Bray R.A. (Eds). Interrelationships of the Platyhelminthes. Systematics Association Special Volumes vol. 60 (2000), CRC Press, London (Chapter 27, Towards a phylogenetic supertree of Platyhelminthes?)
32. R.D.M. Page, Modified mincut supertrees, in: R. Guigó, D. Gusfield, (Eds.), Proc. of the 2nd International Workshop on Algorithms in Bioinformatics (WABI'02), 2002, pp. 537-552
33. Z.S. Peng, H.F. Ting, An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees, in: Proc. of the 15th International Symposium on Algorithms and Computations (ISAAC'04), 2004, pp. 754-765
34. Ragan M.A. Matrix representation in reconstructing phylogenetic relationships among the eukaryots. Biosystems 28 1-3 (1992) 47-55
35. V. Ranwez, V. Berry, S. Guillemot, A. Criscuolo, E.J.P. Douzery, Vote or veto: desirable properties for supertree methods, LIRMM, ISEM, Université Montpellier 2, 2006, submitted for publication
36. Semple C., and Steel M. Phylogenetics. Oxford Lecture Series in Mathematics and its Applications vol. 24 (2003), Oxford University Press, Oxford
37. Thorley J.L., and Wilkinson M. A view of supertrees methods. In: Janowitz M.F., Lapointe H.F.-J., McMorris F.R., and Roberts F.S. (Eds). Bioconsensus. Discrete Mathematics and Theoretical Computer Science vol. 61 (2003), DIMACS 185-194
38. http://tolweb.org/tree/phylogeny.html