Mod/Resc Parsimony Inference

Details Mod/Resc Parsimony Inference Mod/Resc Parsimony Inference

2010-02-05

arxiv.org/abs/1002.1292v2

Computer Science

Data Structures and Algorithms

11 pages, 3 figures

Scientific paper

We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc Parsimony Inference}, we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these matrices gives back the input. We show that this is formally equivalent to the \textsc{Bipartite Biclique Edge Cover} problem and derive some complexity results for our problem using this equivalence. We provide a new, fixed-parameter tractability approach for solving both that slightly improves upon a previously published algorithm for the \textsc{Bipartite Biclique Edge Cover}. Finally, we present experimental results where we applied some of our techniques to a real-life data set.

Affiliated with

Also associated with

No associations

Rating

Mod/Resc Parsimony Inference 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 Mod/Resc Parsimony Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mod/Resc Parsimony Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536241