Article

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: 3.2). 10/2010; 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.

0 Bookmarks
 · 
124 Views
  • [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.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The most effective cancer treatments are the ones that prolong patients' lives while offering a reasonable quality of life during and after treatment. The treatments must also carry out their actions rapidly and with high efficiency such that a very large percentage of tumor cells die or shift into a state where they stop proliferating. Due to biological and micro-environmental variabilities within tumor cells, the action period of an administered drug can vary among a population of patients. In this paper, based on a recently proposed model for tumor growth inhibition, we first probabilistically characterize the variability of the length of drug action. Then, we present a methodology to devise optimal intervention strategies for any Markovian genetic regulatory network governing the tumor when the antitumor drug has a random-length duration of action.
    IEEE transactions on bio-medical engineering 07/2013; DOI:10.1109/TBME.2013.2272891 · 2.15 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance [Formula: see text], the normalized Hamming distance of state transition [Formula: see text], and the steady-state distribution distance μ (ssd). Results show that the proposed algorithm outperforms the others according to both [Formula: see text] and [Formula: see text], whereas its performance according to μ (ssd) is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.
    EURASIP Journal on Bioinformatics and Systems Biology 12/2014; 2014(1):10. DOI:10.1186/s13637-014-0010-5

Full-text (3 Sources)

Download
25 Downloads
Available from
May 29, 2014