A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。