BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7491@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20170925T130000
DTEND;TZID=Europe/Paris:20170925T140000
DTSTAMP:20241120T204345Z
URL:https://www.i2m.univ-amu.fr/evenements/multilevel-to-boolean-gene-regu
 latory-networks-preserving-attractors-and-circuits/
SUMMARY: (...): Multilevel to Boolean gene regulatory networks: preserving 
 attractors and circuits
DESCRIPTION:: Multilevel gene regulatory networks can be encoded as maps on
  a subset of the Boolean state space {0\,1}^n\, for n sufficiently large.\
 nExtending these maps to the full state space can lead to distortions of t
 he asymptotic behaviour and the regulatory graph.\nWe introduce a method f
 or extending the maps to the entire state space that guarantees the preser
 vation of attractors and does not introduce new circuits in the regulatory
  structure.\nThe presence of regulatory circuits has been connected to spe
 cific asymptotic behaviours\; in particular\, global negative circuits are
  necessary for sustained oscillations.\nWe show that the presence of a loc
 al negative circuit is not necessary for the presence of cyclic attractors
 \, in the Boolean setting\, for n&gt\;=6\, by converting a known example f
 or the multilevel case.\nWe then give an overview of a constraint programm
 ing approach that enables the analysis of the problem for small values of 
 n.
CATEGORIES:Séminaire,MABioS
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR