CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2006 vol.3 Issue No.01 - January-March
Issue No.01 - January-March (2006 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2006.4
Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel.
Analysis of algorithms and problem complexity, probability and statistics, biology and genetics.
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. 92-94, January-March 2006, doi:10.1109/TCBB.2006.4