02.03.2013 Views

Target Discovery and Validation Reviews and Protocols

Target Discovery and Validation Reviews and Protocols

Target Discovery and Validation Reviews and Protocols

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Gene Networks 49<br />

network <strong>and</strong> nonparametric regression model. After determining the threshold,<br />

we compute the conditional probability table of the multinomial distribution. Let<br />

X j be a discrete type r<strong>and</strong>om variable. The posterior probability of X j = u k |Pa(X j ) =<br />

u jl conditional on the n sets of data D = {x i ,…,x n } can be written as follows:<br />

π post (X j = u k ⏐Pa(X j ) = u jl ) =<br />

α jkl + N jkl<br />

∑ k′(α<br />

jk′l + N jk ′ l)<br />

If a gene is directly affected by a drug, the expression level of the gene may<br />

be overexpressed or suppressed independently on the expression level of its parent<br />

genes. In contrast, if a gene is not directly affected by a drug, the expression<br />

value should be determined by the expression values of its parent genes. Based<br />

on this assumption, we define a score function called drag-affected score<br />

(DAS)j that determines whether jth gene is affected by a drug or its parents,<br />

DAS j (x,u) = πpost(X j = x⏐Pa(X j ) = u)<br />

,<br />

Pr (X j = x)<br />

where x <strong>and</strong> u are the observed expression values of jth gene <strong>and</strong> its parents,<br />

<strong>and</strong> Pr(Xj ) is the marginal probability given by Pr(Xj ) = ΣXj :i ≠ j Pr(X1 ,…, Xp ).<br />

This marginalization is often referred as the probabilistic inference <strong>and</strong> takes<br />

exponential time for the number of genes <strong>and</strong> is infeasible for the large network.<br />

To compute this interference efficiently, several approximation algorithms have<br />

been proposed. In this chapter, we use the loopy belief propagation algorithm.<br />

For additiontal comments on the probabilistic inference based on the Bayesian<br />

networks, see Note 11.<br />

Let xj (t) <strong>and</strong> pj (t) is the expression values of jth gene <strong>and</strong> its direct parents<br />

at time t. The procedure for finding drug-active pathways can be performed by<br />

the following steps.<br />

Step 1. Construct the time-exp<strong>and</strong>ed network from the estimated gene network.<br />

Step 2. Compute DASj (xj (t), pj (t)) <strong>and</strong> put the constant c (c>0),<br />

if DASj (xj (t), pj (t)) ≤ c, jth gene at time t is called a drug-active gene,<br />

if DASj (xj (t), pj (t)) > c –1 , jth gene at time t is called a parent-active gene.<br />

We call both drug-active <strong>and</strong> parent-active genes affected genes.<br />

Step 3. If a direct edge, in the time-exp<strong>and</strong>ed network, from Xu (t) to Xv (s), where<br />

Xu (t) is a node corresponding to uth gene at time t, satisfies with a condition<br />

out of three, this direct edge is called a drug-active path.<br />

(i) Xv (s) is a drug-active gene, where s = t + 1 (Fig. 8a).<br />

(ii) Xv (s) is a parent-active gene, where s = t (Fig. 8b).<br />

(iii) Xv (s) is an affected gene, where s = t + 1 <strong>and</strong> v = u (Fig. 8c).<br />

Step 4. Extract connected components of the drug-active paths from the timeexp<strong>and</strong>ed<br />

network.<br />

.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!