Unique perfect phylogeny is NP-hard
Populations and Evolution
2010-11-29 v1 Computational Complexity
Abstract
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that displays Q ?"
Cite
@article{arxiv.1011.5737,
title = {Unique perfect phylogeny is NP-hard},
author = {Michel Habib and Juraj Stacho},
journal= {arXiv preprint arXiv:1011.5737},
year = {2010}
}