Finding a maximum likelihood tree is hard

Journal of the ACM

Volumn 53, Issue 5, 2006, Pages 722-744

  Chor, Benny ^a   Tuller, Tamir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximate vertex cover; Intractability; Maximum likelihood; Maximum parsimony; Tree reconstruction

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING;

APPROXIMATE VERTEX COVER; INTRACTABILITY; MAXIMUM PARSIMONY; TREE RECONSTRUCTION;

TREES (MATHEMATICS);

EID: 33845335476     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1183907.1183909     Document Type: Article

References (26)

1. ADDARIO-BERRY, L., CHOR, B., HALLETT, M., LAGERGREN, J., PANCONESI, A., AND WAREHAM, T. 2004. Ancestral maximum likelihood of evolutionary trees is hard. J. Bioinf. Comput. Biol. 2, 2, 257-271.
2. BERMAN P., AND KARPINSKI, M. 1999. On some tighter inapproximability results. In Proceedings of the 25th International Colloquium on Automatic Languages, and Programing. Lecture Notes in Computer Science. Springer-Verlag, New York.
3. CHOR, B., HENDY, M. D., HOLLAND, B. R., AND PENNY, D. 2000. Multiple maxima of likelihood in phylogenetic trees: An analytic approach. Mol. Biol. Evol. 17, 10, 1529-1541.
4. CHOR B. AND TULLER, T. 2005. Maximum likelihood of evolutionary trees: Hardness and approximation. Bioinformatics 21, 1, i97-i106.
5. DAY, W. 1987. The computational complexity of inferring phylogenies from dissimilarity matrix. Bull. Math. Biol. 49, 4, 461-467.
6. DAY, W., JOHNSON, D., AND SANKOFF, D. 1986. The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences 81, 33-42.
7. DAY W., AND SANKOFF, D. 1986. The computational complexity of inferring phylogenies by compatibility. Syst. Zool. 35, 2, 224-229.
8. DINUR I., AND SAFRA, S. 2005. On the importance of being biased (1.36 hardness of approximating vertex-cover). Ann. Math. 162, 439-485.
9. EDWARDS, A. W. F. 1972. Likelihood. Cambridge University Press, Cambridge, UK.
10. FELSENSTEIN, J. 1981. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 77, 368-376.
11. FELSENSTEIN, J. 1996. Inferring phylogenies from protein sequences by parsimony, distance, and likelihood methods. Meth. Enzym. 266, 419-427.
12. FELSENSTEIN, J. 2004. Inferring Phylogenies. Sinauer Associates, Sunderland, MA.
13. FITCH, W. M. 1971. Toward defining the course of evolution: Minimum change for specified tree topology. Syst. Zool. 20, 406-416.
14. FOULDS, L., AND GRAHAM, R. 1982. The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3, 43-49.
15. HASTAD, J. 2001. Some optimal inapproximability results. J. ACM 48, 798-859.
16. JUKES, T. H. AND CANTOR, C. R. 1969. Evolution of protein molecules. In Mammalian Protein Metabolism. H. N. Munro, Ed. Academic Press, New York, pp. 21-132.
17. KARPINSKI, M. 2001. Approximating bounded degree instances of np-hard problems. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
18. KOSHI, M., AND GOLDSTEIN, R. 1996. Probabilistic reconstruction of ancestral nucleotide and amino acid sequences. J. Molec. Evol. 42, 313-320.
19. NEYMAN, J. 1971. Molecular studies of evolution: A source of novel statistical problems. In Statistical Decision Theory and Related Topics, S. Gupta and Y. Jackel, Eds. Academic Press, New York, pp. 1-27.
20. ROCH, S. 2006. A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE/ACM Trans. Comput. Biol. Bioinformat. 3, 1, 92-94. accepted.
21. STEEL, M. 1992. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9, 71-90.
22. STEEL, M. 1994. The maximum likelihood point for a phlogenetic tree is not unique. Syst. Biol., 43, 560-564,
23. STEEL, M., AND PENNY, D. 2000. Parsimony, likelihood and the role of models in molecular phylogenetics. Mol. Biol. Evol. 17, 839-850.
24. TUFFLEY, C., AND STEEL, M. 1997. Link between maximum likelihood and maximum parsimony under a simple model of site substitution. Bull. Math. Biol. 59, 3, 581-607.
25. WAREHAM, T. 1993. On the computational complexity of inferring evolutional trees. Tech. Rep. 93-01. Dep. Computer Science, Memorial University of Newfoundland.
26. YANG, Z., KUMAR, S., AND NEI, M. 1995. A new method of inferring of ancestral nucleotide and amino acid sequences. Genetics 141, 1641-1650.