|
|
ÉDITIONS INTERNATIONALES
|
|
[2]
|
Current Trends in Cellular Automata and Automata Networks
|
|
|
|
[1]
|
Automata Networks and Their Applications
|
|
|
|
CHAPITRES D'OUVRAGE INTERNATIONAL
|
|
[2]
|
Boolean networks and their dynamics: the impact of updates
|
|
|
[1]
|
On Boolean automata isolated cycles and tangential double-cycles dynamics
|
J. Demongeot, T. Melliti, M. Noual, D. Regnault & S. Sené
Automata and complexity, Springer Series on Emergence, Complexity, Computation, 42:145-172, Springer, 2022.
lien officiel,
lien preprint,
bibtex
|
|
|
|
JOURNAUX INTERNATIONAUX
|
|
[20]
|
On the convergence of elementary cellular automata under sequential update modes
|
|
|
[19]
|
Robustness of Boolean networks to update modes: an application to hereditary angioedema
|
|
|
[18]
|
Foundations of block-parallel automata networks
|
|
|
[17]
|
Impact of (a)synchronism on ECA: towards a new classification
|
|
|
[16]
|
Dynamical stability of threshold networks over undirected signed graphs
|
|
|
[15]
|
Representation of gene regulation networks by hypothesis logic based Boolean systems
|
|
|
[14]
|
On Boolean automata networks (de)composition
|
|
|
[13]
|
Attractor landscapes in Boolean networks with firing memory
|
|
|
[12]
|
About block-parallel Boolean networks: a position paper
|
|
|
[11]
|
Phase transitions in stochastic non-linear threshold Boolean automata networks on ZxZ: the boundary impact
|
|
|
[10]
|
Synchronism vs asynchronism in monotonic Boolean automata networks
|
|
|
[9]
|
About non-monotony in Boolean automata networks
|
|
|
[8]
|
Combinatorics of Boolean automata circuits dynamics
|
|
|
[7]
|
"Immunetworks", intersecting circuits and dynamics
|
|
|
[6]
|
Attraction basins as gauges of the robustness against boundary conditions in biological complex systems
|
J. Demongeot, E. Goles, M. Morvan, M. Noual & S. Sené
PLoS One, 5(8): e11793, 2010
lien officiel,
bibtex
|
|
|
[5]
|
Micro-RNAs: viral genome and robustness of gene expression in the host
|
J. Demongeot, E. Drouet, A. Elena, A. Moreira, Y. Rechoum & S. Sené
Philosophical Transactions of the Royal Society A, 367: 4941-4965, 2009
lienofficiel,
lien preprint,
bibtex
|
|
|
[4]
|
Robustness in regulatory interaction networks. A generic approach with applications at different levels: physiologic, metabolic and genetic
|
J. Demongeot, H. Ben Amor, A. Elena, P. Gillois, M. Noual & S. Sené
International Journal of Molecular Sciences, 10(10): 4437-4473, 2009
lien officiel,
bibtex
|
|
|
[3]
|
Boundary conditions and phase transitions in neural networks. Theoretical results
|
|
|
[2]
|
Boundary conditions and phase transitions in neural networks. Simulation results
|
|
|
[1]
|
Robustness in regulatory networks: a multi-disciplinary approach
|
|
|
|
COMMUNICATIONS INTERNATIONALES AVEC ACTES ET
COMITÉ DE LECTURE
|
|
[32]
|
Parsimonious computational revision protocol for Boolean networks: Application to osteogenesis
|
|
|
[31]
|
Creation of fixed points in block-parallel Boolean automata networks
|
|
|
[30]
|
Complexity of Boolean automata networks under block-parallel update modes
|
|
|
[29]
|
Asymptotic (a)synchronism sensitivity and complexity of elementary cellular
automata
|
|
|
[28]
|
Combinatorics of block-parallel automata networks
|
|
|
[27]
|
Turning block-sequential automata networks into
smaller parallel networks with isomorphic limit dynamics
|
|
|
[26]
|
Representation of Boolean genetic regulatory networks by hypothesis logic
|
P. Siegel, A. Doncescu, V. Risch & S. Sené
BIOCOMP 2021 Proceedings, Transactions on Computational Science and Computational Intelligence, Springer. À paraître.
lien officiel,
lien preprint,
bibtex
|
|
|
[25]
|
Non-deterministic updates of Boolean networks
|
|
|
[24]
|
Optimising attractor computation in Boolean automata networks
|
|
|
[23]
|
Complexity of limit-cycle problems in Boolean networks
|
|
|
[22]
|
On
the complexity of acyclic modules
in automata networks
|
|
|
[21]
|
#P-completeness
of counting update digraphs,
cacti, and series-parallel
decomposition method
|
|
|
[20]
|
Towards
a Boolean dynamical system
representation into a nonmonotonic
modal logic
|
|
|
[19]
|
A
framework for (de)composing with
Boolean automata networks
|
|
|
[18]
|
Reconstruction
of Boolean regulatory models of
flower development exploiting an
evolution strategy
|
|
|
[17]
|
On
the cost of simulating a parallel
Boolean automata network by a
block-sequential one
|
|
|
[16]
|
Asynchronous
simulation of Boolean networks by
monotone Boolean networks
|
|
|
[15]
|
On
the flora of asynchronous locally
non-monotonic Boolean automata
networks
|
|
|
[14]
|
Asynchronous
dynamics of Boolean automata
double-cycles
|
|
|
[13]
|
On
the convergence of Boolean
automata networks without negative
cycles
|
|
|
[12]
|
Sensitivity
to synchronism of Boolean automata
networks
|
|
|
[11]
|
Analysis
of modular organisation of
interaction networks based on
asymptotic dynamics
|
F. Delaplace,
H. Klaudel, T. Melliti &
S. Sené
CMSB 2012
Proceedings, LNCS 7605,
148-165, Springer,
2012
Accepté pour
présentation à
CiE 2012
lien
officiel,
lien
preprint,
bibtex
|
|
|
[10]
|
Boolean
networks synchronism sensitivity
and XOR circulant networks
convergence time
|
|
|
[9]
|
A
necessary condition for boundary
sensitivity of attractive
non-linear stochastic cellular
automata in ZxZ
|
|
|
[8]
|
The
singular power of the environment
on stochastic nonlinear threshold
Boolean automata networks
|
|
|
[7]
|
Random
Boolean networks and attractors of
their intersecting circuits
|
|
|
[6]
|
On
the number of attractors of
positive and negative Boolean
automata circuits
|
|
|
[5]
|
Loss
of linearity and symmetrisation
in regulatory networks
|
|
|
[4]
|
Structural
sensitivity of neural and
genetic networks
|
|
|
[3]
|
Robustness
of dynamical systems attraction
basins against state
perturbations: theoretical
protocol and application in
systems biology
|
|
|
[2]
|
Impact
of fixed boundary conditions on
the basins of attraction in the
flower's morphogenesis
of Arabidopsis
thaliana
|
|
|
[1]
|
A
distributed trust diffusion
protocol for ad hoc
networks
|
|
|
|
ÉDITIONS NATIONALES
|
|
[1]
|
Automates cellulaires et réseaux
d'automates: le rôle central de
l'irrégularité
|
|
|
|
CHAPITRES D'OUVRAGE NATIONAL
|
|
[1]
|
Méthodes
informatiques en biologie
|
|
|
|
JOURNAUX
NATIONAUX
|
|
[2]
|
Les réseaux
d'automates booléens au cœur du calcul
naturel
|
|
|
[1]
|
Cycles,
double-cycles et modes de mise à
jour
|
|
|
|
COMMUNICATIONS NATIONALES AVEC
ACTES ET COMITÉ DE
LECTURE
|
|
[3]
|
Modal hypothesis logic, Boolean dynamical
systems and genetic networks
|
|
|
[2]
|
Représentation
des systèmes dynamiques discrets
boolèens en logique des
hypothèses
|
|
|
[1]
|
Fixed
boundaries influence in
biological networks: from theory
to application
|
|
|
|
THÈSES
|
|
[3]
|
Sur
la bio-informatique des
réseaux d'automates
|
Thèse
d'habilitation à diriger
des recherches,
Université d'Évry
- Val d'Essonne, 2012
lien,
bibtex
|
|
|
|
[2]
|
Influence
des conditions de bord dans les
réseaux d'automates
booléens à seuil
et application à la
biologie
|
Thèse de
doctorat, Université
Grenoble 1 - Joseph Fourier,
2008
lien,
bibtex
|
|
|
[1]
|
Modèle
de diffusion de la confiance
pour les réseaux ad
hoc
|
Thèse de
Master, École normale
supérieure de Lyon,
2005
lien,
bibtex
|
|
|
|
RAPPORTS DE RECHERCHE
|
|
[5]
|
Rapport final du projet ANR ANR-18-CE40-0002
|
|
|
[4]
|
Rapport final du projet ECOS Sud C16E01
|
|
|
[3]
|
Towards
a theory of modelling with Boolean
automata networks -
I. Theorisation and
observations
|
M. Noual &
S. Sené
arXiv:1111.2077,
2011
lien
|
|
|
[2]
|
Rapport
final de l'ACI Knowledge
authentication ambient
(KAA)
|
S. Galice,
V. Legrand, F. Le Mouël,
M. Minier, S. Ubéda,
M. Morvan, S. Sené,
L. Guihery, A. Rabagny,
J. Moret-Bailly,
J.-P. Neuville, J. Pousin
lien
|
|
|
[1]
|
Le
modèle des piles de sable
sur une grille
bi-dimensionnelle
|
Rapport de Master
1, Université Paris 7 -
Denis Diderot, 2004
lien
|
|
|
|
POSTERS
|
|
[3]
|
Influence
des conditions de bords dans les
réseaux biologiques
|
|
|
[2]
|
Instabilités
structurelles et analyses
temporo-spatiales en
biologie
|
|
|
[1]
|
Trudi:
a trust diffusion protocol for
ad hoc networks
|
|
|
Note : Ces documents sont
présentés ici pour assurer
la dissémination en temps utile de
travail académique et technique. Le
copyright et tous les droits
associés restent la
propriété des auteurs,
éditeurs et autres possesseurs de
ces droits. Toute personne copiant cette
information doit accepter et respecter les
termes et contraintes du copyright et
droits associés. Ces documents ne
peuvent pas être
redisséminés et, en
particulier, ne peuvent pas être
rediffusés sur Internet, sans la
permission explicite écrite du
détenteur du copyright.
|
|
