Probabilistic reconstruction of the tumor progression process in gene regulatory networks in the presence of uncertainty

BackgroundAccumulation of gene mutations in cells is known to be responsible for tumor progression, driving it from benign states to malignant states. However, previous studies have shown that the detailed sequence of gene mutations, or the steps in tumor progression, may vary from tumor to tumor, making it difficult to infer the exact path that a given type of tumor may have taken.ResultsIn this paper, we propose an effective probabilistic algorithm for reconstructing the tumor progression process based on partial knowledge of the underlying gene regulatory network and the steady state distribution of the gene expression values in a given tumor. We take the BNp (Boolean networks with pertubation) framework to model the gene regulatory networks. We assume that the true network is not exactly known but we are given an uncertainty class of networks that contains the true network. This network uncertainty class arises from our partial knowledge of the true network, typically represented as a set of local pathways that are embedded in the global network. Given the SSD of the cancerous network, we aim to simultaneously identify the true normal (healthy) network and the set of gene mutations that drove the network into the cancerous state. This is achieved by analyzing the effect of gene mutation on the SSD of a gene regulatory network. At each step, the proposed algorithm reduces the uncertainty class by keeping only those networks whose SSDs get close enough to the cancerous SSD as a result of additional gene mutation. These steps are repeated until we can find the best candidate for the true network and the most probable path of tumor progression.ConclusionsSimulation results based on both synthetic networks and networks constructed from actual pathway knowledge show that the proposed algorithm can identify the normal network and the actual path of tumor progression with high probability. The algorithm is also robust to model mismatch and allows us to control the trade-off between efficiency and accuracy.

[1]  Galit Lahav,et al.  The ups and downs of p53: understanding protein dynamics in single cells , 2009, Nature Reviews Cancer.

[2]  P. Schweitzer Perturbation theory and finite Markov chains , 1968 .

[3]  R. Weinberg,et al.  The Biology of Cancer , 2006 .

[4]  Aniruddha Datta,et al.  Stationary and structural control in gene regulatory networks: basic concepts , 2010, Int. J. Syst. Sci..

[5]  Edward R. Dougherty,et al.  A CoD-based reduction algorithm for designing stationary control policies on Boolean networks , 2010, Bioinform..

[6]  E. Dougherty,et al.  On the long-run sensitivity of probabilistic Boolean networks. , 2009, Journal of theoretical biology.

[7]  L. Kadanoff,et al.  Boolean Dynamics with Random Couplings , 2002, nlin/0204062.

[8]  Jaakko Astola,et al.  The role of certain Post classes in Boolean network models of genetic networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Niko Beerenwinkel,et al.  Quantifying cancer progression with conjunctive Bayesian networks , 2009, Bioinform..

[10]  S. Kauffman,et al.  Genetic networks with canalyzing Boolean rules are always stable. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Edward R. Dougherty,et al.  Selection Policy-Induced Reduction Mappings for Boolean Networks , 2010, IEEE Transactions on Signal Processing.

[12]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[13]  Le Yu,et al.  Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence , 2007, EURASIP J. Bioinform. Syst. Biol..

[14]  Jerrold E. Marsden,et al.  Perspectives and Problems in Nonlinear Science , 2003 .

[15]  M. Karnaugh The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[16]  J. Hunter,et al.  Stationary Distributions and Mean First Passage Times of Perturbed Markov Chains , 1992 .

[17]  Edward R. Dougherty,et al.  State reduction for network intervention in probabilistic Boolean networks , 2010, Bioinform..

[18]  A. Datta,et al.  From biological pathways to regulatory networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[19]  Edward R. Dougherty,et al.  Effect of Function Perturbation on the Steady-State Distribution of Genetic Regulatory Networks: Optimal Structural Intervention , 2008, IEEE Transactions on Signal Processing.

[20]  Edward R. Dougherty,et al.  Genomic Signal Processing (Princeton Series in Applied Mathematics) , 2007 .

[21]  Aniruddha Datta,et al.  Systems biology Advance Access publication December 30, 2010 Cancer therapy design based on pathway logic , 2022 .

[22]  M Villani,et al.  Genetic network models and statistical properties of gene expression data in knock-out experiments. , 2004, Journal of theoretical biology.