A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard
classification
🧮 math.PR
cs.CCcs.CEmath.STq-bio.PEstat.TH
keywords
likelihoodmaximumproofshorttreealthoughbeencomputing
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.