
Resumen
Boolean equations are increasingly used to model large cellular regulatory networks encompassing multiple regulatory circuits and analyse their dynamic properties. The resulting models are often initially defined as a signed directed graph, referred to here as a ‘regulatory graph’, whose nodes represent biomolecular entities (genes, proteins, etc.) and whose signed arcs represent the regulatory influences of source nodes on target nodes. In addition, Boolean rules involving literals (Boolean variables representing nodes) and classic Boolean operators (NOT, AND, and OR) are used to define how different combinations of regulatory components affect their targets. Finally, an update scheme is applied to calculate the dynamics of these Boolean network models, most often either fully synchronous (i.e., with all components updated simultaneously at each iteration) or fully asynchronous (i.e., considering each possible update of a single component at each iteration), in order to generate another type of directed graph, called a ‘state transition graph’.
In state transition graphs, each node represents a state of the network (i.e., a specific combination of Boolean values for all components of the network), while the arcs represent transitions between pairs of states, obtained using the chosen update scheme and Boolean rules.
Most previous studies focus on the dynamic analysis of Boolean network models designed on the basis of pre-existing knowledge, using simulations, or the calculation of attractors and the evaluation of their accessibility, or the evaluation of provisional dynamic properties with model verification techniques.
In this presentation, I will focus on delineating the general relationships between the structure of regulatory graphs, for example the existence of specific circuit configurations, and the emergence of specific dynamic properties, such as the generation of multiple stable states or the generation of complex attractors. I will first review some established results (theorems) before discussing a few open problems with the audience
Ponente
Denis Thieffry, Ecole Normal Supérieure & Institute Curie, PSL. University, Paris, France
Informes
drosenbl@unam.mx
Transmisión por YouTube: https://www.youtube.com/live/JPBNbBJYU2E