Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.

Autor: Calamoneri T; Department of Computer Science, Sapienza University of Rome, viale Regina Elena 295, 00161 Rome, Italy., Gastaldello M; Inria Grenoble, 655, Avenue de l'Europe, 38334 Montbonnot, France.; Université de Lyon, Université Lyon 1, CNRS, Laboratoire de Biométrie et Biologie Evolutive UMR 5558, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne, France.; Department of Computer Science, Sapienza University of Rome, viale Regina Elena 295, 00161 Rome, Italy., Mary A; Inria Grenoble, 655, Avenue de l'Europe, 38334 Montbonnot, France.; Université de Lyon, Université Lyon 1, CNRS, Laboratoire de Biométrie et Biologie Evolutive UMR 5558, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne, France., Sagot MF; Inria Grenoble, 655, Avenue de l'Europe, 38334 Montbonnot, France.; Université de Lyon, Université Lyon 1, CNRS, Laboratoire de Biométrie et Biologie Evolutive UMR 5558, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne, France., Sinaimeri B; Inria Grenoble, 655, Avenue de l'Europe, 38334 Montbonnot, France.; Université de Lyon, Université Lyon 1, CNRS, Laboratoire de Biométrie et Biologie Evolutive UMR 5558, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne, France.
Jazyk: angličtina
Zdroj: Algorithms for molecular biology : AMB [Algorithms Mol Biol] 2020 Jul 22; Vol. 15, pp. 14. Date of Electronic Publication: 2020 Jul 22 (Print Publication: 2020).
DOI: 10.1186/s13015-020-00174-1
Abstrakt: 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.
Competing Interests: Competing interestsThe authors declare that they have no competing interests.
(© The Author(s) 2020.)
Databáze: MEDLINE
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje