![Page 1: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/1.jpg)
Predicting Gene Expression using Logic Modeling and Optimization
Abhimanyu Krishna
New Challenges in the European Area: Young Scientist’s 1st International Baku Forum
![Page 2: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/2.jpg)
Gene Regulatory Network reconstruction
R
A
TRB TRC
p
A
p
A
p
A
B C
Input Stimuli
C
Input Stimuli
R
C
B
p
What is Gene Expression? -> Regulation? -> Gene Regulatory Network?
Introduction:
![Page 3: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/3.jpg)
Literature based Gene Regulatory Network
Experimental expression data
+
Missing expression values in grey
How to contextualize literature to our experimental conditions
Objective
![Page 4: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/4.jpg)
4
Stable state Stable
state
Unstable transient state
Biological processes represented as transitions in a landscape
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Introduction:Networks of interactions
![Page 5: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/5.jpg)
5
Why these predictions are not trivial?
Noisy network reconstruction process
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 6: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/6.jpg)
6
Problem:Inconsistency between network and experimental expression data
Solution:Contextualize the Network using experimental expression data
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 7: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/7.jpg)
7
Why is this an optimization problem?
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 8: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/8.jpg)
8
Why is this an optimization problem?
Local consistency
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 9: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/9.jpg)
9
Why is this an optimization problem?
Local consistency
Edge removal
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 10: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/10.jpg)
10
Why is this an optimization problem?
Local consistencyGlobal consistency
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 11: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/11.jpg)
11
Stable state Stable
state
Unstable transient state
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Which property are we going to use in the optimization?
Network stability
![Page 12: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/12.jpg)
12
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 13: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/13.jpg)
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 14: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/14.jpg)
14
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 15: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/15.jpg)
15
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 16: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/16.jpg)
16
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 17: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/17.jpg)
17
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 18: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/18.jpg)
18
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 19: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/19.jpg)
19
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 20: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/20.jpg)
20
But the contribution of interactions to the network stability it is not linearly independent.
The evaluation of one specific link is highly dependent of the links already removed or, in other words, the order of removal.
We are going to capture interdependencies between variables considering sequentially both the probability distribution of positive circuits and separated edges.
Positive circuit Positive circuit Negative circuit
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Thomas R, Thieffry D, Kaufman M: DYNAMICAL BEHAVIOR OF BIOLOGICAL REGULATORY NETWORKS .1. BIOLOGICAL ROLE OF FEEDBACK LOOPS AND PRACTICAL USE OF THE CONCEPT OF THE LOOP-CHARACTERISTIC STATE. Bulletin of Mathematical Biology 1995, 57:247-276.
Positive circuits are necessary condition to have several fixed points
![Page 21: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/21.jpg)
21
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 1
![Page 22: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/22.jpg)
22
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 2
![Page 23: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/23.jpg)
23
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 3
![Page 24: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/24.jpg)
24
Which property are we going to use in the optimization?
Network stability
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 25: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/25.jpg)
25
Biological scope targeted by this approach: transitions between long term expression patterns or
stable states
Epithelial-mesenchymal transition
Epithelial Mesenchymal
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Example:
![Page 26: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/26.jpg)
26
Computing attractors in a discrete dynamical system (Boolean)
Based on logic functions and the assumption of only 2 possible gene states: active (ON or 1) and inactive (OFF or 0).Logic functions:
The state of the node xi at time t+1 depends on the state of its regulators at time t.
Updating scheme: Synchronous
Types of attractors: fixed points and limit cycles
Fixed point
Limit cycle
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 27: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/27.jpg)
27
Consistency between expression data and network stable states
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 28: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/28.jpg)
28
Optimization of h(x) (objective function)
h(x) = X1+X2+X3+X4+X5+x6
Xi = 0 or 1
Network topology optimized using an Estimation of Distribution Algorithm (EDA)
Toy example:
Iterative network pruning
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 29: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/29.jpg)
29
Top 10 solutions
Initial population Next population
EDA: toy example
![Page 30: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/30.jpg)
30
EDA: toy example
Top 10 solutions
Initial population Next population
![Page 31: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/31.jpg)
31
EDA: toy example
Top 10 solutions
Initial population Next population
![Page 32: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/32.jpg)
32
EDA: toy example
Top 10 solutions
Initial population Next population
![Page 33: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/33.jpg)
33
EDA: toy example
Top 10 solutions
Initial population Next population
0.7
![Page 34: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/34.jpg)
34
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7
![Page 35: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/35.jpg)
35
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6
![Page 36: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/36.jpg)
36
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6 0.6
![Page 37: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/37.jpg)
37
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6 0.6 0.8
![Page 38: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/38.jpg)
38
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6 0.6 0.8 0.7
![Page 39: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/39.jpg)
39
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6 0.6 0.8 0.7
![Page 40: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/40.jpg)
40
EDA: toy example
Top 10 solutions
Initial population Next population
0.7 0.7 0.6 0.6 0.8 0.7
STOP CRITERIA
![Page 41: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/41.jpg)
41
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 42: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/42.jpg)
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 43: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/43.jpg)
43
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 44: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/44.jpg)
44
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 45: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/45.jpg)
45
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 46: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/46.jpg)
46
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 47: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/47.jpg)
47
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 48: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/48.jpg)
48
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruning
![Page 49: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/49.jpg)
49
But the contribution of interactions to the network stability it is not linearly independent.
The evaluation of one specific link is highly dependent of the links already removed or, in other words, the order of removal.
We are going to capture interdependencies between variables considering sequentially both the probability distribution of positive circuits and separated edges.
Positive circuit Positive circuit Negative circuit
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Thomas R, Thieffry D, Kaufman M: DYNAMICAL BEHAVIOR OF BIOLOGICAL REGULATORY NETWORKS .1. BIOLOGICAL ROLE OF FEEDBACK LOOPS AND PRACTICAL USE OF THE CONCEPT OF THE LOOP-CHARACTERISTIC STATE. Bulletin of Mathematical Biology 1995, 57:247-276.
Positive circuits are necessary condition to have several fixed points
![Page 50: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/50.jpg)
50
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 1
![Page 51: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/51.jpg)
51
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 2
![Page 52: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/52.jpg)
52
with
Objective function:This score S uses the normalized Hamming distance (h) to compare N Boolean gene expression values (σ) between all calculated steady states (α) of a pruned network and the two known phenotypes (φ1 and φ2) defined by the expression data, in order to identify the two best-matching phenotype/steady state couples (φα1 and φα2)
Iterative network pruningPositive Circuit 3
![Page 53: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/53.jpg)
53
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
Algorithm:
![Page 54: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/54.jpg)
54
Predictions based on the consensus
between the familiy of
alternative solutions
“Predicting missing expression values in gene regulatory networks using a discrete logic modeling optimization guided by network stable states”
![Page 55: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/55.jpg)
http://nar.oxfordjournals.org/content/early/2012/08/30/nar.gks785.full
Software http://maia.uni.lu/demo/
Paper
Availability:
![Page 56: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/56.jpg)
Isaac Crespo
Computational Biology Unit
(LCSB)
Abhimanyu Krishna
Bioinformatic core
(LCSB)
Antony Le Béchec Antonio del Sol
Head of Computational Biology Unit
(LCSB)
Life sciences research unit
(LSRU)
Vital-IT (SIB)
Thank you!
Questions?
![Page 57: Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna](https://reader035.vdocuments.us/reader035/viewer/2022062521/568162af550346895dd33520/html5/thumbnails/57.jpg)
57