View source for quantifying cancer progression with conjunctive Bayesian networks

===Motivation===
Tumor progression is characterized by a sequence of multiple genetic mutations that arise due to activation of oncogenes and inactivation of tumor suppressor genes. It is still unknown about the temporal order of these mutations, as carcinogenic process is a slow process and takes several years. Biologically motivated mathematical models such as "Evolutionary dynamics" have been used to describe the sequence of events. Several statistical models such as oncogenetic trees, network trees, probabilistic network models, etc have been used to model disease progression, in particular cancer. Genetic events happen in no specific order, due to which a single node can have multiple parents. This lead to the use of a more generalization framework for tree models called as the conjunctive Bayesian networks. In simple words, a conjunctive Bayesian network is a directed acyclic graph that allows for multiple parent nodes. One biggest advantage of this model is that it can model multiple mutational pathways.

===Introduction===
A poset <math>P</math> or a partially ordered set has a binary relation "<math> < </math>" which has the following properties:

* Reflexive
* Antisymmetry
* Transitive

In this model, <math>P</math> denotes the set of mutational events and the binary relation defines the order of occurrence of the constraints. For example, <math>p < q </math> denotes that mutation <math>q</math> can occur only after the occurrence of mutation <math>p</math>. We denote <math>p</math> as the parent of <math>q</math> if there exists no node <math>r \in P</math> such that <math>r\neq p</math>, <math>r\neq q</math> and <math>p<r<q</math>. Denote <math>p\rightarrow q</math> to say that <math>p</math> is the parent of <math>q</math>. The set of all parents is denoted by <math>pa(q)</math>. We now construct the distributive lattice of order ideals of <math>P</math> denoted by <math>J(P)</math>. The distributive lattice is defined as follows: all the subsets <math>S\subset P</math> and <math>S\in J(P)</math>. We say that <math>S\in J(P)</math> if and only if for all <math>q\in S</math> and <math>p < q </math> then <math>p\in S</math>.

A conjunctive Bayesian network (CBN) is characterized by a set of events <math>E</math> along with a partial order "<math><</math>" that is defined on the events and with parameters <math>\theta_e</math> for each events <math>e\in E</math>. The state space of this CBN is the distributive lattice <math>J(E)</math> of order ideals in the events set <math>E</math>. Elements of distributive lattice are called as genotypes. To summarize, a CBN is:
* a model that places partial order on the genetic mutations
* assumes total number of mutations as fixed, say <math>n</math>
* model assumes no reverse mutations at any point of time in the process
* generates a lattice of possible genotypes
Here is a simple example that illustrates a poset and construction of distributive lattice taken from <ref name="R1"> Beerenwinkel N. and Sullivant S, “Markov models for accumulating mutations,” in Biometrika, 96, 3 ,pp. 645–661, 2009.</ref>

A poset that is defined on the four element set as <math>[4]={1,2,3,4}</math> constrained on the binary relation <math>1<3</math>, <math>2<3</math> and <math>2<4</math>.
[[File:Poset.png|center|frame|Fig.1 A sample poset with 4 mutations]]
We notice that mutation 3 cannot happen until the occurrence of mutations 1 and 2. Mutation 4 cannot happen until the occurrence of mutation 2. Then the distributive lattice can be constructed as follows for Fig 1: 
[[File:Lattice.png|center|frame|Fig.2 lattice of order ideals]]

===Bayesian networks and detection of cancer===

A tumor has to grow to a minimum size in order to detect it using CT scans or MRI scans. Firstly, a malignant tumor has to grow to a particular size and secondly the clinical diagnosis has to be correct. A model is formulated as follows:
* <math>T</math>: Waiting time for tumor to develop
* <math>T_s</math>: Waiting time for clinical diagnosis
The dynamics of CBN is a hidden process due to one of the observation variable, and hence this model is treated as a hidden CBN. Figure 3 shows a simple CBN with a hidden process.

[[File:CBNupdated1.png|thumb|right|Fig.3 Sample CBN for cancer diagnosis]]

