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 and a collection of quartet subtrees on X , is the only tree that displays ?" [28, 29] As a particular consequence of this, we show that the unique chordal sandwich problem is also NP-hard. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Habib, M., & Stacho, J. (2011). Unique perfect phylogeny is NP-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 132–146). https://doi.org/10.1007/978-3-642-21458-5_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free