
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sebastien Roch, "A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 9294, JanuaryMarch, 2006.  
BibTex  x  
@article{ 10.1109/TCBB.2006.4, author = {Sebastien Roch}, title = {A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {3}, number = {1}, issn = {15455963}, year = {2006}, pages = {9294}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2006.4}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard IS  1 SN  15455963 SP92 EP94 EPD  9294 A1  Sebastien Roch, PY  2006 KW  Analysis of algorithms and problem complexity KW  probability and statistics KW  biology and genetics. VL  3 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] L. AddarioBerry, B. Chor, M.T. Hallett, J. Lagergren, A. Panconesi, and T. Wareham, “Ancestral Maximum Likelihood of Evolutionary Trees is Hard,” J. Bioinformatics and Computational Biology, vol. 2, no. 2, pp. 257271, 2004.
[2] R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup, “On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics),” SIAM J. Computing, vol. 28, pp. 10731085, 1999.
[3] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. MarchettiSpaccamela, and M. Protasi, Complexity and Approximation. Berlin: Springer, 1999.
[4] J. Cavender, “Taxonomy with Confidence,” Math. Biosciences, vol. 40, pp. 271280, 1978.
[5] B. Chor and T. Tuller, “Maximum Likelihood of Evolutionary Trees is Hard,” Proc. Ninth Int'l Conf. Computational Molecular Biology (RECOMB 2005), 2005.
[6] A. Clementi and L. Trevisan, “Improved NonApproximability Results for Minimum Vertex Cover with Density Constraints,” Theoretical Computer Science, vol. 225, nos. 12, pp. 113128, 1999.
[7] W. Day, D. Jonhson, and D. Sankoff, “The Computational Complexity of Inferring Rooted Phylogenies by Parsimony,” Math. Biosciences, vol. 81, pp. 3342, 1986.
[8] W. Day and D. Sankoff, “The Computational Complexity of Inferring Phylogenies by Compatibility,” Systematic Zoology, vol. 35, pp. 224229, 1986.
[9] A.W.F. Edwards and L.L. CavalliSforza, “Reconstruction of Evolutionary Trees,” Phenetic and Phylogenetic Classification, V.H. Heywood and J. McNeill, eds. Systematics Assoc., London, vol. 6, pp. 6776, 1964.
[10] J.S. Farris, “A Probability Model for Inferring Evolutionary Trees,” Systematic Zoology, vol. 22, pp. 250256, 1973.
[11] J. Felsenstein, “Evolutionary Trees from DNA Sequences: A Maximum Likelihood Approach,” J. Molecular Evolution, vol. 17, pp. 368376, 1981.
[12] J. Felsenstein, Inferring Phylogenies. Sunderland: Sinauer Assoc., 2004.
[13] L. Foulds and R. Graham, “The Steiner Problem in Phylogeny is NPComplete,” Advances in Applied Math., vol. 3, pp. 4349, 1982.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NPCompleteness, San Francisco: W.H. Freeman, 1976.
[15] J. Neyman, “Molecular Studies of Evolution: A Source of Novel Statistical Problems,” Statistical Decision Theory and Related Topics, S.S. Gupta and J. Yackel, eds. New York: Academic Press, pp. 127, 1971.
[16] C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
[17] C. Tuffley and M. Steel, “Links between Maximum Likelihood and Maximum Parsimony under a Simple Model of Site Substitution,” Bull. Math. Biology, vol. 59, no. 3, pp. 581607, 1997.
[18] H.T. Wareham, On the Computational Complexity of Inferring Evolutionary Trees, MSc thesis, Technical Report no. 9301, Dept. of Computer Science, Memorial Univ. of Newfoundland 1993.