Both the times defined above are random variables. In general, <math>T</math> and <math>T_s</math> are not known due to which we assume that both are independent. Therefore their joint distribution is given by <math>f(t,t_s)=f(t)f(t_s) </math>. Cancer is detected only when it is observed during the diagnosis time. Suppose <math>X\in{0,1}</math> be a binary random variable that indicates presence of cancer at <math>T_s</math>. If cancer is diagnosed at <math>T_s</math> then <math>X</math> is set to be one. Then the probability of <math>X</math> is given by:
<center>
<math>
Prob(X) = \int_0^{\infty}\int_0^{\infty}Prob(X|T=t,T_s=t_s)f(t)f(t_s)dt dt_s
</math>
</center>
where the conditional probability 
<center>
<math>
Prob(X=1|T=t,T_s=t_s)=I(t<t_s)
</math>
</center>
is called as the indicator function. Model described above assumes that diagnosis is always correct. Practically, there is always a chance that diagnosis might go wrong. Let us suppose that diagnosis is overlooked or misdiagnosed with a probability <math>\epsilon</math>. This assumption leads us to saying that, clinical diagnosis is also regarded a probabilistic event <math>Y</math> that depends on <math>X</math>. Hence, the probability of <math>Y</math> is given by
<center>
<math>
Prob(Y) = \sum _{X=0,1}Prob_{\epsilon}(Y|X)Prob(X)
</math>
</center>
where <math>Prob(X)</math> is defined as above and,
<center>
<math>
Prob_{\epsilon}(Y|X)= \epsilon^{I(Y\neq X)} (1-\epsilon)^{I(Y=X)}
</math>
</center>

Variables <math>{T,T_s,X,Y}</math> form a Bayesian network and the joint density can be factorized into conditional densities.

===Conjunctive Bayesian networks for multiple pathways===
Model discussed in the above section is extended to examine progression of cancer. Let us assume that there are "n" mutations in the system and waiting time for one mutation is denoted by <math>T_i</math> for <math>1\leq i \leq n</math>. Clearly, waiting time for each mutation is a random variable. Let us look at an example of defining waiting times for each mutational event in a poset <math>P</math>. Suppose that for each event in the poset we define a random variable <math>Z_i</math><math>\sim</math><math>\exp(\lambda_i) </math>, where <math>\lambda_i</math> is a parameter. Then waiting times for the events defined in figure 1 are the following:
* <math>T_1=Z_1</math> 
* <math>T_2=Z_2</math> 
* <math>T_3=max(T_1,T_2)+Z_3</math> 
* <math>T_4=T_2+Z_4</math> 
[[File:CBN2.png|thumb|right|Fig.3 Hidden CBN with multiple pathways]]
Now we defined a general form for the waiting times of "n" events in a poset <math>P</math> as follows:
<center><math>
T_i \sim \exp(\lambda_i) + max _{j\in pa(i)} T_j
</math></center>
The density function <math>T_i</math> conditioned on all its parent nodes is given by :
<center><math>
f_{T_i|T_j,j\in pa(i)} (t_i|{t_j}) = \lambda_i \exp(-\lambda_i(t_i-max_{j\in pa(i)}t_j))I(t_i>max_{j\in pa(i)}t_j)
</math></center>
Random variable <math>T</math> is a vector of time points that  satisfy binary relations defined on the poset <math>P</math> and the relation <math>(t_i>max_{j\in pa(i)}t_j)</math> for all <math>i \in [n]</math>. Assume that the waiting time <math>T_s</math> is also independently exponentially distributed with parameter <math>\lambda_s</math>, i.e. <math>T_s</math><math>\sim</math><math>\exp(\lambda_s). </math>. Like in the previous section, we define <math>X=(X_1,X_2,...,X_n) \in {0,1}^n</math> as a binary vector. Then the conditional density of <math>X</math> is factorized as
<center><math>
Prob(X|T,T_s) = \prod_{i=1}^n Prob(X_i|T_i,T_s)
</math></center>
and we obtain for a particular poset <math>P</math> as follows:
<center><math>
Prob_{\lambda,P}(X) = Prob_{\lambda,P} [max_{i:X_i=1}T_i < T_s < min_{i:X_j=0}T_j ] 
</math></center>
where the minimum condition makes sure that the unobserved mutations have not occurred before the stopping time <math>T_s</math>. It requires that al the mutations <math>X_i</math> have been diagnosed correctly for the models parameter estimation. Due to diagnostic errors, there might be a chance of observation errors which we denote by <math>Y=(Y_1,Y_2,...,Y_n)</math>. This observation process is modeled as probability of false observation by a parameter <math>\epsilon</math>. Due to the independency of the conditioned variables <math>Y_i|X_i</math> for each <math>i \in [n]</math>, the conditional probability of observation <math>Y</math> for a given <math>X</math> is:
<center><math>
Prob_{\epsilon}(Y|X) = \prod_{i=1}^n Prob_{\epsilon}(Y_i|X_i) = \epsilon ^{d(X,Y)} (1-\epsilon)^{n-d(X,Y)}
</math></center>
where <math>d(X,Y)=\sum_{i=1}^n|X_i-Y_i|</math> is the Hamming distance between the genotype <math>X</math> and the observation genotype <math>Y</math>. In simple words, Hamming distance counts the number of mismatches between the observed genotype and the true genotype. The dynamics is a hidden process because the model is censored by a stopping event and the observation variable has errors. For parameter estimation, we use Bayes theorem to compute the posterior probability of observing the true genotype <math>X</math> given an observation genotype <math>Y</math> as
<center><math>
Prob_{\epsilon}(X|Y) = \frac{Prob_{\lambda,P}(X)Prob_{\epsilon}(Y|X)} {\sum_{X\in J(P)}Prob_{\lambda,P}(X) Prob_{\epsilon}(Y|X)}
</math></center>

