Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility

Autor: Calamoneri, Tiziana, Gastaldello, Mattia, Mary, Arnaud, Sagot, Marie-France, Sinaimeri, Blerina

Publikováno v: Algorithms for Molecular Biology
Algorithms for Molecular Biology, 2020, pp.1-16. ⟨10.1186/s13015-020-00174-1⟩
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-16 (2020)
Algorithms for Molecular Biology, BioMed Central, 2020, pp.1-16. ⟨10.1186/s13015-020-00174-1⟩
Algorithms for Molecular Biology : AMB

International audience; 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 pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmid_dedup__::ccae159597e51b867b50c7fcf7aa4b68
https://inria.hal.science/hal-02917569

On maximal chain subgraphs and covers of bipartite graphs

Autor: Blerina Sinaimeri, Arnaud Mary, Tiziana Calamoneri, Marie-France Sagot, Mattia Gastaldello

Publikováno v: Scopus-Elsevier
Lecture Notes in Computer Science ISBN: 9783319445427
IWOCA
Lecture Notes in Computer Science
Combinatorial Algorithms-27th International Workshop, IWOCA 2016
Combinatorial Algorithms-27th International Workshop, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.137-150, ⟨10.1007/978-3-319-44543-4_11⟩

International audience; In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm. We give bounds on the number of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::959241105cfce741d3a303876fb83cd0
http://www.scopus.com/inward/record.url?eid=2-s2.0-85007569774&partnerID=MN8TOARS

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.

Publikováno v: 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).