Selection Policy-Induced Reduction Mappings for Boolean Networks

Dept. of Veterinary Physiol. & Pharmacology, Texas A&M Univ., College Station, TX, USA
IEEE Transactions on Signal Processing (Impact Factor: 2.79). 10/2010; 58(9):4871 - 4882. DOI: 10.1109/TSP.2010.2050314
Source: IEEE Xplore

ABSTRACT Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges have to be addressed before such models are successfully applied in practice. Their inherent high complexity requires strategies for complexity reduction. Reducing the complexity of the model by removing genes and interpreting them as latent variables leads to the problem of selecting which states and their corresponding transitions best account for the presence of such latent variables. We use the Boolean network (BN) model to develop the general framework for selection and reduction of the model's complexity via designating some of the model's variables as latent ones. We also study the effects of the selection policies on the steady-state distribution and the controllability of the model.

Download full-text


Available from: Noushin Ghaffari, Dec 19, 2013
14 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a novel algorithm (CoDReduce) for reducing the size of a probabilistic Boolean network (PBN) model for genomic regulation. The algorithm uses the coefficient of determination (CoD) to find the best candidate for dasiadeletionpsila gene. The selection policy that determines how the transition probabilities for the reduced network are obtained from those in the original network is designed using the steady-state distribution (SSD) of the model. The performance of the algorithm is measured by the shift in the steady-state distribution after applying the mean-first-passage-time (MFPT) control policy, and the relative effect of the selection policy on the MFPT control policy.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Computational modeling of genomic regulation has become an important focus of systems biology and genomic signal processing for the past several years. It holds the promise to uncover both the structure and dynamical properties of the complex gene, protein or metabolic networks responsible for the cell functioning in various contexts and regimes. This, in turn, will lead to the development of optimal intervention strategies for prevention and control of disease. At the same time, constructing such computational models faces several challenges. High complexity is one of the major impediments for the practical applications of the models. Thus, reducing the size/complexity of a model becomes a critical issue in problems such as model selection, construction of tractable subnetwork models, and control of its dynamical behavior. We focus on the reduction problem in the context of two specific models of genomic regulation: Boolean networks with perturbation (BN(P)) and probabilistic Boolean networks (PBN). We also compare and draw a parallel between the reduction problem and two other important problems of computational modeling of genomic networks: the problem of network inference and the problem of designing external control policies for intervention/altering the dynamics of the model.
    Current Genomics 09/2009; 10(6):375-87. DOI:10.2174/138920209789177584 · 2.34 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Accumulation 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. In 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. Simulation 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.
    BMC Bioinformatics 10/2011; 12 Suppl 10(Suppl 10):S9. DOI:10.1186/1471-2105-12-S10-S9 · 2.58 Impact Factor
Show more