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

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

2005-04-19

arxiv.org/abs/math/0504378v2

Mathematics

Probability

6 pages; Corrected typos and notational problem

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40129