Mod/Resc Parsimony Inference

  • Igor Nor
  • Danny Hermelin
  • Sylvain Charlat
  • Jan Engelstadter
  • Max Reuter
  • Olivier Duron
  • Marie-France Sagot
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6129)


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.


Computational biology biclique edge covering bipartite graph boolean matrix NP-completeness graph theory fixed-parameter tractability kernelization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bordenstein, S.R., Werren, J.H.: Bidirectional incompatibility among divergent wolbachia and incompatibility level differences among closely related wolbachia in nasonia. Heredity 99(3), 278–287 (2007)CrossRefGoogle Scholar
  2. 2.
    Merçot, H., Charlat, S.: Wolbachia infections in drosophila melanogaster and d. simulans: polymorphism and levels of cytoplasmic incompatibility. Genetica 120(1-3), 51–59 (2004)CrossRefGoogle Scholar
  3. 3.
    Dobson, S.L., Marsland, E.J., Rattanadechakul, W.: Wolbachia-induced cytoplasmic incompatibility in single- and superinfected aedes albopictus (diptera: Culicidae). J Med Entomol. 38(3), 382–387 (2001)CrossRefGoogle Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Duron, O., Bernard, C., Unal, S., Berthomieu, A., Berticat, C., Weill, M.: Tracking factors modulating cytoplasmic incompatibilities in the mosquito culex pipiens. Mol Ecol. 15(10), 3061–3071 (2006)Google Scholar
  6. 6.
    Engelstadter, J., Hurst, G.D.D.: The ecology and evolution of microbes that manipulate host reproduction. Annual Review of Ecology, Evolution and Systematics (40), 127–149 (2009)Google Scholar
  7. 7.
    Engelstadter, J., Telschow, A.: Cytoplasmic incompatibility and host population structure. Heredity (103), 196–207 (2009)Google Scholar
  8. 8.
    Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoretical Computer Science 410(21-23), 2045–2053 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  10. 10.
    Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Data reduction, exact, and heuristic algorithms for clique cover. In: Proceedings of the 8th ACM/SIAM workshop on ALgorithm ENgineering and EXperiments (ALENEX), pp. 86–94 (2006)Google Scholar
  11. 11.
    Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P≠NP. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205–216. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31–45 (2007)CrossRefGoogle Scholar
  13. 13.
    Korshunov, A.D.: Asymptotic behaviour of stirling numbers of the second kind. Diskret. Anal. 39(1), 24–41 (1983)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)zbMATHCrossRefGoogle Scholar
  15. 15.
    Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae 80(5), 406–424 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Poinsot, D., Charlat, S., Merçot, H.: On the mechanism of wolbachia-induced cytoplasmic incompatibility: confronting the models with the facts. Bioessays 25(1), 259–265 (2003)CrossRefGoogle Scholar
  17. 17.
    Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica 20(1), 109–117 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing 6(3), 505–517 (1977)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Igor Nor
    • 1
    • 2
  • Danny Hermelin
    • 3
  • Sylvain Charlat
    • 1
  • Jan Engelstadter
    • 4
  • Max Reuter
    • 5
  • Olivier Duron
    • 6
  • Marie-France Sagot
    • 1
    • 2
  1. 1.Université de Lyon, F-69000, Lyon, Université Lyon 1, CNRS, UMR5558 
  2. 2.Bamboo TeamINRIA Grenoble Rhône-AlpesFrance
  3. 3.Max Planck Institute for InformaticsSaarbrückenGermany
  4. 4.Institute of Integrative BiologyETH ZurichSwitzerland
  5. 5.University College LondonUK
  6. 6.Institute of Evolutionary SciencesCNRS - University of Montpellier IIFrance

Personalised recommendations