Unique perfect phylogeny is NP-hard

Authors:
Michel Habib;Juraj Stacho
Affiliations:
LIAFA, CNRS and Université Paris Diderot-Paris VII, Paris Cedex 13, France;Caesarea Rothschild Institute, University of Haifa, Haifa, Israel
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 13
Cited 3

Triangulating 3-colored graphs

SIAM Journal on Discrete Mathematics
Complexity and algorithms for reasoning about time: a graph-theoretic approach

Journal of the ACM (JACM)
Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

SIAM Journal on Computing
Graph sandwich problems

Journal of Algorithms
Complexity of generalized satisfiability counting problems

Information and Computation
Algorithmic aspects of tree amalgamation

Journal of Algorithms
A characterization for a set of partial partitions to define an X-tree

Discrete Mathematics
Dichotomy Theorem for the Generalized Unique Satisfiability Problem

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Competitive graph searches

Theoretical Computer Science
Generalizing the four gamete condition and splits equivalence theorem: perfect phylogeny on three state characters

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics

On a conjecture about compatibility of multi-states characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Unique perfect phylogeny is intractable

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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?" [28, 29] As a particular consequence of this, we show that the unique chordal sandwich problem is also NP-hard.