a formal approach to decipher a mixture of genetic and
play

A Formal Approach to Decipher a Mixture of Genetic and Metabolic - PowerPoint PPT Presentation

A Formal Approach to Decipher a Mixture of Genetic and Metabolic Networks Fabien Corblin, Eric Fanchon, Laurent Trilling Workshop Toward Systems Biology 31 mai 2011 General problems exploration of regulatory biological networks qualitative


  1. A Formal Approach to Decipher a Mixture of Genetic and Metabolic Networks Fabien Corblin, Eric Fanchon, Laurent Trilling Workshop Toward Systems Biology 31 mai 2011

  2. General problems exploration of regulatory biological networks – qualitative and incomplete data – complex relation between structure and global behavior modeling of regulatory biological networks – which players ? – which interactions ? kinetics ? thresholds ? – which behaviors ? – which possible correction to a deficiency of the model/system ? 2 / 22

  3. Motivation Example of discrete modeling (Thomas networks) generic structure possible behavior 1 possible behavior 2 y y 2 t 1 t 2 x 1 y t 2 y 1 x y t 1 t 1 y t 2 y y t 1 y 0 0 x x t 1 t 1 0 1 0 1 x x Variables: kinetics, thresholds, existence, composition of interactions, behaviors Specific problems Avoid trial-error process – Consider in intension a class of models Solution Use of formal approach – Constraint approach 3 / 22

  4. Knowledge declaration Structure nodes of the network (molecular species) reactions/interactions (conditions about the current position of the system state + effects on the tendency of the system) thresholds of reactions (values are formal entities) Behaviors existence of a path (sequence of transitions) possibility to consider several mutant types possibility to consider several input contexts Relation between structure and behaviors formalization of Thomas networks (existence of a path constrained to follow the tendencies of the system in each encounter state), interaction signs (increasing tendencies + or decreasing − if the threshold of interaction is crossed) 4 / 22

  5. Example on the network controling the drosophila embryo segmentation 5 / 22

  6. Knowledge declaration – Example on the network controling the drosophila embryo segmentation Structure and interaction signs bcd t 1 t 1 bcd hb t 4 t 1 bcd hb gt t 3 t 2 bcd bcd t 5 hb t 1 t 3 cad hb t 2 hb t 4 t 1 cad hb kni t 1 t 4 ter cad t 1 t 3 t 3 kr gt cad t 4 t 4 t 2 gt ter ter kr kni kni t 2 cad t 2 kni gt t 3 hb t 2 t 3 ter kr t 2 ter 6 / 22

  7. Knowledge declaration – Example on the network controling the drosophila embryo segmentation Behaviors type gt hb kr kni gt hb ter additional constraints wt hb 0 S 1 , kr 0 kr 0 /// /// > 0 gt kni 0 /// /// gt 0 /// /// ter 0 bcd 0 /// /// cad 0 /// /// 7 / 22

  8. Search for the minimal network – Example on the network controling the drosophila embryo segmentation Minimal structure bcd t 1 t 1 bcd hb t 4 bcd hb t 3 t 2 bcd bcd t 5 hb t 3 hb t 4 cad t 4 hb cad t 3 t 3 gt cad t 4 gt kr kni ter ter t 2 t 2 kni gt t 3 hb t 3 t 2 ter kr 8 / 22

  9. Multiple automatic functionalities consistence optimization (minimal number of interactions, of thresholds, etc) search for properties (positions of steady states, manner to compose the interactions, etc) inconsistency correction (relaxation of constraints) 9 / 22

  10. Semantic of genetic discrete networks ”Genetic” cellular context of node N region of concentration space defined by the same positioning compared to the thresholds of interactions onto N two states in the same cellular context have the same ”genetic” effects Tendency of N in these cellular contexts value toward the direction of evolution of the concentration of N modeled by a parameter (not known by default) Transitions from a state S 1 to a state S 2 different: only possible if S 1 and S 2 are different by only one component N , and S 2 N on the same side compared to S 1 N that the tendency of N in S 1 (the trajectory does not contradict the tendency). form a state S 1 to the same state S 1: only possible if for all N , the tendency of N in S 1 is equal to S 1 N . 10 / 22

  11. Semantic of genetic discrete networks – Example Example of discrete modeling (Thomas networks) generic structure possible behavior 1 possible behavior 2 y y 2 t 1 t 2 x 1 y y t 2 1 x y t 1 t 1 y t 2 y y t 1 y 0 0 x x t 1 t 1 0 1 0 1 x x Variables: kinetics, thresholds, existence, composition of intearctions, behaviors 11 / 22

  12. Semantic of metabolic networks Metabolic reaction a set of consummed species a set of produced species an activation condition (enzymes can interact) ”Production” and ”consumption” cellular contexts of the node N region of concentration space defined by the same positioning compared to the thresholds of activation conditions for the production (resp. consumption) of N two states in the same ”production” (resp. ”consumption”) cellular context have the same ”production” (resp. ”consumption”) effects Tendency of N in these cellular contexts value V ∈ { min , current value , max } toward the direction of evolution of the concentration of N V = min if active consumption and no active production V = max if active production and no active consumption V = current value if no active consumption neither active production modeled by a parameter if there exist a conflict (both active production and active consumption) Transition : idem ”genetic” + impossible to contradict the tendency of the arrival state 12 / 22

  13. Semantic of discrete metabolic networks – Example on a complexation-decomplexation reaction a + b ⇋ c Metabolic reactions S a ≥ t 1 a ∧ S b ≥ t 1 b { a , b } − − − − − − − − − → { c } S c ≥ t 1 c { c } − − − − → { a , b } ”Production” and ”consumption” cellular contexts of node N production of a ⇔ S c ≥ t 1 (2 ”production” cellular contexts for a ), c consumption of a ⇔ S a ≥ t 1 a ∧ S b ≥ t 1 b , production of c ⇔ S a ≥ t 1 a ∧ S b ≥ t 1 b , consumption of c ⇔ S c ≥ t 1 c Tendency of N in one of these cellular contexts for a (idem for b ) : = min : if S a ≥ t 1 a ∧ S b ≥ t 1 b ∧ S c < t 1 c = max : if S c ≥ t 1 c ∧ ( S a < t 1 a ∨ S b < t 1 b ) = current value = S N = S a : if ( S a < t 1 a ∨ S b < t 1 b ) ∧ S c < t 1 c = parameter ∈ { min , current value , max } : if S a ≥ t 1 a ∧ S b ≥ t 1 b ∧ S c ≥ t 1 c Transition : idem ”genetic” + impossible to contradict the tendency of the arrival state 13 / 22

  14. Semantic of discrete metabolic networks – Example on a complexation-decomplexation reaction a + b ⇋ c 111 abc a + b ⇋ c 011 110 101 010 100 001 000 14 / 22

  15. Semantic of discrete metabolic networks – Example on a complexation-decomplexation reaction a + b ⇋ c 111 abc p b = 0 p c = 0 a + b ⇋ c p a = 0 011 110 101 010 100 001 000 15 / 22

  16. Semantic of discrete metabolic networks – Example on a complexation-decomplexation reaction a + b ⇋ c p a = 1 ∧ p b = 1 ∧ p c = 1 111 abc p b = 1 p c = 1 a + b ⇋ c p a = 1 011 110 101 010 100 001 000 16 / 22

  17. Semantic of discrete metabolic networks – Example on a complexation-decomplexation reaction a + b ⇋ c 111 abc p b = 1 p c = 1 a + b ⇋ c p a = 0 011 110 101 010 100 001 000 17 / 22

  18. Semantic of mixed networks cellular contexts of node N triple of cellular contexts ”genetic”, ”production”, and ”consumption” (noted i genetic , i production , i consumption or just Cellc i Cellc N ). N Tendency of N in one of these cellular contexts if no production and consumption of N : idem genetic semantic, if no genetic interaction onto N : idem metabolic semantic, else : idem genetic semantics + Constraints enforcing a (non strict) increasing of the tendency from a (non empty) cellular context Cellc 1 N to a (non empty) cellular context Cellc 2 N if: Cellc 2 N = Cellc 1 N + one production, Cellc 2 N = Cellc 1 N − one consumption, Cellc 2 N = Cellc 1 N + one additive interaction (true also for genetic part). 18 / 22

  19. 2 programming environments to decypher biological networks GNBox environment – formalization: discrete genetic networks and biological properties – implementation: cooperation of 2 solvers, CP on integers and SAT – functionnalities: consistency, correction, property inference, optimization – formal entities: existence, kinetic and threhsolds of interactions, behaviors, – publication : F . Corblin, E. Fanchon, L. Trilling. BMC Bioinformatics 2010. SysBiOX environment – formalization : discrete mixed networks (genetic and metabolic) – implementation: with ASP (Answer Set Programming) Very general: many functionalities and easy representation of data Completely declarative modeling: formalizations with constraints (over formal entities) 19 / 22

  20. Perspectives application to the toxicity control in human hepatic cells (A. Corlu, F . Morel, INSERM Rennes – J. Nicolas, IRISA-INRIA Rennes). application to mammal iron homeostasis (J.-M. Moulis, IMBG-CEA Grenoble). study of mixed network properties (as presented here). experiment design: language to describe biological properties (objective) controllable perturbations observables. technological study for optimization, property inference, and relaxation of constraints (ASP , SMT). 20 / 22

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend