A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard

S. Roch

A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard

概率论 2011-09-30 v2 计算复杂性计算工程、金融与科学统计理论种群与进化统计理论

作者: S. Roch

摘要

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.

引用

@article{arxiv.math/0504378,
  title  = {A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard},
  author = {S. Roch},
  journal= {arXiv preprint arXiv:math/0504378},
  year   = {2011}
}

备注

6 pages; Corrected typos and notational problem

相关论文

查看更多相关论文 →