Approximating the maximum isomorphic agreement subtree is hard

International Journal of Foundations of Computer Science

Volumn 11, Issue 4, 2000, Pages 579-590

  Bonizzoni, Paola ^a   Vedova, Gianluca Della ^a   Mauri, Giancarlo ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

bioinformatics; computational complexity; evolutionary tree comparison; inapproximability

Indexed keywords

EID: 26844564381     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000363     Document Type: Article

References (34)

1. 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.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Journal of ACM, 45(3):501-555, 1998.
3. A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pellep. Prom four-1axon trees to phylogenies: The case of mammalian evolution. In Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, pages 9-19, 1998.
4. V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. In Proceedings of the 3rd International Computing and Combinatorics Conference, pages 111-120, 1997.
5. P. Buneman. The recovery of trees from measures of dissimilarity. In Hodson, Kendall, and Tautu, editors, Mathematics in the Archaeological and Historical Sciences. Edinburgh University Press, 1971.
6. R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup. An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. SI AM Journal on Computing, to appear.
7. R. Cole and R. Hariharan. An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. In Proc. of the 1th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA96), pages 323-332, 1996.
8. P. Erdos, M. Steel, L. Szekely, and T. Warnow. Constructing big trees from short sequences. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming, pages 827-837, 1997.
9. P. Erdos, M. Steel, L. A. Szekely, and T. Warnow. Constructing big trees from short sequences. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, volume 1256 of Lecture Notes in Computer Science, pages 827-837, 1997.
10. M. Farach, T. M. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55(6):297-301, 1995.
11. M. Farach and M. Thorup. Fast comparison of evolutionary trees. Information and Computation, 123(l):29-37, 1995.
12. M. Farach and M. Thorup. Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing
13. J. Felsenstein. Cases in which parsimony and compatibility will be positively misleading. Systematic Zoology, 27:401-410, 1978.
14. J. Felsenstein. Evolutionary trees from DNA sequences: A maximal likelihood approach. Journal of Molecular Evolution, 17:368-386, 1981.
15. J. Felsenstein. Numerical methods for inferring evolutionary trees. Quart. Rev. Biol., pages 379-404, 1982.
16. C. Finden and A. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
17. W. M. Fitch. Toward defining the course of evolution: Minimal change for a specific tree topology. Systematic zoology, 20:406-441, 1971.
18. M. Garey and D. Johnson. Computer and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, 1979.
19. L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2/3):183-197, 1999.
20. J. Hastad. Clique is hard to approximate within n1 - e . Acta Mathematica, to appear.
21. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71:153-169, 1996.
22. V. Kann. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37(l):27-35, 1991.
23. V. Kann. On the approximability of the maximum common subgraph problem. In Proc. 9th Ann. Symp. on Theoretical Aspects of Comput. Sci. (STACS92), volume 577 of LNCS, pages 377-388, 1992.
24. M.-Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, to appear.
25. M.-Y. Kao, T. W. Lam, T. M. Przytycka, W.-K. Sung, and H.-F. Ting. General techniques for comparing unrooted evolutionary trees. In Proceedings of the 29th Symposium on the Theory of Computing (STOC97), pages 54-65, 1997.
26. D. Karger, R. Motwani, and G. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(l):82-98, 1997.
27. P. Kearney. The ordinal quartet method. In Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, pages 125-134, 1998.
28. E. Kubicka, G. Kubicki, and F. McMorris. An algorithm to find agreement subtrees. Journal of Classification, 12(l):91-99, 1995.
29. T. Lam, W. Sung, and H. Ting. Computing the unrooted maximum agreement subtree in subquadratic time. In Proc. of the bth Scandinavian Workshop on Algorithms Theory, LNCS, pages 124-135, 1996.
30. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
31. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406-425, 1987.
32. E. Smolenskii. Jurnal Vicisl. Mat i Matem. Fiz., 2(2):371-372, 1962.
33. M. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48(2):77-82, 1993.
34. K. Strimmer and A. von Haeseler. Quartet puzzling: A quartet maximumlikelihood method for reconstructing tree topologies. Molecular Biology and Evolution, 13(7):964-969, 1996.