Regular Article: Extension Operations on Sets of Leaf-Labeled Trees
Advances in Applied Mathematics
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics
A few logs suffice to build (almost) all trees: part II
Theoretical Computer Science
Some open problems in computational molecular biology
Journal of Algorithms
Algorithmic aspects of tree amalgamation
Journal of Algorithms
Inferring evolutionary trees with strong combinatorial evidence
Theoretical Computer Science - computing and combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A characterization for a set of partial partitions to define an X-tree
Discrete Mathematics
Quartet Cleaning: Improved Algorithms and Simulations
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A lookahead branch-and-bound algorithm for the maximum quartet consistency problem
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Unique perfect phylogeny is intractable
Theoretical Computer Science
| Hi-index | 0.00 |
We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide if another solution exists. We show first that a variation of Betweenness, which is the underlying problem of questions related to radiation hybrid mapping, is ASP-complete. Subsequently, we use that result to show that Quartet Compatibility, a fundamental problem in phylogenetics that asks whether a set of quartets can be represented by a parent tree, is also ASP-complete. The latter result shows that Steel's Quartet Challenge, which asks whether a solution to Quartet Compatibility is unique, is coNP-complete.