A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem

Details A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem

2008-05-02

arxiv.org/abs/0805.0202v1

Computer Science

Artificial Intelligence

Scientific paper

Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that satisfies the maximum number of quartets. A number of solutions have been proposed for the MQC problem, including Dynamic Programming, Constraint Programming, and more recently Answer Set Programming (ASP). ASP is currently the most efficient approach for optimally solving the MQC problem. This paper proposes encoding the MQC problem with pseudo-Boolean (PB) constraints. The use of PB allows solving the MQC problem with efficient PB solvers, and also allows considering different modeling approaches for the MQC problem. Initial results are promising, and suggest that PB can be an effective alternative for solving the MQC problem.

Affiliated with

Also associated with

No associations

Rating

A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem 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 A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341020