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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

40 Imoto et al.<br />

Fig. 5. Result of the identification of the drug-affected genes (12).<br />

3.2. Bayesian Networks for Exploring Druggable Genes<br />

3.2.1. Introduction of Bayesian Networks<br />

Bayesian networks are a mathematical model for representing complex<br />

phenomena among a large number of r<strong>and</strong>om variables by using the joint<br />

probability. In Bayesian networks, the dependency of the r<strong>and</strong>om variables is<br />

represented by the dag encoding the Markov assumption between nodes. That<br />

is, the state of a node only depends on its direct parents. Mathematically, we<br />

have a set of r<strong>and</strong>om variables {X 1 ,…,X p }, <strong>and</strong> we consider a dag G as the<br />

dependency underling among r<strong>and</strong>om variables. The joint probability of the<br />

r<strong>and</strong>om variables can be decomposed as follows:<br />

P<br />

∏<br />

Pr(X 1 ,...,X p ) = Pr(X j | Pa(X j )),<br />

j=1<br />

where Pa(X j ) is the set of r<strong>and</strong>om variables corresponding to the direct parents<br />

of X j in G. Figure 6 is an example of a dag of the r<strong>and</strong>om variables<br />

{X 1 ,X 2 ,X 3 ,X 4 }. In this case, we have Pa(X 1 ) = {X 2 ,X 3 }, Pa(X 2 ) = , Pa(X 3 ) = X 4 ,<br />

<strong>and</strong> Pa(X 4 ) = . Then, the joint probability of these four r<strong>and</strong>om variables is<br />

decomposed as:<br />

Pr(X 1 ,…, X 4 ) = Pr(X 1 |X 2 , X 3 )Pr(X 2 )Pr(X 3 |X 4 )Pr(X 4 ).<br />

(1)

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

Saved successfully!

Ooh no, something went wrong!