===Parameter estimation===
Model parameters <math>\epsilon, \lambda</math> cane be estimated using "Expectation-Maximization" algorithm. The method of simulated annealing is used to estimate the poset <math>P</math>. The joint probability of "N" independent observations <math>Y=(Y_1,Y_2,...,Y_n)</math> can be factorized as
<center><math>
Prob_{\epsilon,\lambda,P}(Y) = \prod_{l=1} ^N Prob_{\epsilon,\lambda,P}(Y^{(l)}) = \prod_{l=1} ^N \sum_{X\in J(P)} Prob_{\lambda,P}(X) Prob_{\epsilon}(Y^{(l)}|X)
</math></center>
Then the log-likelihood is given by
<center><math>
l_Y(\epsilon,\lambda,P) = \sum_{l=1} ^N \log(\sum_{X\in J(P)} \epsilon ^{d(X,Y^{(l)})} (1-\epsilon)^{n-d(X,Y^{(l)})} Prob_{\lambda,P}(X))
</math></center>
Question: To maximize the log-likelihood for given observation <math>Y</math>. It depends on the error rate <math>\epsilon</math> and the waiting times <math>\lambda</math>.

* EM algorithm can be used to estimate <math>\lambda</math> if <math>P, X</math> are known quantities.
* For fixed <math>P</math> and a hidden <math>X</math>, this can be incorporated to a nested loop in the EM algorithm; where in the external loop estimates the parameter <math>\tilde \lambda</math> and the internal loop estimates the error rate <math>\tilde\epsilon</math> for a given <math>\tilde \lambda^{(k)}</math>

Note: If the variables <math>X, Y</math> are known then the maximum likelihood for the observation error rate is average distance between the two genotypes. 

