Mod/Resc Parsimony Inference - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Mod/Resc Parsimony Inference

Abstract

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 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 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 Bipartite Biclique Edge Cover. Finally, we present experimental results where we applied some of our techniques to a real-life data set.
Fichier principal
Vignette du fichier
Mod-Resc.pdf (324.47 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00681830 , version 1 (22-03-2012)

Identifiers

Cite

Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, et al.. Mod/Resc Parsimony Inference. Combinatorial Pattern Matching, Jun 2010, New York, United States. pp.202--213, ⟨10.1007/978-3-642-13509-5_19⟩. ⟨hal-00681830⟩
351 View
169 Download

Altmetric

Share

Gmail Facebook X LinkedIn More