Sylvain Sené
Sylvain Sené has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Eric Goles
Facultad de Ciencias y Tecnología Universidad Adolfo Ibáñez Santiago Chile
2 shared publications - Kévin Perrot
Aix Marseille Univ CNRS LIS Marseille France
2 shared publications - Lucas Venturini
Université publique
2 shared publications - Andrei Doncescu
CNRS UPR 8001 LAAS Toulouse France
1 shared publication - Camille Noûs
Laboratoire Cogitamus
1 shared publication - Fabiola Lobos
Facultad de Ingenería y Ciencias, Universidad Adolfo Ibañez, Santiago, Chile
1 shared publication
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Robustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Open AccessRobustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- 28 September 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (4) , 4556-4581
Representation of gene regulation networks by hypothesis logic-based Boolean systems
- 28 September 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (4) , 4556-4581
Representation of gene regulation networks by hypothesis logic-based Boolean systems
- 10 March 2021
- Published by Springer Nature
- Vol. 12098, C1
Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
- 10 March 2021
- Published by Springer Nature
- Vol. 12098, C1
Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
- 24 June 2020
- Published by Springer Nature
- Vol. 12098, 326-338
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very sensitive to changes in this schedule of updates. Since the works of Aracena et al., it is known that update digraphs are pertinent objects to study non-equivalent block-sequential update schedules. We prove that counting the number of equivalence classes, that is a tight upper bound on the synchronism sensitivity of a given network, is \(\mathsf {\#P}\)-complete. The problem is nevertheless computable in quasi-quadratic time for oriented cacti, and for oriented series-parallel graphs thanks to a decomposition method.- 24 June 2020
- Published by Springer Nature
- Vol. 12098, 326-338
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very sensitive to changes in this schedule of updates. Since the works of Aracena et al., it is known that update digraphs are pertinent objects to study non-equivalent block-sequential update schedules. We prove that counting the number of equivalence classes, that is a tight upper bound on the synchronism sensitivity of a given network, is \(\mathsf {\#P}\)-complete. The problem is nevertheless computable in quasi-quadratic time for oriented cacti, and for oriented series-parallel graphs thanks to a decomposition method.- 9 May 2020
- Published by Springer Nature in Natural Computing
- Vol. 19 (2) , 295-319
Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
- 9 May 2020
- Published by Springer Nature in Natural Computing
- Vol. 19 (2) , 295-319
Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks