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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
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)
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)
Engelstadter, J., Telschow, A.: Cytoplasmic incompatibility and host population structure. Heredity (103), 196–207 (2009)
Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoretical Computer Science 410(21-23), 2045–2053 (2009)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
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)
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)
Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31–45 (2007)
Korshunov, A.D.: Asymptotic behaviour of stirling numbers of the second kind. Diskret. Anal. 39(1), 24–41 (1983)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae 80(5), 406–424 (1977)
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)
Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica 20(1), 109–117 (2000)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nor, I. et al. (2010). Mod/Resc Parsimony Inference. In: Amir, A., Parida, L. (eds) Combinatorial Pattern Matching. CPM 2010. Lecture Notes in Computer Science, vol 6129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13509-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-13509-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13508-8
Online ISBN: 978-3-642-13509-5
eBook Packages: Computer ScienceComputer Science (R0)