Maximum likelihood of evolutionary trees: Hardness and approximation

Bioinformatics

Volumn 21, Issue SUPPL. 1, 2005, Pages

  Chor, Benny ^a   Tuller, Tamir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOINFORMATICS; COMPUTER ANALYSIS; CONTROLLED STUDY; DNA SEQUENCE; INFORMATION PROCESSING; MOLECULAR CLOCK; NONHUMAN; NUCLEOTIDE SEQUENCE; PARSIMONY ANALYSIS; PHYLOGENETIC TREE; PRIORITY JOURNAL; SEQUENCE ANALYSIS;

APPROXIMATION RATIOS; EVOLUTIONARY TREE; INPUT SEQUENCE; LOG LIKELIHOOD; MOLECULAR CLOCK; MULTIPLICATIVE FACTORS; NP-HARD; OPTIMALITY CRITERIA; REAL DATA SETS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORESTRY; INTELLIGENT SYSTEMS; MAXIMUM LIKELIHOOD; MOLECULAR BIOLOGY; MOLECULAR STRUCTURE;

TREES (MATHEMATICS);

EID: 29144484019     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti1027     Document Type: Article

References (42)

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. Bioinform. Comput. Biol., 2(3), 257-271.
2. Apoil,P., Roubinet,F., Despiau,S., Mollicone,R., Oriol,R. and Blancher,A. (2000) Evolution of 2-fucosyltransferase genes in primates: relation between an intronic Alu-Y element and red cell expression of ABH. Mol. Biol. Evol., 17, 337-351.
3. Ausiello,G., Crescenzi,P., Gambosi,G., Kann,V., Marchetti-Spaccamela,A. and Protasi,M. (1998) Complexity and Approximation, Springer, Berlin.
4. Berman,P. and Karpinski,M. (1999) On some tighter inapproximability results. In Proceedings of the 26th ICALP, (ICALP 1999), pp. 200-209.
5. Bonet,M., Steel,M., Warnow,T. and Yooseph,S. (1998) Faster algorithms for solving parsimony and compatibility. J. Comput. Biol., 5(3), 409-422.
6. Chang,J.T. (1996) Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency. Math. Biosci., 137, 51-73.
7. 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, 1529-1541.
8. Chor,B. and Tuller,T. (2005) Maximum likelihood of evolutionary trees is hard. In Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB05), May 2005.
9. Csuros,M. and Kao,M.Y. (2001) Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets. SIAM J. Comput., 31, 306-322.
10. Day,W. (1987) The computational complexity of inferring phylogenies from dissimilarity matrix. Bull. Math. Biol., 49, 461-467.
11. Day,W. and Sankoff,D. (1986) The computational complexity of inferring phylogenies by compatibility. Syst. Zool., 35, 224-229.
12. Day,W., Johnson,D. and Sankoff,D. (1986) The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci., 81, 33-42.
13. Erdos,P.L., Steel,M.A., Szekely,L.A. and Warnow,T.J. (1999a) A few logs suffice to build (almost) all trees: Part 1. Random Struct. Algorithms, 221, 153-184.
14. Erdos,P.L., Steel,M.A., Szekely,L.A. and Warnow,T.J. (1999b) A few logs suffice to build (almost) all trees: Part 2. Theoret. Comput. Sci., 221, 77-118.
15. Felsenstein,J. (1981) Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol., 17, 368-376.
16. Felsenstein,J. (1996) Inferring phylogenies from protein sequences by parsimony, distance, and likelihood methods. In Doolittle,R.F. (ed.), Computer Methods for Macromolecular Sequence Analysis Methods in Enzymology, Academic Press, Orlando, Florida, Vol. 266, pp. 418-427.
17. Fitch,W.M. (1971) Toward defining the course of evolution: Minimum change for specified tree topology. Syst. Zool., 20, 406-416.
18. Foulds,L. and Graham,R. (1982) The steiner problem in phylogeny is NP-complete. Adv. Appl. Math., 3, 43-49.
19. Gaunt,M.W. and Miles,M.A. (2002) An insect molecular clock dates the origin of the insects and accords with palaeontological and biogeographic landmarks. Mol. Biol. Evol., 19, 748-761.
20. Goodman,M. (1981) Globin evolution was apparently very rapid in early vertebrates: A reasonable case against the rate-constancy hypothesis. J. Mol. Evol., 17, 114-120.
21. Graur,D. and Li,W.H. (1999) Fundamentals of Molecular Evolution, 2nd edn. Sinauer, Sunderland, MA.
22. Hendy,M.D. and Holland,B.R. (2003) Upper bounds on maximum likelihood for phylogenetic trees. Bioinformatics, 19, 66-72.
23. Hendy,M.D. and Penny,D. (1993) Spectral analysis of phylogenetic data. J. Classif., 10, 5-24.
24. Hendy,M.D. Penny,D. and Steel,M.A. (1994) A discrete fourier analysis for evolutionary trees. Proc. Natl Acad. Sci. USA, 91, 3339-3343.
25. Jukes,T.H. and Cantor,C.R. (1969) Evolution of protein molecules. In Munro,H.N. (ed.), Mammalian Protein Metabolism. Academic Press, NY, pp. 21-132.
26. Karpinski,M. (2001) Approximating bounded degree instances of NP-hard problems. In Proceedings of the 13th Symposium on Fundamentals of Computation Theory (FCT), LNCS 2138. Springer, Berlin.
27. Kearns,M., Mansour,Y., Ron,D., Rubinfeld,R., Schapire,R.E. and Sellie,L. (1994) On the learnability of discrete distributions. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC94). ACM, New York.
28. Kumar,S., Tamura,K. and Nei,M. (1994) MEGA: Molecular Evolutionary Genetics Analysis software for microcomputers. Comput. Appl. Biosci., 10, 189-191.
29. Miyamoto,M., Koop,B.F., Slightom,J.L, Goodman,M. and Tennant,M.R. (1988) Molecular systematics of higher primates: Genealogical relations and classification. Proc. Natl Acad. Sci. USA, 85, 7625-7631.
30. Margoliash,E. (1963) Primary structure and evolution of cytochrome. Proc. Natl Acad. Sci. USA, 50, 672-679.
31. Neyman,J. (1971) Molecular studies of evolution: A source of novel statistical problems. In Gupta,S. and Jackel,Y. (ed.), Statistical Decision Theory and Related Topics. Academic Press, NY, pp. 1-27.
32. Nei,M., Kumar,S. and Kumar,S. (2000) Molecular Evolution and Phylogenetics. Oxford University Press, NY.
33. Papadimitriou,C.H (1993) Computational Complexity. Addison-Wesley, Redwood city, CA.
34. Steel,M. (1992) The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif., 9, 71-90.
35. Steel,M. (1994) The maximum likelihood point for phylogenetic tree is not unique. Syst. Biol., 43, 560-564.
36. Steel,M. and Penny,D. (2000) Parsimony, likelihood and the role of models in molecular phylogenetics. Mol. Biol. Evol., 17, 839-850.
37. Steel,M. and Szekely,L.A. (2002) Inverting random functions (2): explicit bounds for discrete maximum likelihood estimation, with applications. SIAM J. Discr. Math., 15, 562-575.
38. Tuffely,C. and Steel,M. (1997) Links between maximum likelihood and maximum parsimony under a simple model of site substitution. Bull. Math. Biol., 59, 581-607.
39. Wareham,T. (1993) On the computational complexity of inferring evolutional trees. Technical Report 93-01, Department of computer science, Memorial University of Newfoundland.
40. Yoder,A.D. Yang,Z. (2000) Estimation of primate speciation dates using local molecular clocks. Mol. Biol. Evol., 17, 1081-1090.
41. Zuckerkandl,E. and Pauling,L. (1962) Molecular disease, evolution and genetic heterogeneity. In Kasha,M. and Pullman (eds), Horizons in Biochemistry, Academic Press, NY, pp. 189-225.
42. Zuckerkandl,E. and Pauling,L. (1965) Evolutionary divergence and convergence in proteins. In Bryson,V. and Vogels,H.J. (eds), Evolving Genes and Proteins. Academic Press, NY, pp. 97-166.