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.
Type de document :
Communication dans un congrès
Combinatorial Pattern Matching, Jun 2010, New York, United States. Springer Verlag, 6129, pp.202--213, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-13509-5_19〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00681830
Contributeur : Marie-France Sagot <>
Soumis le : jeudi 22 mars 2012 - 15:34:21
Dernière modification le : mardi 20 novembre 2018 - 09:32:15
Document(s) archivé(s) le : samedi 23 juin 2012 - 02:35:39

Fichier

Mod-Resc.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

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. Springer Verlag, 6129, pp.202--213, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-13509-5_19〉. 〈hal-00681830〉

Partager

Métriques

Consultations de la notice

766

Téléchargements de fichiers

139