January 1, 2006

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

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

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.

Preguntar a la IA

Me gusta

Guardar

Cite This Study

Sébastien Roch (Sun,) studied this question.

synapsesocial.com/papers/6a0c72c795872b300be8b809 https://doi.org/https://doi.org/10.1109/tcbb.2006.4

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Maximum Likelihood of Evolutionary Trees Is Hard2005 · 70 citations
2On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)1998 · 116 citations
3Computational Complexity of Inferring Phylogenies by Compatibility1986 · 128 citations
4Reconstruction of evolutionary trees2018 · 300 citations
5Complexity and approximation: Combinatorial optimization problems and their approximability properties2000 · 1,289 citations

Preguntar a la IA

Me gusta

Guardar