Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility

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

Publikováno v: Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-16 (2020)

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 unders

Externí odkaz: https://doaj.org/article/172ae2fabceb4cc8ab06b9d069dea69a

On the complexity of the k-chain subgraph cover problem

Autor: Chang-Wu, Yu, Gen-Huey, Chen, Tze-Heng, Ma

Publikováno v: In Theoretical Computer Science 1998 205(1):85-98

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

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.

Autor: Klemz, Boris, Rote, Günter

Publikováno v: Algorithmica; Apr2022, Vol. 84 Issue 4, p1064-1080, 17p