Since the variable <math>X</math> is hidden, the error rate <math>\tilde\epsilon</math> is computed which is the E-step and use it in the M-step to compute maximum likelihood estimate as
<center><math>
\tilde\epsilon^{(j+1)} = \frac{1}{nN} \sum_{l=1} ^N (\sum_{X\in J(P)} d(X,Y^{l})Prob_{\tilde\epsilon^{(j},\tilde\lambda^{(k)},P}(X|Y^{(l)}))
</math></center>
The convergence of this estimate gives <math>\tilde\epsilon</math> that locally maximizes the function <math>l_Y(\epsilon,\lambda,P)</math>, which is used to estimate <math>\lambda</math>. For "N" realization of the waiting times parameters <math>T_i</math>, maximum likelihood estimate for the parameter <math>\lambda_i</math> is
<center><math>
\tilde\lambda_i = \frac{N}{\sum_{l=1}^N  T_i^{(l)}-max_{j\in pa(i)}T_j^{(l)}}
</math></center>
wherein the denominator can be replaced by the following quantity
<center><math>
E_{\tilde\lambda^{(k)},\tilde\epsilon^{(k)},P}( T_i^{(l)}-max_{m\in pa(i)}T_m|Y^{l}) = \sum_{X\in J(P)} E_{\tilde\lambda^{(k)},P} (T_i^{(l)}-max_{m\in pa(i)}T_m|X) Prob_{\tilde\lambda^{(k)},\tilde\epsilon^{(k)},P}(X|Y^{l})
</math></center>

Expectations are computed through dynamics programming. The values estimated from the above equation are inserted into the M-step to estimate <math>\tilde\lambda^{(k+1)}</math>. This process is done till the convergence is achieved. Since EM algorithm locally maximizes the data for a particular poset "P". Maximum likelihood poset is selected as <math>\tilde P = arg max_{P}  l_Y(\tilde\epsilon,\tilde\lambda,P)</math>. A heuristic way to determine this value is through simulated annealing method. In this approach, <math>l_Y(\tilde\epsilon,\tilde\lambda,P)</math> is computed for a given data set and a poset "P", then randomly another poset <math>P_1</math> is generated and the algorithm continues till <math>l_Y(\tilde\epsilon,\tilde\lambda,P_1) > l_Y(\tilde\epsilon,\tilde\lambda,P)</math>.

==Results==
This model analyzed various data sets for different cancer types such as renal cancer, colon cancer.

==Notes==
Beerenwinkel (one of the authors) previously put some assumptions and followed them when modelling the accumulative evolutionary process. Such assumptions are:

1. Substitutions do not occur independently. There are preferred evolutionary pathways in which mutations are fixed

2. The fixation mutations into the population is definite. This means that substitutions are non-reversible

3. At each time point, the virus population is dominated by a single strain and clones are independent and (sometimes erroneous) copies of this genotype

==Improvements==
As mentioned in the paper, an improvement on the proposed model would be to use different parameters <math>\varepsilon^+</math> and <math>\varepsilon^-</math> for false positives and false negatives in the error model. Beerenwinkel and Drton have developed this idea.

Let <math>\varepsilon^+ = (\varepsilon_1^+,...,\varepsilon_M^+) \in [0, 1]^M </math> and <math>\varepsilon^- = (\varepsilon_1^-,...,\varepsilon_M^-) \in [0, 1]^M </math> be parameter vectors that contain the mutation specific probabilities of observing a false positive and a false negative respectively. False positives (negatives) are mutations observed in clones derived from a virus population that is in mutant state at such time point. The false positive and false negative negative rates summarize differences from the population state. Then, these parameters quantify the expected genetic diversity of the virus population. Conditionally upon the hidden state <math>X_{jm}</math>, the probabilities of observing mutation <math>m</math> in clone <math>k</math> at time point <math>t_j</math> are as follows:

<center><math>\begin{matrix}
\theta^l(\varepsilon_m^+, \varepsilon_m^-) = \begin{matrix}
   & 0 & 1\\
 0 & 1-\varepsilon_m^+ & \varepsilon_m^+\\
 1 & \varepsilon_m^- & 1-\varepsilon_m^-
\end{matrix}
\end{matrix}</math></center>

The entries of this matrix are the conditional probabilities

<center><math>\begin{matrix}
\theta^l(\varepsilon_m^+, \varepsilon_m^-)_{x_{jm},y_{jkm}} = Prob(Y_{jkm}=y_{jkm}|X_{jm}=x_{jm})
\end{matrix}</math></center>

then the model is concluded accordingly.


==References==
<references />