A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard
<|reference_start|>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.<|reference_end|>
@article{roch2005a,
    title={A Short Proof that Phylogenetic Tree Reconstruction by Maximum
  Likelihood is Hard},
    author={S. Roch},
    journal={arXiv preprint arXiv:math/0504378},
    year={2005},
    archivePrefix={arXiv},
    eprint={math/0504378},
    primaryClass={math.PR cs.CC cs.CE math.ST q-bio.PE stat.TH}
}