Maximum agreement and compatible supertrees

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

Volumn 3109, Issue , 2004, Pages 205-219

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

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FORESTRY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

COMMON REFINEMENT; CONSTANT FACTORS; EXACT ALGORITHMS; EXTENDED ABSTRACTS; FIXED-PARAMETER TRACTABILITY; NON-IDENTICAL; POLYNOMIAL-TIME; TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 35048864350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_15     Document Type: Article

References (36)

1. J. Alber, Gramm J., and R. Niedermeier. Faster exact algorithms for hard problems: a parameterized point of view. Disc. Math., 229:3-27, 2001.
2. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithm. SIAM J. on Comp., 26(3):1656-1669, 1997.
3. B.R. Baum. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon, 41:3-10, 1992.
4. M. Bellare, S. Goldwasser, C. Lund, and A. Russeli. Efficient probabilistically checkable proofs and applications to approximations. In Proceedings of the Twenty-Fifth Annual A.C.M. Symposium on Theory of Computing, pages294-304, 1993.
5. V. Berry and F. Nicolas. Maximum agreement and compatible supertrees. (available from http://www.lirmm.fr/~vberry) 04045, LIRMM, 2004.
6. O.R.P. Bininda-Edmonds and H.N. Bryant. Properties of matrix representation with parsimony analyses. Syst. Biol., 47:497-508, 1998.
7. O.R.P. Bininda-Edmonds, J.L. Gittleman, and M.A. Steel. The (super)tree of life: procedures, problems, and prospects. Ann. Rev. Ecol. Syst., 2002.
8. O.R.P. Bininda-Edmonds and M.J. Sanderson. Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Syst. Biol., 50(4):565-579, 2001.
9. D. Bryant. Building trees, hunting for trees and comparing trees. PhD thesis, University of Canterbury, Department of Math., 1997.
10. D. Bryant and M.A. Steel. Extension operations on sets of leaf-labelled trees. Adv. Appl. Math., 16:425-453, 1995.
11. D. Chen, L. Diao, O. Eulenstein, and D. Fernandez-Baca. Flipping: a supertree construction method. DIMACS Series in Disc. Math. and Theor. Comp. Sci., 61:135-160, 2003.
12. R. Cole, M. Farach, R. Hartigan, Przytycka T., 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, 2001.
13. R. Cole and R. Hariharan. Dynamic lea queries on trees. In Proc. of the 10th ann. ACM-SIAM symp. on Disc. alg. (SODA'99),pages 235 - 244, 1999.
14. R.G. Downey, M.R. Fellows, and U. Stege. Computational tractability: The view from mars. Bull. of the Europ. Assoc. for Theoret. Comp. Sci., 69:73-97, 1999.
15. M. Farach, T. Przytycka, and M. Thorup. Agreement of many bounded degree evolutionary trees. Inf. Proc. Letters, 55(6):297-301, 1995.
16. G. Ganapathysaravanabavan and T. Warnow. Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In O. Gascuel and B.M.E. Moret, editors, Proc. of the Workshop on Algorithms for Bioinformatics (WABI'01), volume 2149 of LNCS, pages 156-163, 2001.
17. L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. J. of Combin. Optim., 3:183-197, 1999.
18. A.G. Gordon. Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labelled leaves. J. of Classif., 3:335-346, 1986.
19. A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21(2):183-210, 1998.
20. D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:19-28, 1991.
21. A.M. Hamel and M.A. Steel. Finding a maximum compatible tree is NP-hard for sequences and trees. Appl. Math. Lett., 9(2):55-59, 1996.
22. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestor. Computer and System Science, 13:338-355, 1984.
23. J. Hein, T. Jiang, L. Wang, and Zhang K. On the complexity of comparing evolutionary trees. Disc. Appl. Math., 71:153-169, 1996.
24. J. Jansson, J. H.-K. Ng, K. Sadakane, and W.-K. Sung. Rooted maximum agreement supertrees. In Proceedings of the Sixth Latin American Symposium on Theoretical Informatics (LATIN), 2004. (in press).
25. M.Y. Kao, T.W. Lam, W.K. Sung, and H.F. Ting. A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees. In Proc. of the 8th Ann. Europ. Symp. Alg. (ESA), pages 438-449. Springer-Verlag, New York, NY, 1999.
26. 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. of Algo., 40:212-233, 2001.
27. R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 1:89-102, 2003.
28. R. Page. Modified mincut supertrees. In O. Gascuel and M.-F. Sagot, editors, Proc. of the Workshop on Algorithms for Bioinformatics (WABI'02), LNCS, pages 538-551. Springer-Verlag, 2002.
29. A. Purvis. A modification to Baum and Ragan's method for combining phylogenetic trees. Syst. Biol., 44:251-255, 1995.
30. M.A. Ragan. Matrix representation in reconstructing phylogenetic relationships among the eukaryots. Biosystems, 28:47-55, 1992.
31. F. Ronquist. Matrix representation of trees, redundancy, and weighting. Syst. Biol. 45:247-253, 1996.
32. C. Semple and M.A. Steel. A supertree method for rooted trees. Disc. Appl. Math., 105:147-158, 2000.
33. M.A. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48:77-82, 1993.
34. J.L. Thorley and M. Wilkinson. A view of supertrees methods. In Bioconsensus, DIMACS, volume 61, pages 185-194. Amer. Math. Soc. Pub., 2003.
35. T. J. Warnow. Tree compatibility and inferring evolutionary history. Journal of Algorithms, 16:388-407, 1994.
36. M. Wilkinson, J. Thorley, D.T.J. Littlewood, and R.A. Bray. Interrelationships of the Platyhelminthes, chapter 27, Towards a phylogenetic supertree of Platyhelminthes. Taylor and Francis, London, 2001.