The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility

Details The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility

2011-01-11

arxiv.org/abs/1101.2170v2

Biology

Quantitative Biology

Populations and Evolution

25 pages, 7 figures

Scientific paper

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 \sc Quartet Challenge, which asks whether a solution to Quartet Compatibility is unique, is coNP-complete.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160942