Skip to Main content Skip to Navigation
Journal articles

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility

Abstract : Cytoplasmic incompatibility (CI) relates to the manipulation by the parasite Wolbachia of its host reproduction. Despite its widespread occurrence, the molecular basis of CI remains unclear and theoretical models have been proposed to understand the phenomenon. We consider in this paper the quantitative Lock-Key model which currently represents a good hypothesis that is consistent with the data available. CI is in this case modelled as the problem of covering the edges of a bipartite graph with the minimum number of chain subgraphs. This problem is already known to be NP-hard, and we provide an exponential algorithm with a non trivial complexity. It is frequent that depending on the dataset, there may be many optimal solutions which can be biologically quite different among them. To rely on a single optimal solution may therefore be problematic. To this purpose, we address the problem of enumerating (listing) all minimal chain subgraph covers of a bipartite graph and show that it can be solved in quasi-polynomial time. Interestingly, in order to solve the above problems, we considered also the problem of enumerating all the maximal chain subgraphs of a bipartite graph and improved on the current results in the literature for the latter. Finally, to demonstrate the usefulness of our methods we show an application on a real dataset.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Wednesday, August 19, 2020 - 2:48:08 PM
Last modification on : Saturday, July 23, 2022 - 3:53:06 AM
Long-term archiving on: : Monday, November 30, 2020 - 9:44:47 PM


Publisher files allowed on an open archive



Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. Algorithms for Molecular Biology, BioMed Central, 2020, pp.1-16. ⟨10.1186/s13015-020-00174-1⟩. ⟨hal-02917569⟩



Record views


Files downloads