On the approximation of computing evolutionary trees

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 115-125

  Berry, Vincent ^a   Guillemot, Sylvain ^a   Nicolas, François ^a   Paul, Christophe ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIOTECHNOLOGY; COMPUTATIONAL METHODS; MORPHOLOGY; BIOINFORMATICS; COMBINATORIAL MATHEMATICS; FORESTRY;

COMPUTATIONAL BIOLOGY; EVOLUTIONARY TREES; HOMEOMORPHOLOGY; LEAF-LABELLED TREES; EVOLUTIONARY TREE; HARDNESS OF APPROXIMATION; LINEAR TIME; NUMBER OF TREES; ROOTED TREES; RUNNING TIME;

FORESTRY; TREES (MATHEMATICS);

ALGORITHMS; ANATOMY; BIOTECHNOLOGY; COMPUTATION; TREES;

EID: 26844583279     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_14     Document Type: Conference Paper

References (22)

1. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theor. Comput. Sci., 237(1-2): 123-134, 2000.
2. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithm. SIAM J. on Comput. 26(6):1656-1669, 1997.
3. V. Berry and F. Nicolas. Maximum agreement and compatible supertrees. In 15th Annual Symposium on Combinatorial Pattern Matching (CPM'04), volume 3109 of LNCS, pages 205-219, 2004.
4. V. Berry and F. Nicolas. Improved parametrized complexity of maximum agreement subtree and maximum compatible tree problems. IEEE Trans. on Comput. Biology and Bioinf., (to appear).
5. P. Bonizzoni, G. Della Vedova, and G. Mauri. Approximating the maximum isomorphic agreement subtree is hard. Int. J. of Found. of Comput. Sci., 11(4):579-590, 2000.
6. D. Bryant. Building trees, hunting for trees and comparing trees: theory and method in phylogenetic analysis. PhD thesis, University of Canterbury, Department of Mathemathics, 1997.
7. R. Cole, M. Farach-Colton, R. Hariharan, T. M. Przytycka, and M. Thorup. An O(n log n) algorithm for the Maximum Agreement SubTree problem for binary trees. SIAM J. on Comput., 30(5): 1385-1404, 2001.
8. G. F. Eastabrook and F. R. McMorris. When is one estimate of evolutionary relationships a refinement of another? J. of Math. Biol., 10:367-373, 1980.
9. L. Engebretsen and J. Holmerin. Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci., 299(1-3):537-584, 2003.
10. M. Farach, T. M. Przytycka, and M. Thorup. On the agreement of many trees. Inf. Proces. Letters, 55(6):297-301, 1995.
11. G. Ganapathy and T. J. Warnow. Approximating the complement of the maximum compatible subset of leaves of k trees. In 5th Int. Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'02), volume 2462 of LNCS, pages 122-134, 2002.
12. G. Ganapathysaravanabavan and T. J. Warnow. Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In 1st Int. Workshop on Algorithms in Bioinformatics (WABI'01), volume 2149 of LNCS, pages 156-163, 2001.
13. A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21(2):183-210, 1998.
14. M. M. Halldòrsson. Approximations of weighted independent set and hereditary subset problems. J. of Graph Algor. and Appl., 4(1), 2000.
15. A. M. Hamel and M. A. Steel. Finding a maximum compatible tree is NP-hard for sequences and trees. Appl. Math. Letters, 9(2):55-59, 1996.
16. 1-ε. Acta Math., 182:105-142, 1999.
17. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Disc. Appl. Math., 71(1-3):153-169, 1996.
18. J. Jansson, J. H.-K. Ng, K. Sadakane, and W.-K. Sung. Rooted maximum agreement supertrees. In 6th Latin American Symposium on Theoretical Informatics (LATIN'04), volume 2976 of LNCS, pages 499-508, 2004.
19. T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. on Comput., 24(5): 1122-1139, 1995.
20. 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 7th Annual European Symposium on Algorithms (ESA '99), volume 1643 of LNCS, pages 438-449, 1999.
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. of Algor., 40(2):212-233, 2001.
22. M. A. Steel and T. J. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Inf. Proces. Letters, 48(2):77-82, 1993.