WorldWideScience

Sample records for boolean biological regulatory

  1. Boolean modeling in systems biology: an overview of methodology and applications

    International Nuclear Information System (INIS)

    Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh

    2012-01-01

    Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)

  2. A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.

    Directory of Open Access Journals (Sweden)

    Wensheng Guo

    Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.

  3. Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.

    Directory of Open Access Journals (Sweden)

    Maria Simak

    Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.

  4. Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Liang Jinghang

    2012-08-01

    network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. Conclusions Stochastic Boolean networks (SBNs are proposed as an efficient approach to modelling gene regulatory networks (GRNs. The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.

  5. Algebraic model checking for Boolean gene regulatory networks.

    Science.gov (United States)

    Tran, Quoc-Nam

    2011-01-01

    We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

  6. Controllability and observability of Boolean networks arising from biology

    Science.gov (United States)

    Li, Rui; Yang, Meng; Chu, Tianguang

    2015-02-01

    Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

  7. Boolean Models of Biological Processes Explain Cascade-Like Behavior.

    Science.gov (United States)

    Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen

    2016-01-29

    Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.

  8. Optimization-Based Approaches to Control of Probabilistic Boolean Networks

    Directory of Open Access Journals (Sweden)

    Koichi Kobayashi

    2017-02-01

    Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

  9. Causal structure of oscillations in gene regulatory networks: Boolean analysis of ordinary differential equation attractors.

    Science.gov (United States)

    Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S

    2013-06-01

    A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.

  10. Boolean Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

    Science.gov (United States)

    Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R

    2017-01-01

    Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.

  11. The spruce budworm and forest: a qualitative comparison of ODE and Boolean models

    Directory of Open Access Journals (Sweden)

    Raina Robeva

    2016-01-01

    Full Text Available Boolean and polynomial models of biological systems have emerged recently as viable companions to differential equations models. It is not immediately clear however whether such models are capable of capturing the multi-stable behaviour of certain biological systems: this behaviour is often sensitive to changes in the values of the model parameters, while Boolean and polynomial models are qualitative in nature. In the past few years, Boolean models of gene regulatory systems have been shown to capture multi-stability at the molecular level, confirming that such models can be used to obtain information about the system’s qualitative dynamics when precise information regarding its parameters may not be available. In this paper, we examine Boolean approximations of a classical ODE model of budworm outbreaks in a forest and show that these models exhibit a qualitative behaviour consistent with that derived from the ODE models. In particular, we demonstrate that these models can capture the bistable nature of insect population outbreaks, thus showing that Boolean models can be successfully utilized beyond the molecular level.

  12. Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

    Science.gov (United States)

    Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

    2012-08-29

    Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential

  13. Modeling stochasticity and robustness in gene regulatory networks.

    Science.gov (United States)

    Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

    2009-06-15

    Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

  14. Boolean modelling reveals new regulatory connections between transcription factors orchestrating the development of the ventral spinal cord.

    KAUST Repository

    Lovrics, Anna

    2014-11-14

    We have assembled a network of cell-fate determining transcription factors that play a key role in the specification of the ventral neuronal subtypes of the spinal cord on the basis of published transcriptional interactions. Asynchronous Boolean modelling of the network was used to compare simulation results with reported experimental observations. Such comparison highlighted the need to include additional regulatory connections in order to obtain the fixed point attractors of the model associated with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where the transcription factors were overexpressed. Furthermore the network predicted the inhibition of Irx3 by Nkx2.2 and this prediction was tested experimentally. Our results provide evidence for the existence of an as yet undescribed inhibitory connection which could potentially have significance beyond the ventral spinal cord. The work presented in this paper demonstrates the strength of Boolean modelling for identifying gene regulatory networks.

  15. Reliable dynamics in Boolean and continuous networks

    International Nuclear Information System (INIS)

    Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P

    2012-01-01

    We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)

  16. Computing preimages of Boolean networks.

    Science.gov (United States)

    Klotz, Johannes; Bossert, Martin; Schober, Steffen

    2013-01-01

    In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.

  17. An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks

    Science.gov (United States)

    Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei

    2013-01-01

    Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840

  18. Boolean models of biosurfactants production in Pseudomonas fluorescens.

    Directory of Open Access Journals (Sweden)

    Adrien Richard

    Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.

  19. Mining TCGA data using Boolean implications.

    Directory of Open Access Journals (Sweden)

    Subarna Sinha

    Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.

  20. Adapted Boolean network models for extracellular matrix formation

    Directory of Open Access Journals (Sweden)

    Wollbold Johannes

    2009-07-01

    Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF

  1. Optimal stabilization of Boolean networks through collective influence

    Science.gov (United States)

    Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

    2018-03-01

    Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

  2. A novel mutual information-based Boolean network inference method from time-series gene expression data.

    Directory of Open Access Journals (Sweden)

    Shohag Barman

    Full Text Available Inferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.In this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.Taken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.

  3. Interpolative Boolean Networks

    Directory of Open Access Journals (Sweden)

    Vladimir Dobrić

    2017-01-01

    Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.

  4. Boolean algebra essentials

    CERN Document Server

    Solomon, Alan D

    2012-01-01

    REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean

  5. Comparison of stationary and oscillatory dynamics described by differential equations and Boolean maps in transcriptional regulatory circuits

    Science.gov (United States)

    Ye, Weiming; Li, Pengfei; Huang, Xuhui; Xia, Qinzhi; Mi, Yuanyuan; Chen, Runsheng; Hu, Gang

    2010-10-01

    Exploring the principle and relationship of gene transcriptional regulations (TR) has been becoming a generally researched issue. So far, two major mathematical methods, ordinary differential equation (ODE) method and Boolean map (BM) method have been widely used for these purposes. It is commonly believed that simplified BMs are reasonable approximations of more realistic ODEs, and both methods may reveal qualitatively the same essential features though the dynamical details of both systems may show some differences. In this Letter we exhaustively enumerated all the 3-gene networks and many autonomous randomly constructed TR networks with more genes by using both the ODE and BM methods. In comparison we found that both methods provide practically identical results in most of cases of steady solutions. However, to our great surprise, most of network structures showing periodic cycles with the BM method possess only stationary states in ODE descriptions. These observations strongly suggest that many periodic oscillations and other complicated oscillatory states revealed by the BM rule may be related to the computational errors of variable and time discretizations and rarely have correspondence in realistic biology transcriptional regulatory circuits.

  6. Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

    Science.gov (United States)

    Mori, Fumito; Mochizuki, Atsushi

    2017-07-14

    Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

  7. BoolFilter: an R package for estimation and identification of partially-observed Boolean dynamical systems.

    Science.gov (United States)

    Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M

    2017-11-25

    Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression

  8. Boolean reasoning the logic of boolean equations

    CERN Document Server

    Brown, Frank Markham

    2012-01-01

    A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.

  9. Monotone Boolean functions

    International Nuclear Information System (INIS)

    Korshunov, A D

    2003-01-01

    Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years

  10. Boolean integral calculus

    Science.gov (United States)

    Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne

    1988-01-01

    The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.

  11. Free Boolean Topological Groups

    Directory of Open Access Journals (Sweden)

    Ol’ga Sipacheva

    2015-11-01

    Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.

  12. Properties of Boolean orthoposets

    Science.gov (United States)

    Tkadlec, Josef

    1993-10-01

    A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.

  13. Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes

    International Nuclear Information System (INIS)

    Liu, M; Bassler, K E

    2011-01-01

    Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.

  14. Computational complexity of Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

    Korshunov, Aleksei D [Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)

    2012-02-28

    Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.

  15. Quantum algorithms for testing Boolean functions

    Directory of Open Access Journals (Sweden)

    Erika Andersson

    2010-06-01

    Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

  16. Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks

    Directory of Open Access Journals (Sweden)

    Stalin Muñoz

    2018-03-01

    Full Text Available Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.

  17. Geometric Operators on Boolean Functions

    DEFF Research Database (Denmark)

    Frisvad, Jeppe Revall; Falster, Peter

    In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...

  18. Super-transient scaling in time-delay autonomous Boolean network motifs

    Energy Technology Data Exchange (ETDEWEB)

    D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)

    2016-09-15

    Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.

  19. Cryptographic Boolean functions and applications

    CERN Document Server

    Cusick, Thomas W

    2009-01-01

    Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...

  20. An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.

    Science.gov (United States)

    Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N

    2015-04-28

    Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.

  1. To Boolean or Not To Boolean.

    Science.gov (United States)

    Hildreth, Charles R.

    1983-01-01

    This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)

  2. Detecting small attractors of large Boolean networks by function-reduction-based strategy.

    Science.gov (United States)

    Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin

    2016-04-01

    Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.

  3. Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications

    OpenAIRE

    Pan, Chenyun; Naeemi, Azad

    2017-01-01

    The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...

  4. Algebraic partial Boolean algebras

    International Nuclear Information System (INIS)

    Smith, Derek

    2003-01-01

    Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A 5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E 8

  5. Polynomial algebra of discrete models in systems biology.

    Science.gov (United States)

    Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

    2010-07-01

    An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

  6. GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS

    OpenAIRE

    Ho, Juei-Ling

    2009-01-01

    Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...

  7. Boolean algebra

    CERN Document Server

    Goodstein, R L

    2007-01-01

    This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.

  8. Characterizing short-term stability for Boolean networks over any distribution of transfer functions

    International Nuclear Information System (INIS)

    Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.

    2016-01-01

    Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

  9. Rational Verification in Iterated Electric Boolean Games

    Directory of Open Access Journals (Sweden)

    Youssouf Oualhadj

    2016-07-01

    Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.

  10. Boolean orthoposets and two-valued states on them

    Science.gov (United States)

    Tkadlec, Josef

    1992-06-01

    A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.

  11. Boolean integral calculus for digital systems

    Science.gov (United States)

    Tucker, J. H.; Tapia, M. A.; Bennett, A. W.

    1985-01-01

    The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.

  12. Synchronization in an array of coupled Boolean networks

    International Nuclear Information System (INIS)

    Li, Rui; Chu, Tianguang

    2012-01-01

    This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.

  13. Social insect colony as a biological regulatory system: modelling information flow in dominance networks.

    Science.gov (United States)

    Nandi, Anjan K; Sumana, Annagiri; Bhattacharya, Kunal

    2014-12-06

    Social insects provide an excellent platform to investigate flow of information in regulatory systems since their successful social organization is essentially achieved by effective information transfer through complex connectivity patterns among the colony members. Network representation of such behavioural interactions offers a powerful tool for structural as well as dynamical analysis of the underlying regulatory systems. In this paper, we focus on the dominance interaction networks in the tropical social wasp Ropalidia marginata-a species where behavioural observations indicate that such interactions are principally responsible for the transfer of information between individuals about their colony needs, resulting in a regulation of their own activities. Our research reveals that the dominance networks of R. marginata are structurally similar to a class of naturally evolved information processing networks, a fact confirmed also by the predominance of a specific substructure-the 'feed-forward loop'-a key functional component in many other information transfer networks. The dynamical analysis through Boolean modelling confirms that the networks are sufficiently stable under small fluctuations and yet capable of more efficient information transfer compared to their randomized counterparts. Our results suggest the involvement of a common structural design principle in different biological regulatory systems and a possible similarity with respect to the effect of selection on the organization levels of such systems. The findings are also consistent with the hypothesis that dominance behaviour has been shaped by natural selection to co-opt the information transfer process in such social insect species, in addition to its primal function of mediation of reproductive competition in the colony. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

  14. Comparison of Control Approaches in Genetic Regulatory Networks by Using Stochastic Master Equation Models, Probabilistic Boolean Network Models and Differential Equation Models and Estimated Error Analyzes

    Science.gov (United States)

    Caglar, Mehmet Umut; Pal, Ranadip

    2011-03-01

    Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.

  15. Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles

    Directory of Open Access Journals (Sweden)

    Shah Imran

    2011-07-01

    Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our

  16. On Boolean functions with generalized cryptographic properties

    NARCIS (Netherlands)

    Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.

    2004-01-01

    By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.

  17. Evolution of regulatory networks towards adaptability and stability in a changing environment

    Science.gov (United States)

    Lee, Deok-Sun

    2014-11-01

    Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

  18. Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

    Science.gov (United States)

    Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj

    2016-01-01

    The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.

  19. Synthesizing biomolecule-based Boolean logic gates.

    Science.gov (United States)

    Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

    2013-02-15

    One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.

  20. Synthesizing Biomolecule-based Boolean Logic Gates

    Science.gov (United States)

    Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

    2012-01-01

    One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588

  1. On the Computation of Comprehensive Boolean Gröbner Bases

    Science.gov (United States)

    Inoue, Shutaro

    We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.

  2. An adaptable Boolean net trainable to control a computing robot

    International Nuclear Information System (INIS)

    Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.

    1999-01-01

    We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits

  3. A method to identify important dynamical states in Boolean models of regulatory networks: application to regulation of stomata closure by ABA in A. thaliana.

    Science.gov (United States)

    Bugs, Cristhian A; Librelotto, Giovani R; Mombach, José C M

    2011-12-22

    We introduce a method to analyze the states of regulatory Boolean models that identifies important network states and their biological influence on the global network dynamics. It consists in (1) finding the states of the network that are most frequently visited and (2) the identification of variable and frozen nodes of the network. The method, along with a simulation that includes random features, is applied to the study of stomata closure by abscisic acid (ABA) in A. thaliana proposed by Albert and coworkers. We find that for the case of study, that the dynamics of wild and mutant networks have just two states that are highly visited in their space of states and about a third of all nodes of the wild network are variable while the rest remain frozen in True or False states. This high number of frozen elements explains the low cardinality of the space of states of the wild network. Similar results are observed in the mutant networks. The application of the method allowed us to explain how wild and mutants behave dynamically in the SS and determined an essential feature of the activation of the closure node (representing stomata closure), i.e. its synchronization with the AnionEm node (representing anion efflux at the plasma membrane). The dynamics of this synchronization explains the efficiency reached by the wild and each of the mutant networks. For the biological problem analyzed, our method allows determining how wild and mutant networks differ 'phenotypically'. It shows that the different efficiencies of stomata closure reached among the simulated wild and mutant networks follow from a dynamical behavior of two nodes that are always synchronized. Additionally, we predict that the involvement of the anion efflux at the plasma membrane is crucial for the plant response to ABA. The algorithm used in the simulations is available upon request.

  4. An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

    Science.gov (United States)

    Cabessa, Jérémie; Villa, Alessandro E. P.

    2014-01-01

    We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

  5. PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE

    Directory of Open Access Journals (Sweden)

    Maria Angeles Gallego

    2014-11-01

    Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.

  6. Boolean gates on actin filaments

    International Nuclear Information System (INIS)

    Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew

    2016-01-01

    Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

  7. Boolean gates on actin filaments

    Energy Technology Data Exchange (ETDEWEB)

    Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)

    2016-01-08

    Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

  8. Mammalian synthetic biology: emerging medical applications.

    Science.gov (United States)

    Kis, Zoltán; Pereira, Hugo Sant'Ana; Homma, Takayuki; Pedrigi, Ryan M; Krams, Rob

    2015-05-06

    In this review, we discuss new emerging medical applications of the rapidly evolving field of mammalian synthetic biology. We start with simple mammalian synthetic biological components and move towards more complex and therapy-oriented gene circuits. A comprehensive list of ON-OFF switches, categorized into transcriptional, post-transcriptional, translational and post-translational, is presented in the first sections. Subsequently, Boolean logic gates, synthetic mammalian oscillators and toggle switches will be described. Several synthetic gene networks are further reviewed in the medical applications section, including cancer therapy gene circuits, immuno-regulatory networks, among others. The final sections focus on the applicability of synthetic gene networks to drug discovery, drug delivery, receptor-activating gene circuits and mammalian biomanufacturing processes. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

  9. Large Sets in Boolean and Non-Boolean Groups and Topology

    Directory of Open Access Journals (Sweden)

    Ol’ga V. Sipacheva

    2017-10-01

    Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.

  10. Identification of control targets in Boolean molecular network models via computational algebra.

    Science.gov (United States)

    Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

    2016-09-23

    Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

  11. Boolean-Valued Belief Functions

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2002-01-01

    Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002

  12. Nonlinear threshold Boolean automata networks and phase transitions

    OpenAIRE

    Demongeot, Jacques; Sené, Sylvain

    2010-01-01

    In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...

  13. Information encryption systems based on Boolean functions

    Directory of Open Access Journals (Sweden)

    Aureliu Zgureanu

    2011-02-01

    Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.

  14. Optical programmable Boolean logic unit.

    Science.gov (United States)

    Chattopadhyay, Tanay

    2011-11-10

    Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.

  15. Fisher information at the edge of chaos in random Boolean networks.

    Science.gov (United States)

    Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

    2011-01-01

    We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

  16. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate

    International Nuclear Information System (INIS)

    Dridi, G; Julien, R; Hliwa, M; Joachim, C

    2015-01-01

    The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)

  17. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

    Science.gov (United States)

    Dridi, G; Julien, R; Hliwa, M; Joachim, C

    2015-08-28

    The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

  18. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

    NARCIS (Netherlands)

    Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.

    Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then

  19. Summing Boolean Algebras

    Institute of Scientific and Technical Information of China (English)

    Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA

    2004-01-01

    In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.

  20. Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

    Science.gov (United States)

    Zhang, Jianming; Sclaroff, Stan

    2016-05-01

    We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.

  1. Minimum energy control and optimal-satisfactory control of Boolean control network

    International Nuclear Information System (INIS)

    Li, Fangfei; Lu, Xiwen

    2013-01-01

    In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.

  2. Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks

    Science.gov (United States)

    Gong, Xinwei

    This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing

  3. Refinement monoids, equidecomposability types, and boolean inverse semigroups

    CERN Document Server

    Wehrung, Friedrich

    2017-01-01

    Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.

  4. Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif

    1999-01-01

    The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...

  5. Complexity classifications for different equivalence and audit problems for Boolean circuits

    OpenAIRE

    Böhler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert

    2010-01-01

    We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.

  6. 3D Boolean operations in virtual surgical planning.

    Science.gov (United States)

    Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

    2017-10-01

    Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.

  7. Random networks of Boolean cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).

  8. Random networks of Boolean cellular automata

    International Nuclear Information System (INIS)

    Miranda, Enrique

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)

  9. Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes

    Institute of Scientific and Technical Information of China (English)

    Hao CHEN; Liang MA; Jianhua LI

    2011-01-01

    Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

  10. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms

  11. Classical Boolean logic gates with quantum systems

    International Nuclear Information System (INIS)

    Renaud, N; Joachim, C

    2011-01-01

    An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.

  12. A Boolean Approach to Airline Business Model Innovation

    DEFF Research Database (Denmark)

    Hvass, Kristian Anders

    Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....

  13. On Kolmogorov's superpositions and Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

    Beiu, V.

    1998-12-31

    The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.

  14. Evolutionary Algorithms for Boolean Queries Optimization

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.

    2006-01-01

    Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics

  15. Practical algorithms for linear boolean-width

    NARCIS (Netherlands)

    ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

    2015-01-01

    In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

  16. Practical algorithms for linear Boolean-width

    NARCIS (Netherlands)

    ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

    2015-01-01

    In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

  17. Boolean Queries Optimization by Genetic Algorithms

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav

    2005-01-01

    Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research

  18. Neutral space analysis for a Boolean network model of the fission yeast cell cycle network

    Directory of Open Access Journals (Sweden)

    Gonzalo A Ruz

    2014-01-01

    Full Text Available BACKGROUND: Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle. RESULTS: Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G1 fixed point was found for deterministic updating schemes. CONCLUSIONS: In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the

  19. Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.

    Science.gov (United States)

    Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai

    2017-08-02

    Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.

  20. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2016-01-01

    We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters

  1. BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool

    Science.gov (United States)

    Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.

    2006-01-01

    BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…

  2. Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

    Science.gov (United States)

    Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

    2018-06-01

    Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.

  3. Recombinant biologic products versus nutraceuticals from plants - a regulatory choice?

    Science.gov (United States)

    Drake, Pascal M W; Szeto, Tim H; Paul, Mathew J; Teh, Audrey Y-H; Ma, Julian K-C

    2017-01-01

    Biotechnology has transformed the potential for plants to be a manufacturing source of pharmaceutical compounds. Now, with transgenic and transient expression techniques, virtually any biologic, including vaccines and therapeutics, could be manufactured in plants. However, uncertainty over the regulatory path for such new pharmaceuticals has been a deterrent. Consideration has been given to using alternative regulatory paths, including those for nutraceuticals or cosmetic agents. This review will consider these possibilities, and discuss the difficulties in establishing regulatory guidelines for new pharmaceutical manufacturing technologies. © 2016 The British Pharmacological Society.

  4. Document Ranking in E-Extended Boolean Logic

    Czech Academy of Sciences Publication Activity Database

    Holub, M.; Húsek, Dušan; Pokorný, J.

    1996-01-01

    Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic

  5. Parallel object-oriented term rewriting : the booleans

    NARCIS (Netherlands)

    Rodenburg, P.H.; Vrancken, J.L.M.

    As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism

  6. Boolean representations of simplicial complexes and matroids

    CERN Document Server

    Rhodes, John

    2015-01-01

    This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context.   Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...

  7. Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

    Science.gov (United States)

    2015-01-01

    degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis

  8. PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.

    Directory of Open Access Journals (Sweden)

    Liam G Fearnley

    Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.

  9. An algebra-based method for inferring gene regulatory networks.

    Science.gov (United States)

    Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard

    2014-03-26

    The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the

  10. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor

    2016-07-28

    We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.

  11. Recombinant biologic products versus nutraceuticals from plants – a regulatory choice?

    Science.gov (United States)

    Drake, Pascal M. W.; Szeto, Tim H.; Paul, Mathew J.; Teh, Audrey Y.‐H.

    2016-01-01

    Biotechnology has transformed the potential for plants to be a manufacturing source of pharmaceutical compounds. Now, with transgenic and transient expression techniques, virtually any biologic, including vaccines and therapeutics, could be manufactured in plants. However, uncertainty over the regulatory path for such new pharmaceuticals has been a deterrent. Consideration has been given to using alternative regulatory paths, including those for nutraceuticals or cosmetic agents. This review will consider these possibilities, and discuss the difficulties in establishing regulatory guidelines for new pharmaceutical manufacturing technologies. PMID:27297459

  12. A complexity theory based on Boolean algebra

    DEFF Research Database (Denmark)

    Skyum, Sven; Valiant, Leslie

    1985-01-01

    A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...

  13. Improving the quantum cost of reversible Boolean functions using reorder algorithm

    Science.gov (United States)

    Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf

    2018-05-01

    This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.

  14. On the Boolean extension of the Birnbaum importance to non-coherent systems

    International Nuclear Information System (INIS)

    Aliee, Hananeh; Borgonovo, Emanuele; Glaß, Michael; Teich, Jürgen

    2017-01-01

    The Birnbaum importance measure plays a central role in reliability analysis. It has initially been introduced for coherent systems, where several of its properties hold and where its computation is straightforward. This work introduces a Boolean expression for the notion of criticality that allows the seamless extension of the Birnbaum importance to non-coherent systems. As a key feature, the novel definition makes the computation and encoding straightforward with well-established techniques such as Binary Decision Diagrams (BDDs) or Fault Trees (FTs). Several examples and a case study illustrate the findings. - Highlights: • We propose a Boolean expression for the notion of criticality in coherent and non-coherent systems. • The notion is connected with the Birnbaum importance measure. • The connection with Andrew's and Beeson extension is discussed. • The Boolean expression allows straightforward encoding in Binary Decision Diagrams.

  15. A Systems’ Biology Approach to Study MicroRNA-Mediated Gene Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Xin Lai

    2013-01-01

    Full Text Available MicroRNAs (miRNAs are potent effectors in gene regulatory networks where aberrant miRNA expression can contribute to human diseases such as cancer. For a better understanding of the regulatory role of miRNAs in coordinating gene expression, we here present a systems biology approach combining data-driven modeling and model-driven experiments. Such an approach is characterized by an iterative process, including biological data acquisition and integration, network construction, mathematical modeling and experimental validation. To demonstrate the application of this approach, we adopt it to investigate mechanisms of collective repression on p21 by multiple miRNAs. We first construct a p21 regulatory network based on data from the literature and further expand it using algorithms that predict molecular interactions. Based on the network structure, a detailed mechanistic model is established and its parameter values are determined using data. Finally, the calibrated model is used to study the effect of different miRNA expression profiles and cooperative target regulation on p21 expression levels in different biological contexts.

  16. Acoustic logic gates and Boolean operation based on self-collimating acoustic beams

    International Nuclear Information System (INIS)

    Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong

    2015-01-01

    The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations

  17. Synchronous versus asynchronous modeling of gene regulatory networks.

    Science.gov (United States)

    Garg, Abhishek; Di Cara, Alessandro; Xenarios, Ioannis; Mendoza, Luis; De Micheli, Giovanni

    2008-09-01

    In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene-gene, protein-protein and gene-protein interactions. The two dynamical properties that are often experimentally testable are perturbations and stable steady states. Although a lot of work has been done on the identification of steady states, not much work has been reported on in silico modeling of cellular differentiation processes. In this manuscript, we provide algorithms based on reduced ordered binary decision diagrams (ROBDDs) for Boolean modeling of gene regulatory networks. Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed. These algorithms allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Hereby we provide a framework to analyze the effect of multiple gene perturbation protocols, and their effect on cell differentiation processes. These algorithms were validated on the T-helper model showing the correct steady state identification and Th1-Th2 cellular differentiation process. The software binaries for Windows and Linux platforms can be downloaded from http://si2.epfl.ch/~garg/genysis.html.

  18. Mechanical system reliability analysis using a combination of graph theory and Boolean function

    International Nuclear Information System (INIS)

    Tang, J.

    2001-01-01

    A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis

  19. On the Road to Genetic Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.

    2007-01-01

    Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007

  20. Biological data warehousing system for identifying transcriptional regulatory sites from gene expressions of microarray data.

    Science.gov (United States)

    Tsou, Ann-Ping; Sun, Yi-Ming; Liu, Chia-Lin; Huang, Hsien-Da; Horng, Jorng-Tzong; Tsai, Meng-Feng; Liu, Baw-Juine

    2006-07-01

    Identification of transcriptional regulatory sites plays an important role in the investigation of gene regulation. For this propose, we designed and implemented a data warehouse to integrate multiple heterogeneous biological data sources with data types such as text-file, XML, image, MySQL database model, and Oracle database model. The utility of the biological data warehouse in predicting transcriptional regulatory sites of coregulated genes was explored using a synexpression group derived from a microarray study. Both of the binding sites of known transcription factors and predicted over-represented (OR) oligonucleotides were demonstrated for the gene group. The potential biological roles of both known nucleotides and one OR nucleotide were demonstrated using bioassays. Therefore, the results from the wet-lab experiments reinforce the power and utility of the data warehouse as an approach to the genome-wide search for important transcription regulatory elements that are the key to many complex biological systems.

  1. A High-Level Petri Net Framework for Genetic Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Banks Richard

    2007-12-01

    Full Text Available To understand the function of genetic regulatory networks in the development of cellular systems, we must not only realise the individual network entities, but also the manner by which they interact. Multi-valued networks are a promising qualitative approach for modelling such genetic regulatory networks, however, at present they have limited formal analysis techniques and tools. We present a flexible formal framework for modelling and analysing multi-valued genetic regulatory networks using high-level Petri nets and logic minimization techniques. We demonstrate our approach with a detailed case study in which part of the genetic regulatory network responsible for the carbon starvation stress response in Escherichia coli is modelled and analysed. We then compare and contrast this multivalued model to a corresponding Boolean model and consider their formal relationship.

  2. A transition calculus for Boolean functions. [logic circuit analysis

    Science.gov (United States)

    Tucker, J. H.; Bennett, A. W.

    1974-01-01

    A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.

  3. Elements of Boolean-Valued Dempster-Shafer Theory

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2000-01-01

    Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics

  4. Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables

    KAUST Repository

    Chikalov, Igor

    2013-01-01

    In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.

  5. A reverse engineering approach to optimize experiments for the construction of biological regulatory networks.

    Science.gov (United States)

    Zhang, Xiaomeng; Shao, Bin; Wu, Yangle; Qi, Ouyang

    2013-01-01

    One of the major objectives in systems biology is to understand the relation between the topological structures and the dynamics of biological regulatory networks. In this context, various mathematical tools have been developed to deduct structures of regulatory networks from microarray expression data. In general, from a single data set, one cannot deduct the whole network structure; additional expression data are usually needed. Thus how to design a microarray expression experiment in order to get the most information is a practical problem in systems biology. Here we propose three methods, namely, maximum distance method, trajectory entropy method, and sampling method, to derive the optimal initial conditions for experiments. The performance of these methods is tested and evaluated in three well-known regulatory networks (budding yeast cell cycle, fission yeast cell cycle, and E. coli. SOS network). Based on the evaluation, we propose an efficient strategy for the design of microarray expression experiments.

  6. Free Boolean algebras over unions of two well orderings

    Czech Academy of Sciences Publication Activity Database

    Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw

    2009-01-01

    Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009

  7. Synthetic Biology and the U.S. Biotechnology Regulatory System: Challenges and Options

    Energy Technology Data Exchange (ETDEWEB)

    Carter, Sarah R. [J. Craig Venter Inst., Rockville, MD (United States); Rodemeyer, Michael [Univ. of Virginia, Charlottesville, VA (United States); Garfinkel, Michele S. [EMBO, Heidelberg (Germany); Friedman, Robert M. [J. Craig Venter Inst., Rockville, MD (United States)

    2014-05-01

    Synthetic Biology and the U.S. Biotechnology Regulatory System: Challenges and Options Sarah R. Carter, Ph.D., J. Craig Venter Institute; Michael Rodemeyer, J.D., University of Virginia; Michele S. Garfinkel, Ph.D., EMBO; Robert M. Friedman, Ph.D., J. Craig Venter Institute In recent years, a range of genetic engineering techniques referred to as “synthetic biology” has significantly expanded the tool kit available to scientists and engineers, providing them with far greater capabilities to engineer organisms than previous techniques allowed. The field of synthetic biology includes the relatively new ability to synthesize long pieces of DNA from chemicals, as well as improved methods for genetic manipulation and design of genetic pathways to achieve more precise control of biological systems. These advances will help usher in a new generation of genetically engineered microbes, plants, and animals. The JCVI Policy Center team, along with researchers at the University of Virginia and EMBO, examined how well the current U.S. regulatory system for genetically engineered products will handle the near-term introduction of organisms engineered using synthetic biology. In particular, the focus was on those organisms intended to be used or grown directly in the environment, outside of a contained facility. The study concludes that the U.S. regulatory agencies have adequate legal authority to address most, but not all, potential environmental, health and safety concerns posed by these organisms. Such near-term products are likely to represent incremental changes rather than a marked departure from previous genetically engineered organisms. However, the study also identified two key challenges for the regulatory system, which are detailed in the report. First, USDA’s authority over genetically engineered plants depends on the use of an older engineering technique that is no longer necessary for many applications. The shift to synthetic biology and other newer genetic

  8. Jimena: efficient computing and system state identification for genetic regulatory networks.

    Science.gov (United States)

    Karl, Stefan; Dandekar, Thomas

    2013-10-11

    Boolean networks capture switching behavior of many naturally occurring regulatory networks. For semi-quantitative modeling, interpolation between ON and OFF states is necessary. The high degree polynomial interpolation of Boolean genetic regulatory networks (GRNs) in cellular processes such as apoptosis or proliferation allows for the modeling of a wider range of node interactions than continuous activator-inhibitor models, but suffers from scaling problems for networks which contain nodes with more than ~10 inputs. Many GRNs from literature or new gene expression experiments exceed those limitations and a new approach was developed. (i) As a part of our new GRN simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms greatly expedite the calculation of the polynomial interpolation in almost all cases, thereby expanding the range of networks which can be simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently counted and identified using binary decision diagrams. As application example, we show how system states can now be sampled efficiently in small up to large scale hormone disease networks (Arabidopsis thaliana development and immunity, pathogen Pseudomonas syringae and modulation by cytokinins and plant hormones). Jimena simulates currently available GRNs about 10-100 times faster than the previous implementation of the polynomial interpolation model and even greater gains are achieved for large scale-free networks. This speed-up also facilitates a much more thorough sampling of continuous state spaces which may lead to the identification of new stable states. Mutants of large networks can be constructed and analyzed very quickly enabling new insights into network robustness and behavior.

  9. Boolean comparative analysis of qualitative data : a methodological note

    NARCIS (Netherlands)

    Romme, A.G.L.

    1995-01-01

    This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final

  10. SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis

    International Nuclear Information System (INIS)

    Worrell, R.B.

    1985-01-01

    Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully

  11. Attractor controllability of Boolean networks by flipping a subset of their nodes

    Science.gov (United States)

    Rafimanzelat, Mohammad Reza; Bahrami, Fariba

    2018-04-01

    The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.

  12. Boolean network representation of contagion dynamics during a financial crisis

    Science.gov (United States)

    Caetano, Marco Antonio Leonel; Yoneyama, Takashi

    2015-01-01

    This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.

  13. Ordinary differential equations and Boolean networks in application to modelling of 6-mercaptopurine metabolism.

    Science.gov (United States)

    Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V

    2017-04-01

    We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.

  14. Boolean and advanced searching for EDGAR data on www.sec.gov

    Data.gov (United States)

    Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.

  15. Automatic compilation from high-level biologically-oriented programming language to genetic regulatory networks.

    Science.gov (United States)

    Beal, Jacob; Lu, Ting; Weiss, Ron

    2011-01-01

    The field of synthetic biology promises to revolutionize our ability to engineer biological systems, providing important benefits for a variety of applications. Recent advances in DNA synthesis and automated DNA assembly technologies suggest that it is now possible to construct synthetic systems of significant complexity. However, while a variety of novel genetic devices and small engineered gene networks have been successfully demonstrated, the regulatory complexity of synthetic systems that have been reported recently has somewhat plateaued due to a variety of factors, including the complexity of biology itself and the lag in our ability to design and optimize sophisticated biological circuitry. To address the gap between DNA synthesis and circuit design capabilities, we present a platform that enables synthetic biologists to express desired behavior using a convenient high-level biologically-oriented programming language, Proto. The high level specification is compiled, using a regulatory motif based mechanism, to a gene network, optimized, and then converted to a computational simulation for numerical verification. Through several example programs we illustrate the automated process of biological system design with our platform, and show that our compiler optimizations can yield significant reductions in the number of genes (~ 50%) and latency of the optimized engineered gene networks. Our platform provides a convenient and accessible tool for the automated design of sophisticated synthetic biological systems, bridging an important gap between DNA synthesis and circuit design capabilities. Our platform is user-friendly and features biologically relevant compiler optimizations, providing an important foundation for the development of sophisticated biological systems.

  16. Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

    Directory of Open Access Journals (Sweden)

    Vladimir A. Emelichev

    2002-11-01

    Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained.

  17. The value of less connected agents in Boolean networks

    Science.gov (United States)

    Epstein, Daniel; Bazzan, Ana L. C.

    2013-11-01

    In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality

  18. Confluence of an extension of combinatory logic by Boolean constants

    DEFF Research Database (Denmark)

    Czajka, Łukasz

    2017-01-01

    We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

  19. A Construction of Boolean Functions with Good Cryptographic Properties

    Science.gov (United States)

    2014-01-01

    be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum

  20. Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

    Science.gov (United States)

    Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

    2014-06-26

    A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for

  1. Boolean Factor Analysis by Attractor Neural Network

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

    2007-01-01

    Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007

  2. Model checking optimal finite-horizon control for probabilistic gene regulatory networks.

    Science.gov (United States)

    Wei, Ou; Guo, Zonghao; Niu, Yun; Liao, Wenyuan

    2017-12-14

    Probabilistic Boolean networks (PBNs) have been proposed for analyzing external control in gene regulatory networks with incorporation of uncertainty. A context-sensitive PBN with perturbation (CS-PBNp), extending a PBN with context-sensitivity to reflect the inherent biological stability and random perturbations to express the impact of external stimuli, is considered to be more suitable for modeling small biological systems intervened by conditions from the outside. In this paper, we apply probabilistic model checking, a formal verification technique, to optimal control for a CS-PBNp that minimizes the expected cost over a finite control horizon. We first describe a procedure of modeling a CS-PBNp using the language provided by a widely used probabilistic model checker PRISM. We then analyze the reward-based temporal properties and the computation in probabilistic model checking; based on the analysis, we provide a method to formulate the optimal control problem as minimum reachability reward properties. Furthermore, we incorporate control and state cost information into the PRISM code of a CS-PBNp such that automated model checking a minimum reachability reward property on the code gives the solution to the optimal control problem. We conduct experiments on two examples, an apoptosis network and a WNT5A network. Preliminary experiment results show the feasibility and effectiveness of our approach. The approach based on probabilistic model checking for optimal control avoids explicit computation of large-size state transition relations associated with PBNs. It enables a natural depiction of the dynamics of gene regulatory networks, and provides a canonical form to formulate optimal control problems using temporal properties that can be automated solved by leveraging the analysis power of underlying model checking engines. This work will be helpful for further utilization of the advances in formal verification techniques in system biology.

  3. Boolean analysis reveals systematic interactions among low-abundance species in the human gut microbiome.

    Directory of Open Access Journals (Sweden)

    Jens Christian Claussen

    2017-06-01

    Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.

  4. CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS

    Directory of Open Access Journals (Sweden)

    P. N. Bibilo

    2016-01-01

    Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.

  5. Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

    Science.gov (United States)

    Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

    2016-11-01

    Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  6. Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

    Directory of Open Access Journals (Sweden)

    Yih-Lon Lin

    2013-01-01

    Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

  7. Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

    OpenAIRE

    Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

    2012-01-01

    Abstract Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. Background There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real...

  8. The Boolean algebra and central Galois algebras

    Directory of Open Access Journals (Sweden)

    George Szeto

    2001-01-01

    Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb   for all   x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.

  9. Analysis and control of Boolean networks a semi-tensor product approach

    CERN Document Server

    Cheng, Daizhan; Li, Zhiqiang

    2010-01-01

    This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.

  10. A GA-P algorithm to automatically formulate extended Boolean queries for a fuzzy information retrieval system

    OpenAIRE

    Cordón García, Oscar; Moya Anegón, Félix de; Zarco Fernández, Carmen

    2000-01-01

    [ES] Although the fuzzy retrieval model constitutes a powerful extension of the boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered t...

  11. Boolean Operations with Prism Algebraic Patches

    Science.gov (United States)

    Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

    2009-01-01

    In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

  12. Vector Boolean Functions: applications in symmetric cryptography

    OpenAIRE

    Álvarez Cubero, José Antonio

    2015-01-01

    Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...

  13. Boolean Functions with a Simple Certificate for CNF Complexity

    Czech Academy of Sciences Publication Activity Database

    Čepek, O.; Kučera, P.; Savický, Petr

    2012-01-01

    Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012

  14. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

    Directory of Open Access Journals (Sweden)

    Gijs Kant

    2012-10-01

    Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.

  15. A new separation algorithm for the Boolean quadric and cut polytopes

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros; Letchford, Adam N.

    2014-01-01

    A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...

  16. Two Expectation-Maximization Algorithms for Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    2014-01-01

    Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014

  17. Multipath Detection Using Boolean Satisfiability Techniques

    Directory of Open Access Journals (Sweden)

    Fadi A. Aloul

    2011-01-01

    Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.

  18. The Boolean algebra of Galois algebras

    Directory of Open Access Journals (Sweden)

    Lianyong Xue

    2003-02-01

    Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B|bx=g(xb for all x∈B} for each g∈G, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|g∈G}, e a nonzero element in Ba, and He={g∈G|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.

  19. Describing the What and Why of Students' Difficulties in Boolean Logic

    Science.gov (United States)

    Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig

    2012-01-01

    The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…

  20. Application of fuzzy logic to Boolean models for digital soil assessment

    NARCIS (Netherlands)

    Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.

    2011-01-01

    Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between

  1. A short Boolean derivation of mean failure frequency for any (also non-coherent) system

    International Nuclear Information System (INIS)

    Schneeweiss, Winfrid G.

    2009-01-01

    For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.

  2. Low doses of ionizing radiation: Biological effects and regulatory control. Contributed papers

    International Nuclear Information System (INIS)

    1997-11-01

    The International Atomic Energy Agency and the World Health Organization, in cooperation with the United Nations Scientific Committee on the Effects of Atomic Radiation, organized an international conference on Low Doses of Ionizing Radiation: Biological Effects and Regulatory Control, held in seville, Spain, from 17 to 21 November 1997. This technical document contains concise papers submitted to the conference

  3. Stability of Boolean multilevel networks.

    Science.gov (United States)

    Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

    2012-09-01

    The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.

  4. Integrating external biological knowledge in the construction of regulatory networks from time-series expression data

    Directory of Open Access Journals (Sweden)

    Lo Kenneth

    2012-08-01

    Full Text Available Abstract Background Inference about regulatory networks from high-throughput genomics data is of great interest in systems biology. We present a Bayesian approach to infer gene regulatory networks from time series expression data by integrating various types of biological knowledge. Results We formulate network construction as a series of variable selection problems and use linear regression to model the data. Our method summarizes additional data sources with an informative prior probability distribution over candidate regression models. We extend the Bayesian model averaging (BMA variable selection method to select regulators in the regression framework. We summarize the external biological knowledge by an informative prior probability distribution over the candidate regression models. Conclusions We demonstrate our method on simulated data and a set of time-series microarray experiments measuring the effect of a drug perturbation on gene expression levels, and show that it outperforms leading regression-based methods in the literature.

  5. Message passing for quantified Boolean formulas

    International Nuclear Information System (INIS)

    Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka

    2012-01-01

    We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers

  6. Optical reversible programmable Boolean logic unit.

    Science.gov (United States)

    Chattopadhyay, Tanay

    2012-07-20

    Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.

  7. Low doses of ionizing radiation: Biological effects and regulatory control. Contributed papers

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-11-01

    The International Atomic Energy Agency and the World Health Organization, in cooperation with the United Nations Scientific Committee on the Effects of Atomic Radiation, organized an international conference on Low Doses of Ionizing Radiation: Biological Effects and Regulatory Control, held in seville, Spain, from 17 to 21 November 1997. This technical document contains concise papers submitted to the conference. Refs, figs, tabs.

  8. Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2013-01-01

    In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization

  9. Exact sampling from conditional Boolean models with applications to maximum likelihood inference

    NARCIS (Netherlands)

    Lieshout, van M.N.M.; Zwet, van E.W.

    2001-01-01

    We are interested in estimating the intensity parameter of a Boolean model of discs (the bombing model) from a single realization. To do so, we derive the conditional distribution of the points (germs) of the underlying Poisson process. We demonstrate how to apply coupling from the past to generate

  10. Discrete dynamic modeling of cellular signaling networks.

    Science.gov (United States)

    Albert, Réka; Wang, Rui-Sheng

    2009-01-01

    Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

  11. Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.

    Science.gov (United States)

    Dallidis, Stylianos E; Karafyllidis, Ioannis G

    2014-09-01

    To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.

  12. Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

    Directory of Open Access Journals (Sweden)

    Natalie Berestovsky

    Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

  13. General method to find the attractors of discrete dynamic models of biological systems

    Science.gov (United States)

    Gan, Xiao; Albert, Réka

    2018-04-01

    Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

  14. General method to find the attractors of discrete dynamic models of biological systems.

    Science.gov (United States)

    Gan, Xiao; Albert, Réka

    2018-04-01

    Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

  15. Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics

    NARCIS (Netherlands)

    Jenner, Ronald A.

    2002-01-01

    A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic

  16. A boolean optimization method for reloading a nuclear reactor

    International Nuclear Information System (INIS)

    Misse Nseke, Theophile.

    1982-04-01

    We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr

  17. A framework to find the logic backbone of a biological network.

    Science.gov (United States)

    Maheshwari, Parul; Albert, Réka

    2017-12-06

    Cellular behaviors are governed by interaction networks among biomolecules, for example gene regulatory and signal transduction networks. An often used dynamic modeling framework for these networks, Boolean modeling, can obtain their attractors (which correspond to cell types and behaviors) and their trajectories from an initial state (e.g. a resting state) to the attractors, for example in response to an external signal. The existing methods however do not elucidate the causal relationships between distant nodes in the network. In this work, we propose a simple logic framework, based on categorizing causal relationships as sufficient or necessary, as a complement to Boolean networks. We identify and explore the properties of complex subnetworks that are distillable into a single logic relationship. We also identify cyclic subnetworks that ensure the stabilization of the state of participating nodes regardless of the rest of the network. We identify the logic backbone of biomolecular networks, consisting of external signals, self-sustaining cyclic subnetworks (stable motifs), and output nodes. Furthermore, we use the logic framework to identify crucial nodes whose override can drive the system from one steady state to another. We apply these techniques to two biological networks: the epithelial-to-mesenchymal transition network corresponding to a developmental process exploited in tumor invasion, and the network of abscisic acid induced stomatal closure in plants. We find interesting subnetworks with logical implications in these networks. Using these subgraphs and motifs, we efficiently reduce both networks to succinct backbone structures. The logic representation identifies the causal relationships between distant nodes and subnetworks. This knowledge can form the basis of network control or used in the reverse engineering of networks.

  18. Boolean-Like and Frequentistic Nonstandard Semantics for First-Order Predicate Calculus without Functions

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2001-01-01

    Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics

  19. Equilibrium and nonequilibrium properties of Boolean decision problems on scale-free graphs with competing interactions with external biases

    Science.gov (United States)

    Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.

    2013-03-01

    We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.

  20. User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.

    Science.gov (United States)

    Ensor, Pat

    1992-01-01

    Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…

  1. Comparison of Boolean analysis and standard phylogenetic methods using artificially evolved and natural mt-tRNA sequences from great apes.

    Science.gov (United States)

    Ari, Eszter; Ittzés, Péter; Podani, János; Thi, Quynh Chi Le; Jakó, Eena

    2012-04-01

    Boolean analysis (or BOOL-AN; Jakó et al., 2009. BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction. Mol. Phylogenet. Evol. 52, 887-97.), a recently developed method for sequence comparison uses the Iterative Canonical Form of Boolean functions. It considers sequence information in a way entirely different from standard phylogenetic methods (i.e. Maximum Parsimony, Maximum-Likelihood, Neighbor-Joining, and Bayesian analysis). The performance and reliability of Boolean analysis were tested and compared with the standard phylogenetic methods, using artificially evolved - simulated - nucleotide sequences and the 22 mitochondrial tRNA genes of the great apes. At the outset, we assumed that the phylogeny of Hominidae is generally well established, and the guide tree of artificial sequence evolution can also be used as a benchmark. These offer a possibility to compare and test the performance of different phylogenetic methods. Trees were reconstructed by each method from 2500 simulated sequences and 22 mitochondrial tRNA sequences. We also introduced a special re-sampling method for Boolean analysis on permuted sequence sites, the P-BOOL-AN procedure. Considering the reliability values (branch support values of consensus trees and Robinson-Foulds distances) we used for simulated sequence trees produced by different phylogenetic methods, BOOL-AN appeared as the most reliable method. Although the mitochondrial tRNA sequences of great apes are relatively short (59-75 bases long) and the ratio of their constant characters is about 75%, BOOL-AN, P-BOOL-AN and the Bayesian approach produced the same tree-topology as the established phylogeny, while the outcomes of Maximum Parsimony, Maximum-Likelihood and Neighbor-Joining methods were equivocal. We conclude that Boolean analysis is a promising alternative to existing methods of sequence comparison for phylogenetic reconstruction and congruence analysis. Copyright © 2012 Elsevier Inc. All

  2. Timing robustness in the budding and fission yeast cell cycles.

    KAUST Repository

    Mangla, Karan

    2010-02-01

    Robustness of biological models has emerged as an important principle in systems biology. Many past analyses of Boolean models update all pending changes in signals simultaneously (i.e., synchronously), making it impossible to consider robustness to variations in timing that result from noise and different environmental conditions. We checked previously published mathematical models of the cell cycles of budding and fission yeast for robustness to timing variations by constructing Boolean models and analyzing them using model-checking software for the property of speed independence. Surprisingly, the models are nearly, but not totally, speed-independent. In some cases, examination of timing problems discovered in the analysis exposes apparent inaccuracies in the model. Biologically justified revisions to the model eliminate the timing problems. Furthermore, in silico random mutations in the regulatory interactions of a speed-independent Boolean model are shown to be unlikely to preserve speed independence, even in models that are otherwise functional, providing evidence for selection pressure to maintain timing robustness. Multiple cell cycle models exhibit strong robustness to timing variation, apparently due to evolutionary pressure. Thus, timing robustness can be a basis for generating testable hypotheses and can focus attention on aspects of a model that may need refinement.

  3. Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions

    DEFF Research Database (Denmark)

    Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne

    2005-01-01

    We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....

  4. Complex network analysis of state spaces for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)

    2008-01-15

    We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.

  5. Complex network analysis of state spaces for random Boolean networks

    International Nuclear Information System (INIS)

    Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya

    2008-01-01

    We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two

  6. Damage Spreading in Spatial and Small-world Random Boolean Networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.

    2014-02-18

    The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

  7. Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type

    Science.gov (United States)

    Matoušek, Milan; Pták, Pavel

    2015-12-01

    Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.

  8. Robustness and backbone motif of a cancer network regulated by miR-17-92 cluster during the G1/S transition.

    Directory of Open Access Journals (Sweden)

    Lijian Yang

    Full Text Available Based on interactions among transcription factors, oncogenes, tumor suppressors and microRNAs, a Boolean model of cancer network regulated by miR-17-92 cluster is constructed, and the network is associated with the control of G1/S transition in the mammalian cell cycle. The robustness properties of this regulatory network are investigated by virtue of the Boolean network theory. It is found that, during G1/S transition in the cell cycle process, the regulatory networks are robustly constructed, and the robustness property is largely preserved with respect to small perturbations to the network. By using the unique process-based approach, the structure of this network is analyzed. It is shown that the network can be decomposed into a backbone motif which provides the main biological functions, and a remaining motif which makes the regulatory system more stable. The critical role of miR-17-92 in suppressing the G1/S cell cycle checkpoint and increasing the uncontrolled proliferation of the cancer cells by targeting a genetic network of interacting proteins is displayed with our model.

  9. Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann

    Czech Academy of Sciences Publication Activity Database

    Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

    2005-01-01

    Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

  10. Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

    Science.gov (United States)

    Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

    2009-08-01

    We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

  11. Boolean logic analysis for flow regime recognition of gas–liquid horizontal flow

    International Nuclear Information System (INIS)

    Ramskill, Nicholas P; Wang, Mi

    2011-01-01

    In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime

  12. Feedback topology and XOR-dynamics in Boolean networks with varying input structure

    Science.gov (United States)

    Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

    2009-08-01

    We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

  13. Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.

    Science.gov (United States)

    Fox, Edward A.; Winett, Sheila G.

    1990-01-01

    Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…

  14. Challenges for modeling global gene regulatory networks during development: insights from Drosophila.

    Science.gov (United States)

    Wilczynski, Bartek; Furlong, Eileen E M

    2010-04-15

    Development is regulated by dynamic patterns of gene expression, which are orchestrated through the action of complex gene regulatory networks (GRNs). Substantial progress has been made in modeling transcriptional regulation in recent years, including qualitative "coarse-grain" models operating at the gene level to very "fine-grain" quantitative models operating at the biophysical "transcription factor-DNA level". Recent advances in genome-wide studies have revealed an enormous increase in the size and complexity or GRNs. Even relatively simple developmental processes can involve hundreds of regulatory molecules, with extensive interconnectivity and cooperative regulation. This leads to an explosion in the number of regulatory functions, effectively impeding Boolean-based qualitative modeling approaches. At the same time, the lack of information on the biophysical properties for the majority of transcription factors within a global network restricts quantitative approaches. In this review, we explore the current challenges in moving from modeling medium scale well-characterized networks to more poorly characterized global networks. We suggest to integrate coarse- and find-grain approaches to model gene regulatory networks in cis. We focus on two very well-studied examples from Drosophila, which likely represent typical developmental regulatory modules across metazoans. Copyright (c) 2009 Elsevier Inc. All rights reserved.

  15. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.

  16. Graphene-based non-Boolean logic circuits

    Science.gov (United States)

    Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.

    2013-10-01

    Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.

  17. Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.

    Science.gov (United States)

    Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

    2015-11-01

    We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.

  18. Bebop to the Boolean boogie an unconventional guide to electronics

    CERN Document Server

    Maxfield, Clive

    2003-01-01

    From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour

  19. The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students

    Science.gov (United States)

    Tomaszewski, Robert

    2016-01-01

    Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…

  20. Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

    Science.gov (United States)

    Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.

    2014-02-01

    We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

  1. Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.

    Directory of Open Access Journals (Sweden)

    Herman F Fumiã

    Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.

  2. On the number of different dynamics in Boolean networks with deterministic update schedules.

    Science.gov (United States)

    Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

    2013-04-01

    Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

  3. Epidemiologic studies of occupational pesticide exposure and cancer: regulatory risk assessments and biologic plausibility.

    Science.gov (United States)

    Acquavella, John; Doe, John; Tomenson, John; Chester, Graham; Cowell, John; Bloemen, Louis

    2003-01-01

    Epidemiologic studies frequently show associations between self-reported use of specific pesticides and human cancers. These findings have engendered debate largely on methodologic grounds. However, biologic plausibility is a more fundamental issue that has received only superficial attention. The purpose of this commentary is to review briefly the toxicology and exposure data that are developed as part of the pesticide regulatory process and to discuss the applicability of this data to epidemiologic research. The authors also provide a generic example of how worker pesticide exposures might be estimated and compared to relevant toxicologic dose levels. This example provides guidance for better characterization of exposure and for consideration of biologic plausibility in epidemiologic studies of pesticides.

  4. Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask

    OpenAIRE

    Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti

    2012-01-01

    Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.

  5. Regulatory activities

    International Nuclear Information System (INIS)

    2001-01-01

    This publication, compiled in 8 chapters, presents the regulatory system developed by the Nuclear Regulatory Authority (NRA) of the Argentine Republic. The following activities and developed topics in this document describe: the evolution of the nuclear regulatory activity in Argentina; the Argentine regulatory system; the nuclear regulatory laws and standards; the inspection and safeguards of nuclear facilities; the emergency systems; the environmental systems; the environmental monitoring; the analysis laboratories on physical and biological dosimetry, prenatal irradiation, internal irradiation, radiation measurements, detection techniques on nuclear testing, medical program on radiation protection; the institutional relations with national and international organization; the training courses and meeting; the technical information

  6. Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann

    Czech Academy of Sciences Publication Activity Database

    Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

    2005-01-01

    Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

  7. Spatiotemporal network motif reveals the biological traits of developmental gene regulatory networks in Drosophila melanogaster

    Directory of Open Access Journals (Sweden)

    Kim Man-Sun

    2012-05-01

    Full Text Available Abstract Background Network motifs provided a “conceptual tool” for understanding the functional principles of biological networks, but such motifs have primarily been used to consider static network structures. Static networks, however, cannot be used to reveal time- and region-specific traits of biological systems. To overcome this limitation, we proposed the concept of a “spatiotemporal network motif,” a spatiotemporal sequence of network motifs of sub-networks which are active only at specific time points and body parts. Results On the basis of this concept, we analyzed the developmental gene regulatory network of the Drosophila melanogaster embryo. We identified spatiotemporal network motifs and investigated their distribution pattern in time and space. As a result, we found how key developmental processes are temporally and spatially regulated by the gene network. In particular, we found that nested feedback loops appeared frequently throughout the entire developmental process. From mathematical simulations, we found that mutual inhibition in the nested feedback loops contributes to the formation of spatial expression patterns. Conclusions Taken together, the proposed concept and the simulations can be used to unravel the design principle of developmental gene regulatory networks.

  8. Boolean Algebra Application in Analysis of Flight Accidents

    Directory of Open Access Journals (Sweden)

    Casandra Venera BALAN

    2015-12-01

    Full Text Available Fault tree analysis is a deductive approach for resolving an undesired event into its causes, identifying the causes of a failure and providing a framework for a qualitative and quantitative evaluation of the top event. An alternative approach to fault tree analysis methods calculus goes to logical expressions and it is based on a graphical representation of the data structure for a logic - based binary decision diagram representation. In this analysis, such sites will be reduced to a minimal size and arranged in the sense that the variables appear in the same order in each path. An event can be defined as a statement that can be true or false. Therefore, Boolean algebra rules allow restructuring of a Fault Tree into one equivalent to it, but simpler.

  9. Unlimited multistability and Boolean logic in microbial signalling

    DEFF Research Database (Denmark)

    Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca

    2015-01-01

    The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation...... seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two...

  10. A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks.

    Directory of Open Access Journals (Sweden)

    Teeraphan Laomettachit

    Full Text Available To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a "standard component" modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with "standard components" can capture in quantitative detail many essential properties of cell cycle control in budding yeast.

  11. Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    2009-01-01

    Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009

  12. Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral space

    Science.gov (United States)

    Szejka, Agnes; Drossel, Barbara

    2010-02-01

    We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.

  13. Root Systems Biology: Integrative Modeling across Scales, from Gene Regulatory Networks to the Rhizosphere1

    Science.gov (United States)

    Hill, Kristine; Porco, Silvana; Lobet, Guillaume; Zappala, Susan; Mooney, Sacha; Draye, Xavier; Bennett, Malcolm J.

    2013-01-01

    Genetic and genomic approaches in model organisms have advanced our understanding of root biology over the last decade. Recently, however, systems biology and modeling have emerged as important approaches, as our understanding of root regulatory pathways has become more complex and interpreting pathway outputs has become less intuitive. To relate root genotype to phenotype, we must move beyond the examination of interactions at the genetic network scale and employ multiscale modeling approaches to predict emergent properties at the tissue, organ, organism, and rhizosphere scales. Understanding the underlying biological mechanisms and the complex interplay between systems at these different scales requires an integrative approach. Here, we describe examples of such approaches and discuss the merits of developing models to span multiple scales, from network to population levels, and to address dynamic interactions between plants and their environment. PMID:24143806

  14. A canonical correlation analysis-based dynamic bayesian network prior to infer gene regulatory networks from multiple types of biological data.

    Science.gov (United States)

    Baur, Brittany; Bozdag, Serdar

    2015-04-01

    One of the challenging and important computational problems in systems biology is to infer gene regulatory networks (GRNs) of biological systems. Several methods that exploit gene expression data have been developed to tackle this problem. In this study, we propose the use of copy number and DNA methylation data to infer GRNs. We developed an algorithm that scores regulatory interactions between genes based on canonical correlation analysis. In this algorithm, copy number or DNA methylation variables are treated as potential regulator variables, and expression variables are treated as potential target variables. We first validated that the canonical correlation analysis method is able to infer true interactions in high accuracy. We showed that the use of DNA methylation or copy number datasets leads to improved inference over steady-state expression. Our results also showed that epigenetic and structural information could be used to infer directionality of regulatory interactions. Additional improvements in GRN inference can be gleaned from incorporating the result in an informative prior in a dynamic Bayesian algorithm. This is the first study that incorporates copy number and DNA methylation into an informative prior in dynamic Bayesian framework. By closely examining top-scoring interactions with different sources of epigenetic or structural information, we also identified potential novel regulatory interactions.

  15. Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

    International Nuclear Information System (INIS)

    Zheng, Jinbin

    2014-01-01

    In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software

  16. Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

    OpenAIRE

    Andrade, Jefferson O.; Kameyama, Yukiyoshi

    2012-01-01

    Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...

  17. Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

    Energy Technology Data Exchange (ETDEWEB)

    Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)

    2014-10-06

    In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

  18. Boolean modelling reveals new regulatory connections between transcription factors orchestrating the development of the ventral spinal cord.

    KAUST Repository

    Lovrics, Anna; Gao, Yu; Juhá sz, Bianka; Bock, Istvá n; Byrne, Helen M; Dinnyé s, Andrá s; Ková cs, Krisztiá n A

    2014-01-01

    with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where

  19. Proteome-wide Structural Analysis of PTM Hotspots Reveals Regulatory Elements Predicted to Impact Biological Function and Disease.

    Science.gov (United States)

    Torres, Matthew P; Dewhurst, Henry; Sundararaman, Niveda

    2016-11-01

    Post-translational modifications (PTMs) regulate protein behavior through modulation of protein-protein interactions, enzymatic activity, and protein stability essential in the translation of genotype to phenotype in eukaryotes. Currently, less than 4% of all eukaryotic PTMs are reported to have biological function - a statistic that continues to decrease with an increasing rate of PTM detection. Previously, we developed SAPH-ire (Structural Analysis of PTM Hotspots) - a method for the prioritization of PTM function potential that has been used effectively to reveal novel PTM regulatory elements in discrete protein families (Dewhurst et al., 2015). Here, we apply SAPH-ire to the set of eukaryotic protein families containing experimental PTM and 3D structure data - capturing 1,325 protein families with 50,839 unique PTM sites organized into 31,747 modified alignment positions (MAPs), of which 2010 (∼6%) possess known biological function. Here, we show that using an artificial neural network model (SAPH-ire NN) trained to identify MAP hotspots with biological function results in prediction outcomes that far surpass the use of single hotspot features, including nearest neighbor PTM clustering methods. We find the greatest enhancement in prediction for positions with PTM counts of five or less, which represent 98% of all MAPs in the eukaryotic proteome and 90% of all MAPs found to have biological function. Analysis of the top 1092 MAP hotspots revealed 267 of truly unknown function (containing 5443 distinct PTMs). Of these, 165 hotspots could be mapped to human KEGG pathways for normal and/or disease physiology. Many high-ranking hotspots were also found to be disease-associated pathogenic sites of amino acid substitution despite the lack of observable PTM in the human protein family member. Taken together, these experiments demonstrate that the functional relevance of a PTM can be predicted very effectively by neural network models, revealing a large but testable

  20. Variances as order parameter and complexity measure for random Boolean networks

    International Nuclear Information System (INIS)

    Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel

    2005-01-01

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems

  1. Variances as order parameter and complexity measure for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)

    2005-02-04

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.

  2. Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain

    Czech Academy of Sciences Publication Activity Database

    Frolov, A.; Húsek, Dušan; Polyakov, P.Y.

    2016-01-01

    Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016

  3. Correlation Immunity, Avalanche Features, and Other Cryptographic Properties of Generalized Boolean Functions

    Science.gov (United States)

    2017-09-01

    satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized

  4. Proteome-wide Structural Analysis of PTM Hotspots Reveals Regulatory Elements Predicted to Impact Biological Function and Disease*

    Science.gov (United States)

    Dewhurst, Henry; Sundararaman, Niveda

    2016-01-01

    Post-translational modifications (PTMs) regulate protein behavior through modulation of protein-protein interactions, enzymatic activity, and protein stability essential in the translation of genotype to phenotype in eukaryotes. Currently, less than 4% of all eukaryotic PTMs are reported to have biological function - a statistic that continues to decrease with an increasing rate of PTM detection. Previously, we developed SAPH-ire (Structural Analysis of PTM Hotspots) - a method for the prioritization of PTM function potential that has been used effectively to reveal novel PTM regulatory elements in discrete protein families (Dewhurst et al., 2015). Here, we apply SAPH-ire to the set of eukaryotic protein families containing experimental PTM and 3D structure data - capturing 1,325 protein families with 50,839 unique PTM sites organized into 31,747 modified alignment positions (MAPs), of which 2010 (∼6%) possess known biological function. Here, we show that using an artificial neural network model (SAPH-ire NN) trained to identify MAP hotspots with biological function results in prediction outcomes that far surpass the use of single hotspot features, including nearest neighbor PTM clustering methods. We find the greatest enhancement in prediction for positions with PTM counts of five or less, which represent 98% of all MAPs in the eukaryotic proteome and 90% of all MAPs found to have biological function. Analysis of the top 1092 MAP hotspots revealed 267 of truly unknown function (containing 5443 distinct PTMs). Of these, 165 hotspots could be mapped to human KEGG pathways for normal and/or disease physiology. Many high-ranking hotspots were also found to be disease-associated pathogenic sites of amino acid substitution despite the lack of observable PTM in the human protein family member. Taken together, these experiments demonstrate that the functional relevance of a PTM can be predicted very effectively by neural network models, revealing a large but testable

  5. Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.

    Science.gov (United States)

    Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek

    2015-08-07

    The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.

  6. Mathematical Biology Modules Based on Modern Molecular Biology and Modern Discrete Mathematics

    Science.gov (United States)

    Davies, Robin; Hodge, Terrell; Enyedi, Alexander

    2010-01-01

    We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network. PMID:20810955

  7. Mathematical biology modules based on modern molecular biology and modern discrete mathematics.

    Science.gov (United States)

    Robeva, Raina; Davies, Robin; Hodge, Terrell; Enyedi, Alexander

    2010-01-01

    We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network.

  8. Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method

    International Nuclear Information System (INIS)

    EI-Shanshoury, A.I.

    2011-01-01

    This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied

  9. The Systems Biology Markup Language (SBML) Level 3 Package: Qualitative Models, Version 1, Release 1.

    Science.gov (United States)

    Chaouiya, Claudine; Keating, Sarah M; Berenguier, Duncan; Naldi, Aurélien; Thieffry, Denis; van Iersel, Martijn P; Le Novère, Nicolas; Helikar, Tomáš

    2015-09-04

    Quantitative methods for modelling biological networks require an in-depth knowledge of the biochemical reactions and their stoichiometric and kinetic parameters. In many practical cases, this knowledge is missing. This has led to the development of several qualitative modelling methods using information such as, for example, gene expression data coming from functional genomic experiments. The SBML Level 3 Version 1 Core specification does not provide a mechanism for explicitly encoding qualitative models, but it does provide a mechanism for SBML packages to extend the Core specification and add additional syntactical constructs. The SBML Qualitative Models package for SBML Level 3 adds features so that qualitative models can be directly and explicitly encoded. The approach taken in this package is essentially based on the definition of regulatory or influence graphs. The SBML Qualitative Models package defines the structure and syntax necessary to describe qualitative models that associate discrete levels of activities with entity pools and the transitions between states that describe the processes involved. This is particularly suited to logical models (Boolean or multi-valued) and some classes of Petri net models can be encoded with the approach.

  10. Stochastic model simulation using Kronecker product analysis and Zassenhaus formula approximation.

    Science.gov (United States)

    Caglar, Mehmet Umut; Pal, Ranadip

    2013-01-01

    Probabilistic Models are regularly applied in Genetic Regulatory Network modeling to capture the stochastic behavior observed in the generation of biological entities such as mRNA or proteins. Several approaches including Stochastic Master Equations and Probabilistic Boolean Networks have been proposed to model the stochastic behavior in genetic regulatory networks. It is generally accepted that Stochastic Master Equation is a fundamental model that can describe the system being investigated in fine detail, but the application of this model is computationally enormously expensive. On the other hand, Probabilistic Boolean Network captures only the coarse-scale stochastic properties of the system without modeling the detailed interactions. We propose a new approximation of the stochastic master equation model that is able to capture the finer details of the modeled system including bistabilities and oscillatory behavior, and yet has a significantly lower computational complexity. In this new method, we represent the system using tensors and derive an identity to exploit the sparse connectivity of regulatory targets for complexity reduction. The algorithm involves an approximation based on Zassenhaus formula to represent the exponential of a sum of matrices as product of matrices. We derive upper bounds on the expected error of the proposed model distribution as compared to the stochastic master equation model distribution. Simulation results of the application of the model to four different biological benchmark systems illustrate performance comparable to detailed stochastic master equation models but with considerably lower computational complexity. The results also demonstrate the reduced complexity of the new approach as compared to commonly used Stochastic Simulation Algorithm for equivalent accuracy.

  11. Phenotypic stability and plasticity in GMP-derived cells as determined by their underlying regulatory network.

    Science.gov (United States)

    Ramírez, Carlos; Mendoza, Luis

    2018-04-01

    Blood cell formation has been recognized as a suitable system to study celular differentiation mainly because of its experimental accessibility, and because it shows characteristics such as hierarchical and gradual bifurcated patterns of commitment, which are present in several developmental processes. Although hematopoiesis has been extensively studied and there is a wealth of molecular and cellular data about it, it is not clear how the underlying molecular regulatory networks define or restrict cellular differentiation processes. Here, we infer the molecular regulatory network that controls the differentiation of a blood cell subpopulation derived from the granulocyte-monocyte precursor (GMP), comprising monocytes, neutrophils, eosinophils, basophils and mast cells. We integrate published qualitative experimental data into a model to describe temporal expression patterns observed in GMP-derived cells. The model is implemented as a Boolean network, and its dynamical behavior is studied. Steady states of the network can be clearly identified with the expression profiles of monocytes, mast cells, neutrophils, basophils, and eosinophils, under wild-type and mutant backgrounds. All scripts are publicly available at https://github.com/caramirezal/RegulatoryNetworkGMPModel. lmendoza@biomedicas.unam.mx. Supplementary data are available at Bioinformatics online.

  12. Construction of a fuzzy and all Boolean logic gates based on DNA

    DEFF Research Database (Denmark)

    M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse

    2015-01-01

    to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....

  13. Regulatory activities; Actividades regulatorias

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2001-07-01

    This publication, compiled in 8 chapters, presents the regulatory system developed by the Nuclear Regulatory Authority (NRA) of the Argentine Republic. The following activities and developed topics in this document describe: the evolution of the nuclear regulatory activity in Argentina; the Argentine regulatory system; the nuclear regulatory laws and standards; the inspection and safeguards of nuclear facilities; the emergency systems; the environmental systems; the environmental monitoring; the analysis laboratories on physical and biological dosimetry, prenatal irradiation, internal irradiation, radiation measurements, detection techniques on nuclear testing, medical program on radiation protection; the institutional relations with national and international organization; the training courses and meeting; the technical information.

  14. Modeling bidirectional reflectance of forests and woodlands using Boolean models and geometric optics

    Science.gov (United States)

    Strahler, Alan H.; Jupp, David L. B.

    1990-01-01

    Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.

  15. Logical knowledge representation of regulatory relations in biomedical pathways

    DEFF Research Database (Denmark)

    Zambach, Sine; Hansen, Jens Ulrik

    2010-01-01

    Knowledge on regulatory relations, in for example regulatory pathways in biology, is used widely in experiment design by biomedical researchers and in systems biology. The knowledge has typically either been represented through simple graphs or through very expressive differential equation...... simulations of smaller parts of a pathway. In this work we suggest a knowledge representation of the most basic relations in regulatory processes regulates, positively regulates and negatively regulates in logics based on a semantic analysis. We discuss the usage of these relations in biology and in articial...... intelligence for hypothesis development in drug discovery....

  16. Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

    Science.gov (United States)

    Kupper, Z.; Hoffmann, H.

    A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.

  17. Antibody-drug conjugates for cancer therapy: The technological and regulatory challenges of developing drug-biologic hybrids.

    Science.gov (United States)

    Hamilton, Gregory S

    2015-09-01

    Antibody-drug conjugates (ADCs) are a new class of therapeutic agents that combine the targeting ability of monoclonal antibodies (mAbs) with small molecule drugs. The combination of a mAb targeting a cancer-specific antigen with a cytotoxin has tremendous promise as a new type of targeted cancer therapy. Two ADCs have been approved and many more are in clinical development, suggesting that this new class of drugs is coming to the forefront. Because of their unique nature as biologic-small drug hybrids, ADCs are challenging to develop, from both the scientific and regulatory perspectives. This review discusses both these aspects in current practice, and surveys the current state of the art of ADC drug development. Copyright © 2015 The International Alliance for Biological Standardization. Published by Elsevier Ltd. All rights reserved.

  18. Transcriptional regulatory programs underlying barley germination and regulatory functions of Gibberellin and abscisic acid

    Science.gov (United States)

    2011-01-01

    Background Seed germination is a complex multi-stage developmental process, and mainly accomplished through concerted activities of many gene products and biological pathways that are often subjected to strict developmental regulation. Gibberellins (GA) and abscisic acid (ABA) are two key phytohormones regulating seed germination and seedling growth. However, transcriptional regulatory networks underlying seed germination and its associated biological pathways are largely unknown. Results The studies examined transcriptomes of barley representing six distinct and well characterized germination stages and revealed that the transcriptional regulatory program underlying barley germination was composed of early, late, and post-germination phases. Each phase was accompanied with transcriptional up-regulation of distinct biological pathways. Cell wall synthesis and regulatory components including transcription factors, signaling and post-translational modification components were specifically and transiently up-regulated in early germination phase while histone families and many metabolic pathways were up-regulated in late germination phase. Photosynthesis and seed reserve mobilization pathways were up-regulated in post-germination phase. However, stress related pathways and seed storage proteins were suppressed through the entire course of germination. A set of genes were transiently up-regulated within three hours of imbibition, and might play roles in initiating biological pathways involved in seed germination. However, highly abundant transcripts in dry barley and Arabidopsis seeds were significantly conserved. Comparison with transcriptomes of barley aleurone in response to GA and ABA identified three sets of germination responsive genes that were regulated coordinately by GA, antagonistically by ABA, and coordinately by GA but antagonistically by ABA. Major CHO metabolism, cell wall degradation and protein degradation pathways were up-regulated by both GA and seed

  19. Transcriptional regulatory programs underlying barley germination and regulatory functions of Gibberellin and abscisic acid

    Directory of Open Access Journals (Sweden)

    Lin Li

    2011-06-01

    Full Text Available Abstract Background Seed germination is a complex multi-stage developmental process, and mainly accomplished through concerted activities of many gene products and biological pathways that are often subjected to strict developmental regulation. Gibberellins (GA and abscisic acid (ABA are two key phytohormones regulating seed germination and seedling growth. However, transcriptional regulatory networks underlying seed germination and its associated biological pathways are largely unknown. Results The studies examined transcriptomes of barley representing six distinct and well characterized germination stages and revealed that the transcriptional regulatory program underlying barley germination was composed of early, late, and post-germination phases. Each phase was accompanied with transcriptional up-regulation of distinct biological pathways. Cell wall synthesis and regulatory components including transcription factors, signaling and post-translational modification components were specifically and transiently up-regulated in early germination phase while histone families and many metabolic pathways were up-regulated in late germination phase. Photosynthesis and seed reserve mobilization pathways were up-regulated in post-germination phase. However, stress related pathways and seed storage proteins were suppressed through the entire course of germination. A set of genes were transiently up-regulated within three hours of imbibition, and might play roles in initiating biological pathways involved in seed germination. However, highly abundant transcripts in dry barley and Arabidopsis seeds were significantly conserved. Comparison with transcriptomes of barley aleurone in response to GA and ABA identified three sets of germination responsive genes that were regulated coordinately by GA, antagonistically by ABA, and coordinately by GA but antagonistically by ABA. Major CHO metabolism, cell wall degradation and protein degradation pathways were up

  20. Origin and Elimination of Two Global Spurious Attractors in Hopfield-Like Neural Network Performing Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

    2010-01-01

    Roč. 73, č. 7-9 (2010), s. 1394-1404 ISSN 0925-2312 R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining Subject RIV: IN - Informatics, Computer Science Impact factor: 1.429, year: 2010

  1. Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder

    Science.gov (United States)

    Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian

    2018-04-01

    Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.

  2. Low doses of ionizing radiation: Biological effects and regulatory control. Invited papers and discussions. Proceedings of an international conference

    International Nuclear Information System (INIS)

    1998-01-01

    The levels and biological effects resulting from exposure to ionizing radiation are continuously reviewed by the United Nations Committee on the Effects of Atomic Radiation (UNSCEAR). Since its creation in 1928, the International Commission on Radiological Protection (ICRP) has issued recommendations on protection against ionizing radiation. The UNSCEAR estimates and the ICRP recommendations have served as the basis for national and international safety standards on radiation safety, including those developed by the International Atomic Energy Agency (IAEA) and the World Health Organization (WHO). Concerning health effects of low doses of ionizing radiation, the international standards are based on the plausible assumption that, above the unavoidable background radiation dose, the probability of effects increases linearly with dose, i.e. on a 'linear, no threshold' (LNT) assumption. However, in recent years the biological estimates of health effects of low doses of ionizing radiation and the regulatory approach to the control of low level radiation exposure have been much debated. To foster information exchange on the relevant issues, an International Conference on Low Doses of Ionizing Radiation: Biological Effects and Regulatory Control, jointly sponsored by the IAEA and WHO in co-operation with UNSCEAR, was held from 17-21 November 1997 at Seville, Spain. These Proceedings contain the invited special reports, keynote papers, summaries of discussions, session summaries and addresses presented at the opening and closing of the Conference

  3. THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM

    Directory of Open Access Journals (Sweden)

    A. A. Butov

    2014-01-01

    Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.

  4. MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS.

    Science.gov (United States)

    Austin, Daniel; Dinwoodie, Ian H

    We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks.

  5. Identification and Characterization of 5′ Untranslated Regions (5′UTRs in Zymomonas mobilis as Regulatory Biological Parts

    Directory of Open Access Journals (Sweden)

    Seung Hee Cho

    2017-12-01

    Full Text Available Regulatory RNA regions within a transcript, particularly in the 5′ untranslated region (5′UTR, have been shown in a variety of organisms to control the expression levels of these mRNAs in response to various metabolites or environmental conditions. Considering the unique tolerance of Zymomonas mobilis to ethanol and the growing interest in engineering microbial strains with enhanced tolerance to industrial inhibitors, we searched natural cis-regulatory regions in this microorganism using transcriptomic data and bioinformatics analysis. Potential regulatory 5′UTRs were identified and filtered based on length, gene function, relative gene counts, and conservation in other organisms. An in vivo fluorescence-based screening system was developed to confirm the responsiveness of 36 5′UTR candidates to ethanol, acetate, and xylose stresses. UTR_ZMO0347 (5′UTR of gene ZMO0347 encoding the RNA binding protein Hfq was found to down-regulate downstream gene expression under ethanol stress. Genomic deletion of UTR_ZMO0347 led to a general decrease of hfq expression at the transcript level and increased sensitivity for observed changes in Hfq expression at the protein level. The role of UTR_ZMO0347 and other 5′UTRs gives us insight into the regulatory network of Z. mobilis in response to stress and unlocks new strategies for engineering robust industrial strains as well as for harvesting novel responsive regulatory biological parts for controllable gene expression platforms in this organism.

  6. Regulatory and biosafety issues in relation to transgenic animals in food and agriculture, feeds containing genetically modified organisms (GMO) and veterinary biologics

    International Nuclear Information System (INIS)

    Kochhar, H.P.S.; Gifford, G.A.; Kahn, S.

    2005-01-01

    Development of an effective regulatory system for genetically engineered animals and their products has been the subject of increasing discussion among researchers, industry and policy developers, as well as the public. Since transgenesis and cloning are relatively new scientific techniques, transgenic animals are new organisms for which there is limited information. The issues associated with the regulation and biosafety of transgenic animals pertain to environmental impact, human food safety, animal health and welfare, trade and ethics. To regulate this new and powerful technology predicated on limited background information is a challenge not only for the regulators, but also for the developers of such animals, who strive to prove that the animals are safe and merit bio-equivalency to their conventional counterparts. In principle, an effective regulatory sieve should permit safe products while forming a formidable barrier for those assessed of posing an unacceptable risk. Adoption of transgenic technology for use in agriculture will depend upon various factors that range from perceived benefits for humans and animals, to safe propagation, animal welfare considerations and integrity of species, as well as effects on bio-diversity. A regulatory framework designed to address the concerns connected with the environmental release of transgenic animals needs to also take into account the ability of genetically modified animals to survive and compete with conventional populations. Regulatory initiatives for biotechnology-derived animals and their products should ensure high standards for human and animal health; a sound scientific basis for evaluation; transparency and public involvement; and maintenance of genetic diversity. Feeds obtained by use of biotechnology have to be evaluated for animal and human safety by using parameters that define their molecular characterization, nutritional qualities and toxicological aspects, while veterinary biologics derived from

  7. Plasticity of the cis-regulatory input function of a gene.

    Directory of Open Access Journals (Sweden)

    Avraham E Mayo

    2006-04-01

    Full Text Available The transcription rate of a gene is often controlled by several regulators that bind specific sites in the gene's cis-regulatory region. The combined effect of these regulators is described by a cis-regulatory input function. What determines the form of an input function, and how variable is it with respect to mutations? To address this, we employ the well-characterized lac operon of Escherichia coli, which has an elaborate input function, intermediate between Boolean AND-gate and OR-gate logic. We mapped in detail the input function of 12 variants of the lac promoter, each with different point mutations in the regulator binding sites, by means of accurate expression measurements from living cells. We find that even a few mutations can significantly change the input function, resulting in functions that resemble Pure AND gates, OR gates, or single-input switches. Other types of gates were not found. The variant input functions can be described in a unified manner by a mathematical model. The model also lets us predict which functions cannot be reached by point mutations. The input function that we studied thus appears to be plastic, in the sense that many of the mutations do not ruin the regulation completely but rather result in new ways to integrate the inputs.

  8. The pseudo-Boolean optimization approach to form the N-version software structure

    Science.gov (United States)

    Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.

    2015-10-01

    The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.

  9. Regulatory inhibition of biological tissue mineralization by calcium phosphate through post-nucleation shielding by fetuin-A

    Energy Technology Data Exchange (ETDEWEB)

    Chang, Joshua C., E-mail: joshchang@ucla.edu [Clinical Center, National Institutes of Health, Bethesda, Maryland 20892, USA and Mathematical Biosciences Institute, The Ohio State University, Columbus, Ohio 43210 (United States); Miura, Robert M., E-mail: miura@njit.edu [Department of Mathematical Sciences, New Jersey Institute of Technology, Newark, New Jersey 07102 (United States)

    2016-04-21

    In vertebrates, insufficient availability of calcium and inorganic phosphate ions in extracellular fluids leads to loss of bone density and neuronal hyper-excitability. To counteract this problem, calcium ions are usually present at high concentrations throughout bodily fluids—at concentrations exceeding the saturation point. This condition leads to the opposite situation where unwanted mineral sedimentation may occur. Remarkably, ectopic or out-of-place sedimentation into soft tissues is rare, in spite of the thermodynamic driving factors. This fortunate fact is due to the presence of auto-regulatory proteins that are found in abundance in bodily fluids. Yet, many important inflammatory disorders such as atherosclerosis and osteoarthritis are associated with this undesired calcification. Hence, it is important to gain an understanding of the regulatory process and the conditions under which it can go awry. In this manuscript, we extend mean-field continuum classical nucleation theory of the growth of clusters to encompass surface shielding. We use this formulation to study the regulation of sedimentation of calcium phosphate salts in biological tissues through the mechanism of post-nuclear shielding of nascent mineral particles by binding proteins. We develop a mathematical description of this phenomenon using a countable system of hyperbolic partial differential equations. A critical concentration of regulatory protein is identified as a function of the physical parameters that describe the system.

  10. Generalized Boolean logic Driven Markov Processes: A powerful modeling framework for Model-Based Safety Analysis of dynamic repairable and reconfigurable systems

    International Nuclear Information System (INIS)

    Piriou, Pierre-Yves; Faure, Jean-Marc; Lesage, Jean-Jacques

    2017-01-01

    This paper presents a modeling framework that permits to describe in an integrated manner the structure of the critical system to analyze, by using an enriched fault tree, the dysfunctional behavior of its components, by means of Markov processes, and the reconfiguration strategies that have been planned to ensure safety and availability, with Moore machines. This framework has been developed from BDMP (Boolean logic Driven Markov Processes), a previous framework for dynamic repairable systems. First, the contribution is motivated by pinpointing the limitations of BDMP to model complex reconfiguration strategies and the failures of the control of these strategies. The syntax and semantics of GBDMP (Generalized Boolean logic Driven Markov Processes) are then formally defined; in particular, an algorithm to analyze the dynamic behavior of a GBDMP model is developed. The modeling capabilities of this framework are illustrated on three representative examples. Last, qualitative and quantitative analysis of GDBMP models highlight the benefits of the approach.

  11. Formal modeling and analysis of ER-α associated Biological Regulatory Network in breast cancer

    Directory of Open Access Journals (Sweden)

    Samra Khalid

    2016-10-01

    Full Text Available Background Breast cancer (BC is one of the leading cause of death among females worldwide. The increasing incidence of BC is due to various genetic and environmental changes which lead to the disruption of cellular signaling network(s. It is a complex disease in which several interlinking signaling cascades play a crucial role in establishing a complex regulatory network. The logical modeling approach of René Thomas has been applied to analyze the behavior of estrogen receptor-alpha (ER-α associated Biological Regulatory Network (BRN for a small part of complex events that leads to BC metastasis. Methods A discrete model was constructed using the kinetic logic formalism and its set of logical parameters were obtained using the model checking technique implemented in the SMBioNet software which is consistent with biological observations. The discrete model was further enriched with continuous dynamics by converting it into an equivalent Petri Net (PN to analyze the logical parameters of the involved entities. Results In-silico based discrete and continuous modeling of ER-α associated signaling network involved in BC provides information about behaviors and gene-gene interaction in detail. The dynamics of discrete model revealed, imperative behaviors represented as cyclic paths and trajectories leading to pathogenic states such as metastasis. Results suggest that the increased expressions of receptors ER-α, IGF-1R and EGFR slow down the activity of tumor suppressor genes (TSGs such as BRCA1, p53 and Mdm2 which can lead to metastasis. Therefore, IGF-1R and EGFR are considered as important inhibitory targets to control the metastasis in BC. Conclusion The in-silico approaches allow us to increase our understanding of the functional properties of living organisms. It opens new avenues of investigations of multiple inhibitory targets (ER-α, IGF-1R and EGFR for wet lab experiments as well as provided valuable insights in the treatment of cancers

  12. Mutational robustness of gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Aalt D J van Dijk

    Full Text Available Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor-target gene interactions but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive. In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence.

  13. Genetic Network Inference: From Co-Expression Clustering to Reverse Engineering

    Science.gov (United States)

    Dhaeseleer, Patrik; Liang, Shoudan; Somogyi, Roland

    2000-01-01

    Advances in molecular biological, analytical, and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using high-throughput gene expression assays, we are able to measure the output of the gene regulatory network. We aim here to review datamining and modeling approaches for conceptualizing and unraveling the functional relationships implicit in these datasets. Clustering of co-expression profiles allows us to infer shared regulatory inputs and functional pathways. We discuss various aspects of clustering, ranging from distance measures to clustering algorithms and multiple-duster memberships. More advanced analysis aims to infer causal connections between genes directly, i.e., who is regulating whom and how. We discuss several approaches to the problem of reverse engineering of genetic networks, from discrete Boolean networks, to continuous linear and non-linear models. We conclude that the combination of predictive modeling with systematic experimental verification will be required to gain a deeper insight into living organisms, therapeutic targeting, and bioengineering.

  14. A logic-based dynamic modeling approach to explicate the evolution of the central dogma of molecular biology.

    Science.gov (United States)

    Jafari, Mohieddin; Ansari-Pour, Naser; Azimzadeh, Sadegh; Mirzaie, Mehdi

    It is nearly half a century past the age of the introduction of the Central Dogma (CD) of molecular biology. This biological axiom has been developed and currently appears to be all the more complex. In this study, we modified CD by adding further species to the CD information flow and mathematically expressed CD within a dynamic framework by using Boolean network based on its present-day and 1965 editions. We show that the enhancement of the Dogma not only now entails a higher level of complexity, but it also shows a higher level of robustness, thus far more consistent with the nature of biological systems. Using this mathematical modeling approach, we put forward a logic-based expression of our conceptual view of molecular biology. Finally, we show that such biological concepts can be converted into dynamic mathematical models using a logic-based approach and thus may be useful as a framework for improving static conceptual models in biology.

  15. A logic-based dynamic modeling approach to explicate the evolution of the central dogma of molecular biology.

    Directory of Open Access Journals (Sweden)

    Mohieddin Jafari

    Full Text Available It is nearly half a century past the age of the introduction of the Central Dogma (CD of molecular biology. This biological axiom has been developed and currently appears to be all the more complex. In this study, we modified CD by adding further species to the CD information flow and mathematically expressed CD within a dynamic framework by using Boolean network based on its present-day and 1965 editions. We show that the enhancement of the Dogma not only now entails a higher level of complexity, but it also shows a higher level of robustness, thus far more consistent with the nature of biological systems. Using this mathematical modeling approach, we put forward a logic-based expression of our conceptual view of molecular biology. Finally, we show that such biological concepts can be converted into dynamic mathematical models using a logic-based approach and thus may be useful as a framework for improving static conceptual models in biology.

  16. A systems biology approach to construct the gene regulatory network of systemic inflammation via microarray and databases mining

    Directory of Open Access Journals (Sweden)

    Lan Chung-Yu

    2008-09-01

    Full Text Available Abstract Background Inflammation is a hallmark of many human diseases. Elucidating the mechanisms underlying systemic inflammation has long been an important topic in basic and clinical research. When primary pathogenetic events remains unclear due to its immense complexity, construction and analysis of the gene regulatory network of inflammation at times becomes the best way to understand the detrimental effects of disease. However, it is difficult to recognize and evaluate relevant biological processes from the huge quantities of experimental data. It is hence appealing to find an algorithm which can generate a gene regulatory network of systemic inflammation from high-throughput genomic studies of human diseases. Such network will be essential for us to extract valuable information from the complex and chaotic network under diseased conditions. Results In this study, we construct a gene regulatory network of inflammation using data extracted from the Ensembl and JASPAR databases. We also integrate and apply a number of systematic algorithms like cross correlation threshold, maximum likelihood estimation method and Akaike Information Criterion (AIC on time-lapsed microarray data to refine the genome-wide transcriptional regulatory network in response to bacterial endotoxins in the context of dynamic activated genes, which are regulated by transcription factors (TFs such as NF-κB. This systematic approach is used to investigate the stochastic interaction represented by the dynamic leukocyte gene expression profiles of human subject exposed to an inflammatory stimulus (bacterial endotoxin. Based on the kinetic parameters of the dynamic gene regulatory network, we identify important properties (such as susceptibility to infection of the immune system, which may be useful for translational research. Finally, robustness of the inflammatory gene network is also inferred by analyzing the hubs and "weak ties" structures of the gene network

  17. Regulatory Anatomy

    DEFF Research Database (Denmark)

    Hoeyer, Klaus

    2015-01-01

    This article proposes the term “safety logics” to understand attempts within the European Union (EU) to harmonize member state legislation to ensure a safe and stable supply of human biological material for transplants and transfusions. With safety logics, I refer to assemblages of discourses, le...... they arise. In short, I expose the regulatory anatomy of the policy landscape....

  18. Mammalian synthetic biology for studying the cell.

    Science.gov (United States)

    Mathur, Melina; Xiang, Joy S; Smolke, Christina D

    2017-01-02

    Synthetic biology is advancing the design of genetic devices that enable the study of cellular and molecular biology in mammalian cells. These genetic devices use diverse regulatory mechanisms to both examine cellular processes and achieve precise and dynamic control of cellular phenotype. Synthetic biology tools provide novel functionality to complement the examination of natural cell systems, including engineered molecules with specific activities and model systems that mimic complex regulatory processes. Continued development of quantitative standards and computational tools will expand capacities to probe cellular mechanisms with genetic devices to achieve a more comprehensive understanding of the cell. In this study, we review synthetic biology tools that are being applied to effectively investigate diverse cellular processes, regulatory networks, and multicellular interactions. We also discuss current challenges and future developments in the field that may transform the types of investigation possible in cell biology. © 2017 Mathur et al.

  19. Singular Perturbation Analysis and Gene Regulatory Networks with Delay

    Science.gov (United States)

    Shlykova, Irina; Ponosov, Arcady

    2009-09-01

    There are different ways of how to model gene regulatory networks. Differential equations allow for a detailed description of the network's dynamics and provide an explicit model of the gene concentration changes over time. Production and relative degradation rate functions used in such models depend on the vector of steeply sloped threshold functions which characterize the activity of genes. The most popular example of the threshold functions comes from the Boolean network approach, where the threshold functions are given by step functions. The system of differential equations becomes then piecewise linear. The dynamics of this system can be described very easily between the thresholds, but not in the switching domains. For instance this approach fails to analyze stationary points of the system and to define continuous solutions in the switching domains. These problems were studied in [2], [3], but the proposed model did not take into account a time delay in cellular systems. However, analysis of real gene expression data shows a considerable number of time-delayed interactions suggesting that time delay is essential in gene regulation. Therefore, delays may have a great effect on the dynamics of the system presenting one of the critical factors that should be considered in reconstruction of gene regulatory networks. The goal of this work is to apply the singular perturbation analysis to certain systems with delay and to obtain an analog of Tikhonov's theorem, which provides sufficient conditions for constracting the limit system in the delay case.

  20. Prediction of regulatory elements

    DEFF Research Database (Denmark)

    Sandelin, Albin

    2008-01-01

    Finding the regulatory mechanisms responsible for gene expression remains one of the most important challenges for biomedical research. A major focus in cellular biology is to find functional transcription factor binding sites (TFBS) responsible for the regulation of a downstream gene. As wet......-lab methods are time consuming and expensive, it is not realistic to identify TFBS for all uncharacterized genes in the genome by purely experimental means. Computational methods aimed at predicting potential regulatory regions can increase the efficiency of wet-lab experiments significantly. Here, methods...

  1. TIGER: Toolbox for integrating genome-scale metabolic models, expression data, and transcriptional regulatory networks

    Directory of Open Access Journals (Sweden)

    Jensen Paul A

    2011-09-01

    Full Text Available Abstract Background Several methods have been developed for analyzing genome-scale models of metabolism and transcriptional regulation. Many of these methods, such as Flux Balance Analysis, use constrained optimization to predict relationships between metabolic flux and the genes that encode and regulate enzyme activity. Recently, mixed integer programming has been used to encode these gene-protein-reaction (GPR relationships into a single optimization problem, but these techniques are often of limited generality and lack a tool for automating the conversion of rules to a coupled regulatory/metabolic model. Results We present TIGER, a Toolbox for Integrating Genome-scale Metabolism, Expression, and Regulation. TIGER converts a series of generalized, Boolean or multilevel rules into a set of mixed integer inequalities. The package also includes implementations of existing algorithms to integrate high-throughput expression data with genome-scale models of metabolism and transcriptional regulation. We demonstrate how TIGER automates the coupling of a genome-scale metabolic model with GPR logic and models of transcriptional regulation, thereby serving as a platform for algorithm development and large-scale metabolic analysis. Additionally, we demonstrate how TIGER's algorithms can be used to identify inconsistencies and improve existing models of transcriptional regulation with examples from the reconstructed transcriptional regulatory network of Saccharomyces cerevisiae. Conclusion The TIGER package provides a consistent platform for algorithm development and extending existing genome-scale metabolic models with regulatory networks and high-throughput data.

  2. What's the Regulatory Value of a Target Product Profile?

    Science.gov (United States)

    Breder, Christopher D; Du, Wenny; Tyndall, Adria

    2017-07-01

    Target product profiles (TPPs) are used as a regulatory tool for dialog on clinical development or manufacturing plans. Drugs and biologics approved by the FDA that mention TPPs are associated with more efficient regulatory review times, perhaps as a result of increased planning or because the TPP promotes well-organized regulatory dialog. Published by Elsevier Ltd.

  3. Toward synthesizing executable models in biology.

    Science.gov (United States)

    Fisher, Jasmin; Piterman, Nir; Bodik, Rastislav

    2014-01-01

    Over the last decade, executable models of biological behaviors have repeatedly provided new scientific discoveries, uncovered novel insights, and directed new experimental avenues. These models are computer programs whose execution mechanistically simulates aspects of the cell's behaviors. If the observed behavior of the program agrees with the observed biological behavior, then the program explains the phenomena. This approach has proven beneficial for gaining new biological insights and directing new experimental avenues. One advantage of this approach is that techniques for analysis of computer programs can be applied to the analysis of executable models. For example, one can confirm that a model agrees with experiments for all possible executions of the model (corresponding to all environmental conditions), even if there are a huge number of executions. Various formal methods have been adapted for this context, for example, model checking or symbolic analysis of state spaces. To avoid manual construction of executable models, one can apply synthesis, a method to produce programs automatically from high-level specifications. In the context of biological modeling, synthesis would correspond to extracting executable models from experimental data. We survey recent results about the usage of the techniques underlying synthesis of computer programs for the inference of biological models from experimental data. We describe synthesis of biological models from curated mutation experiment data, inferring network connectivity models from phosphoproteomic data, and synthesis of Boolean networks from gene expression data. While much work has been done on automated analysis of similar datasets using machine learning and artificial intelligence, using synthesis techniques provides new opportunities such as efficient computation of disambiguating experiments, as well as the ability to produce different kinds of models automatically from biological data.

  4. Dynamics of random Boolean networks under fully asynchronous stochastic update based on linear representation.

    Directory of Open Access Journals (Sweden)

    Chao Luo

    Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.

  5. Quantum tests for the linearity and permutation invariance of Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

    Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)

    2011-12-15

    The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.

  6. A quantum speedup in machine learning: finding an N-bit Boolean function for a classification

    International Nuclear Information System (INIS)

    Yoo, Seokwon; Lee, Jinhyoung; Bang, Jeongho; Lee, Changhyoup

    2014-01-01

    We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)

  7. Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.

    Science.gov (United States)

    Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu

    2009-07-01

    The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.

  8. Using synthetic biology to distinguish and overcome regulatory and functional barriers related to nitrogen fixation.

    Directory of Open Access Journals (Sweden)

    Xia Wang

    Full Text Available Biological nitrogen fixation is a complex process requiring multiple genes working in concert. To date, the Klebsiella pneumoniae nif gene cluster, divided into seven operons, is one of the most studied systems. Its nitrogen fixation capacity is subject to complex cascade regulation and physiological limitations. In this report, the entire K. pneumoniae nif gene cluster was reassembled as operon-based BioBrick parts in Escherichia coli. It provided ~100% activity of native K. pneumoniae system. Based on the expression levels of these BioBrick parts, a T7 RNA polymerase-LacI expression system was used to replace the σ(54-dependent promoters located upstream of nif operons. Expression patterns of nif operons were critical for the maximum activity of the recombinant system. By mimicking these expression levels with variable-strength T7-dependent promoters, ~42% of the nitrogenase activity of the σ(54-dependent nif system was achieved in E. coli. When the newly constructed T7-dependent nif system was challenged with different genetic and physiological conditions, it bypassed the original complex regulatory circuits, with minor physiological limitations. Therefore, we have successfully replaced the nif regulatory elements with a simple expression system that may provide the first step for further research of introducing nif genes into eukaryotic organelles, which has considerable potentials in agro-biotechnology.

  9. US Competitiveness in Synthetic Biology.

    Science.gov (United States)

    Gronvall, Gigi Kwik

    2015-01-01

    Synthetic biology is an emerging technical field that aims to make biology easier to engineer; the field has applications in strategically important sectors for the US economy. While the United States currently leads in synthetic biology R&D, other nations are heavily investing in order to boost their economies, which will inevitably diminish the US leadership position. This outcome is not entirely negative--additional investments will expand markets--but it is critical that the US government take steps to remain competitive: There are applications from which the US population and economy may benefit; there are specific applications with importance for national defense; and US technical leadership will ensure that US experts have a leading role in synthetic biology governance, regulation, and oversight. Measures to increase competitiveness in S&T generally are broadly applicable for synthetic biology and should be pursued. However, the US government will also need to take action on fundamental issues that will affect the field's development, such as countering anti-GMO (genetically modified organism) sentiments and anti-GMO legislation. The United States should maintain its regulatory approach so that it is the product that is regulated, not the method used to create a product. At the same time, the United States needs to ensure that the regulatory framework is updated so that synthetic biology products do not fall into regulatory gaps. Finally, the United States needs to pay close attention to how synthetic biology applications may be governed internationally, such as through the Nagoya Protocol of the Convention on Biological Diversity, so that beneficial applications may be realized.

  10. Robustness in Regulatory Interaction Networks. A Generic Approach with Applications at Different Levels: Physiologic, Metabolic and Genetic

    Science.gov (United States)

    Demongeot, Jacques; Ben Amor, Hedi; Elena, Adrien; Gillois, Pierre; Noual, Mathilde; Sené, Sylvain

    2009-01-01

    Regulatory interaction networks are often studied on their dynamical side (existence of attractors, study of their stability). We focus here also on their robustness, that is their ability to offer the same spatiotemporal patterns and to resist to external perturbations such as losses of nodes or edges in the networks interactions architecture, changes in their environmental boundary conditions as well as changes in the update schedule (or updating mode) of the states of their elements (e.g., if these elements are genes, their synchronous coexpression mode versus their sequential expression). We define the generic notions of boundary, core, and critical vertex or edge of the underlying interaction graph of the regulatory network, whose disappearance causes dramatic changes in the number and nature of attractors (e.g., passage from a bistable behaviour to a unique periodic regime) or in the range of their basins of stability. The dynamic transition of states will be presented in the framework of threshold Boolean automata rules. A panorama of applications at different levels will be given: brain and plant morphogenesis, bulbar cardio-respiratory regulation, glycolytic/oxidative metabolic coupling, and eventually cell cycle and feather morphogenesis genetic control. PMID:20057955

  11. Robustness in Regulatory Interaction Networks. A Generic Approach with Applications at Different Levels: Physiologic, Metabolic and Genetic

    Directory of Open Access Journals (Sweden)

    Sylvain Sené

    2009-10-01

    Full Text Available Regulatory interaction networks are often studied on their dynamical side (existence of attractors, study of their stability. We focus here also on their robustness, that is their ability to offer the same spatiotemporal patterns and to resist to external perturbations such as losses of nodes or edges in the networks interactions architecture, changes in their environmental boundary conditions as well as changes in the update schedule (or updating mode of the states of their elements (e.g., if these elements are genes, their synchronous coexpression mode versus their sequential expression. We define the generic notions of boundary, core, and critical vertex or edge of the underlying interaction graph of the regulatory network, whose disappearance causes dramatic changes in the number and nature of attractors (e.g., passage from a bistable behaviour to a unique periodic regime or in the range of their basins of stability. The dynamic transition of states will be presented in the framework of threshold Boolean automata rules. A panorama of applications at different levels will be given: brain and plant morphogenesis, bulbar cardio-respiratory regulation, glycolytic/oxidative metabolic coupling, and eventually cell cycle and feather morphogenesis genetic control.

  12. Radiation and the regulatory landscape of neo2-Darwinism

    International Nuclear Information System (INIS)

    Rollo, C. David

    2006-01-01

    Several recently revealed features of eukaryotic genomes were not predicted by earlier evolutionary paradigms, including the relatively small number of genes, the very large amounts of non-functional code and its quarantine in heterochromatin, the remarkable conservation of many functionally important genes across relatively enormous phylogenetic distances, and the prevalence of extra-genomic information associated with chromatin structure and histone proteins. All of these emphasize a paramount role for regulatory evolution, which is further reinforced by recent perspectives highlighting even higher-order regulation governing epigenetics and development (EVO-DEVO). Modern neo 2 -Darwinism, with its emphasis on regulatory mechanisms and regulatory evolution provides new vision for understanding radiation biology, particularly because free radicals and redox states are central to many regulatory mechanisms and free radicals generated by radiation mimic and amplify endogenous signalling. This paper explores some of these aspects and their implications for low-dose radiation biology

  13. Radiation and the regulatory landscape of neo2-Darwinism.

    Science.gov (United States)

    Rollo, C David

    2006-05-11

    Several recently revealed features of eukaryotic genomes were not predicted by earlier evolutionary paradigms, including the relatively small number of genes, the very large amounts of non-functional code and its quarantine in heterochromatin, the remarkable conservation of many functionally important genes across relatively enormous phylogenetic distances, and the prevalence of extra-genomic information associated with chromatin structure and histone proteins. All of these emphasize a paramount role for regulatory evolution, which is further reinforced by recent perspectives highlighting even higher-order regulation governing epigenetics and development (EVO-DEVO). Modern neo2-Darwinism, with its emphasis on regulatory mechanisms and regulatory evolution provides new vision for understanding radiation biology, particularly because free radicals and redox states are central to many regulatory mechanisms and free radicals generated by radiation mimic and amplify endogenous signalling. This paper explores some of these aspects and their implications for low-dose radiation biology.

  14. Synthetic biological networks

    International Nuclear Information System (INIS)

    Archer, Eric; Süel, Gürol M

    2013-01-01

    Despite their obvious relationship and overlap, the field of physics is blessed with many insightful laws, while such laws are sadly absent in biology. Here we aim to discuss how the rise of a more recent field known as synthetic biology may allow us to more directly test hypotheses regarding the possible design principles of natural biological networks and systems. In particular, this review focuses on synthetic gene regulatory networks engineered to perform specific functions or exhibit particular dynamic behaviors. Advances in synthetic biology may set the stage to uncover the relationship of potential biological principles to those developed in physics. (review article)

  15. Towards Synthesizing Executable Models in Biology

    Directory of Open Access Journals (Sweden)

    Jasmin eFisher

    2014-12-01

    Full Text Available Over the last decade, executable models of biological behaviors have repeatedly provided new scientific discoveries, uncovered novel insights, and directed new experimental avenues. These models are computer programs whose execution mechanistically simulates aspects of the cell’s behaviors. If the observed behavior of the program agrees with the observed biological behavior, then the program explains the phenomena. This approach has proven beneficial for gaining new biological insights and directing new experimental avenues. One advantage of this approach is that techniques for analysis of computer programs can be applied to the analysis of executable models. For example, one can confirm that a model agrees with experiments for all possible executions of the model (corresponding to all environmental conditions, even if there are a huge number of executions. Various formal methods have been adapted for this context, for example, model checking or symbolic analysis of state spaces. To avoid manual construction of executable models, one can apply synthesis, a method to produce programs automatically from high-level specifications. In the context of biological modelling, synthesis would correspond to extracting executable models from experimental data. We survey recent results about the usage of the techniques underlying synthesis of computer programs for the inference of biological models from experimental data. We describe synthesis of biological models from curated mutation experiment data, inferring network connectivity models from phosphoproteomic data, and synthesis of Boolean networks from gene expression data. While much work has been done on automated analysis of similar datasets using machine learning and artificial intelligence, using synthesis techniques provides new opportunities such as efficient computation of disambiguating experiments, as well as the ability to produce different kinds of models automatically from biological data.

  16. Computational challenges in modeling gene regulatory events.

    Science.gov (United States)

    Pataskar, Abhijeet; Tiwari, Vijay K

    2016-10-19

    Cellular transcriptional programs driven by genetic and epigenetic mechanisms could be better understood by integrating "omics" data and subsequently modeling the gene-regulatory events. Toward this end, computational biology should keep pace with evolving experimental procedures and data availability. This article gives an exemplified account of the current computational challenges in molecular biology.

  17. Sieve-based relation extraction of gene regulatory networks from biological literature.

    Science.gov (United States)

    Žitnik, Slavko; Žitnik, Marinka; Zupan, Blaž; Bajec, Marko

    2015-01-01

    Relation extraction is an essential procedure in literature mining. It focuses on extracting semantic relations between parts of text, called mentions. Biomedical literature includes an enormous amount of textual descriptions of biological entities, their interactions and results of related experiments. To extract them in an explicit, computer readable format, these relations were at first extracted manually from databases. Manual curation was later replaced with automatic or semi-automatic tools with natural language processing capabilities. The current challenge is the development of information extraction procedures that can directly infer more complex relational structures, such as gene regulatory networks. We develop a computational approach for extraction of gene regulatory networks from textual data. Our method is designed as a sieve-based system and uses linear-chain conditional random fields and rules for relation extraction. With this method we successfully extracted the sporulation gene regulation network in the bacterium Bacillus subtilis for the information extraction challenge at the BioNLP 2013 conference. To enable extraction of distant relations using first-order models, we transform the data into skip-mention sequences. We infer multiple models, each of which is able to extract different relationship types. Following the shared task, we conducted additional analysis using different system settings that resulted in reducing the reconstruction error of bacterial sporulation network from 0.73 to 0.68, measured as the slot error rate between the predicted and the reference network. We observe that all relation extraction sieves contribute to the predictive performance of the proposed approach. Also, features constructed by considering mention words and their prefixes and suffixes are the most important features for higher accuracy of extraction. Analysis of distances between different mention types in the text shows that our choice of transforming

  18. Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation

    Science.gov (United States)

    Pinilla, Samuel; Poveda, Juan; Arguello, Henry

    2018-03-01

    Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.

  19. Automated Identification of Core Regulatory Genes in Human Gene Regulatory Networks.

    Directory of Open Access Journals (Sweden)

    Vipin Narang

    Full Text Available Human gene regulatory networks (GRN can be difficult to interpret due to a tangle of edges interconnecting thousands of genes. We constructed a general human GRN from extensive transcription factor and microRNA target data obtained from public databases. In a subnetwork of this GRN that is active during estrogen stimulation of MCF-7 breast cancer cells, we benchmarked automated algorithms for identifying core regulatory genes (transcription factors and microRNAs. Among these algorithms, we identified K-core decomposition, pagerank and betweenness centrality algorithms as the most effective for discovering core regulatory genes in the network evaluated based on previously known roles of these genes in MCF-7 biology as well as in their ability to explain the up or down expression status of up to 70% of the remaining genes. Finally, we validated the use of K-core algorithm for organizing the GRN in an easier to interpret layered hierarchy where more influential regulatory genes percolate towards the inner layers. The integrated human gene and miRNA network and software used in this study are provided as supplementary materials (S1 Data accompanying this manuscript.

  20. The Reconstruction and Analysis of Gene Regulatory Networks.

    Science.gov (United States)

    Zheng, Guangyong; Huang, Tao

    2018-01-01

    In post-genomic era, an important task is to explore the function of individual biological molecules (i.e., gene, noncoding RNA, protein, metabolite) and their organization in living cells. For this end, gene regulatory networks (GRNs) are constructed to show relationship between biological molecules, in which the vertices of network denote biological molecules and the edges of network present connection between nodes (Strogatz, Nature 410:268-276, 2001; Bray, Science 301:1864-1865, 2003). Biologists can understand not only the function of biological molecules but also the organization of components of living cells through interpreting the GRNs, since a gene regulatory network is a comprehensively physiological map of living cells and reflects influence of genetic and epigenetic factors (Strogatz, Nature 410:268-276, 2001; Bray, Science 301:1864-1865, 2003). In this paper, we will review the inference methods of GRN reconstruction and analysis approaches of network structure. As a powerful tool for studying complex diseases and biological processes, the applications of the network method in pathway analysis and disease gene identification will be introduced.

  1. Emotion: The Self-regulatory Sense.

    Science.gov (United States)

    Peil, Katherine T

    2014-03-01

    While emotion is a central component of human health and well-being, traditional approaches to understanding its biological function have been wanting. A dynamic systems model, however, broadly redefines and recasts emotion as a primary sensory system-perhaps the first sensory system to have emerged, serving the ancient autopoietic function of "self-regulation." Drawing upon molecular biology and revelations from the field of epigenetics, the model suggests that human emotional perceptions provide an ongoing stream of "self-relevant" sensory information concerning optimally adaptive states between the organism and its immediate environment, along with coupled behavioral corrections that honor a universal self-regulatory logic, one still encoded within cellular signaling and immune functions. Exemplified by the fundamental molecular circuitry of sensorimotor control in the E coli bacterium, the model suggests that the hedonic (affective) categories emerge directly from positive and negative feedback processes, their good/bad binary appraisals relating to dual self-regulatory behavioral regimes-evolutionary purposes, through which organisms actively participate in natural selection, and through which humans can interpret optimal or deficit states of balanced being and becoming. The self-regulatory sensory paradigm transcends anthropomorphism, unites divergent theoretical perspectives and isolated bodies of literature, while challenging time-honored assumptions. While suppressive regulatory strategies abound, it suggests that emotions are better understood as regulating us, providing a service crucial to all semantic language, learning systems, evaluative decision-making, and fundamental to optimal physical, mental, and social health.

  2. Emotion: The Self-regulatory Sense

    Science.gov (United States)

    2014-01-01

    While emotion is a central component of human health and well-being, traditional approaches to understanding its biological function have been wanting. A dynamic systems model, however, broadly redefines and recasts emotion as a primary sensory system—perhaps the first sensory system to have emerged, serving the ancient autopoietic function of “self-regulation.” Drawing upon molecular biology and revelations from the field of epigenetics, the model suggests that human emotional perceptions provide an ongoing stream of “self-relevant” sensory information concerning optimally adaptive states between the organism and its immediate environment, along with coupled behavioral corrections that honor a universal self-regulatory logic, one still encoded within cellular signaling and immune functions. Exemplified by the fundamental molecular circuitry of sensorimotor control in the E coli bacterium, the model suggests that the hedonic (affective) categories emerge directly from positive and negative feedback processes, their good/bad binary appraisals relating to dual self-regulatory behavioral regimes—evolutionary purposes, through which organisms actively participate in natural selection, and through which humans can interpret optimal or deficit states of balanced being and becoming. The self-regulatory sensory paradigm transcends anthropomorphism, unites divergent theoretical perspectives and isolated bodies of literature, while challenging time-honored assumptions. While suppressive regulatory strategies abound, it suggests that emotions are better understood as regulating us, providing a service crucial to all semantic language, learning systems, evaluative decision-making, and fundamental to optimal physical, mental, and social health. PMID:24808986

  3. Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

    Science.gov (United States)

    Andrade, Jefferson O.; Kameyama, Yukiyoshi

    Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.

  4. In silico discovery of transcription regulatory elements in Plasmodium falciparum

    Directory of Open Access Journals (Sweden)

    Le Roch Karine G

    2008-02-01

    Full Text Available Abstract Background With the sequence of the Plasmodium falciparum genome and several global mRNA and protein life cycle expression profiling projects now completed, elucidating the underlying networks of transcriptional control important for the progression of the parasite life cycle is highly pertinent to the development of new anti-malarials. To date, relatively little is known regarding the specific mechanisms the parasite employs to regulate gene expression at the mRNA level, with studies of the P. falciparum genome sequence having revealed few cis-regulatory elements and associated transcription factors. Although it is possible the parasite may evoke mechanisms of transcriptional control drastically different from those used by other eukaryotic organisms, the extreme AT-rich nature of P. falciparum intergenic regions (~90% AT presents significant challenges to in silico cis-regulatory element discovery. Results We have developed an algorithm called Gene Enrichment Motif Searching (GEMS that uses a hypergeometric-based scoring function and a position-weight matrix optimization routine to identify with high-confidence regulatory elements in the nucleotide-biased and repeat sequence-rich P. falciparum genome. When applied to promoter regions of genes contained within 21 co-expression gene clusters generated from P. falciparum life cycle microarray data using the semi-supervised clustering algorithm Ontology-based Pattern Identification, GEMS identified 34 putative cis-regulatory elements associated with a variety of parasite processes including sexual development, cell invasion, antigenic variation and protein biosynthesis. Among these candidates were novel motifs, as well as many of the elements for which biological experimental evidence already exists in the Plasmodium literature. To provide evidence for the biological relevance of a cell invasion-related element predicted by GEMS, reporter gene and electrophoretic mobility shift assays

  5. Radiation and the regulatory landscape of neo{sup 2}-Darwinism

    Energy Technology Data Exchange (ETDEWEB)

    Rollo, C. David [Department of Biology, Life Sciences Building, 1280 Main St. West, Hamilton, Ont., Canada L8S 4K1 (Canada)]. E-mail: rollocd@mcmaster.ca

    2006-05-11

    Several recently revealed features of eukaryotic genomes were not predicted by earlier evolutionary paradigms, including the relatively small number of genes, the very large amounts of non-functional code and its quarantine in heterochromatin, the remarkable conservation of many functionally important genes across relatively enormous phylogenetic distances, and the prevalence of extra-genomic information associated with chromatin structure and histone proteins. All of these emphasize a paramount role for regulatory evolution, which is further reinforced by recent perspectives highlighting even higher-order regulation governing epigenetics and development (EVO-DEVO). Modern neo{sup 2}-Darwinism, with its emphasis on regulatory mechanisms and regulatory evolution provides new vision for understanding radiation biology, particularly because free radicals and redox states are central to many regulatory mechanisms and free radicals generated by radiation mimic and amplify endogenous signalling. This paper explores some of these aspects and their implications for low-dose radiation biology.

  6. Applying differential dynamic logic to reconfigurable biological networks.

    Science.gov (United States)

    Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

    2017-09-01

    Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

  7. BiologicalNetworks 2.0 - an integrative view of genome biology data

    Directory of Open Access Journals (Sweden)

    Ponomarenko Julia

    2010-12-01

    Full Text Available Abstract Background A significant problem in the study of mechanisms of an organism's development is the elucidation of interrelated factors which are making an impact on the different levels of the organism, such as genes, biological molecules, cells, and cell systems. Numerous sources of heterogeneous data which exist for these subsystems are still not integrated sufficiently enough to give researchers a straightforward opportunity to analyze them together in the same frame of study. Systematic application of data integration methods is also hampered by a multitude of such factors as the orthogonal nature of the integrated data and naming problems. Results Here we report on a new version of BiologicalNetworks, a research environment for the integral visualization and analysis of heterogeneous biological data. BiologicalNetworks can be queried for properties of thousands of different types of biological entities (genes/proteins, promoters, COGs, pathways, binding sites, and other and their relations (interactions, co-expression, co-citations, and other. The system includes the build-pathways infrastructure for molecular interactions/relations and module discovery in high-throughput experiments. Also implemented in BiologicalNetworks are the Integrated Genome Viewer and Comparative Genomics Browser applications, which allow for the search and analysis of gene regulatory regions and their conservation in multiple species in conjunction with molecular pathways/networks, experimental data and functional annotations. Conclusions The new release of BiologicalNetworks together with its back-end database introduces extensive functionality for a more efficient integrated multi-level analysis of microarray, sequence, regulatory, and other data. BiologicalNetworks is freely available at http://www.biologicalnetworks.org.

  8. A systems biology approach identified different regulatory networks targeted by KSHV miR-K12-11 in B cells and endothelial cells.

    Science.gov (United States)

    Yang, Yajie; Boss, Isaac W; McIntyre, Lauren M; Renne, Rolf

    2014-08-08

    Kaposi's sarcoma associated herpes virus (KSHV) is associated with tumors of endothelial and lymphoid origin. During latent infection, KSHV expresses miR-K12-11, an ortholog of the human tumor gene hsa-miR-155. Both gene products are microRNAs (miRNAs), which are important post-transcriptional regulators that contribute to tissue specific gene expression. Advances in target identification technologies and molecular interaction databases have allowed a systems biology approach to unravel the gene regulatory networks (GRNs) triggered by miR-K12-11 in endothelial and lymphoid cells. Understanding the tissue specific function of miR-K12-11 will help to elucidate underlying mechanisms of KSHV pathogenesis. Ectopic expression of miR-K12-11 differentially affected gene expression in BJAB cells of lymphoid origin and TIVE cells of endothelial origin. Direct miRNA targeting accounted for a small fraction of the observed transcriptome changes: only 29 genes were identified as putative direct targets of miR-K12-11 in both cell types. However, a number of commonly affected biological pathways, such as carbohydrate metabolism and interferon response related signaling, were revealed by gene ontology analysis. Integration of transcriptome profiling, bioinformatic algorithms, and databases of protein-protein interactome from the ENCODE project identified different nodes of GRNs utilized by miR-K12-11 in a tissue-specific fashion. These effector genes, including cancer associated transcription factors and signaling proteins, amplified the regulatory potential of a single miRNA, from a small set of putative direct targets to a larger set of genes. This is the first comparative analysis of miRNA-K12-11's effects in endothelial and B cells, from tissues infected with KSHV in vivo. MiR-K12-11 was able to broadly modulate gene expression in both cell types. Using a systems biology approach, we inferred that miR-K12-11 establishes its GRN by both repressing master TFs and influencing

  9. Design of a Nanoscale, CMOS-Integrable, Thermal-Guiding Structure for Boolean-Logic and Neuromorphic Computation.

    Science.gov (United States)

    Loke, Desmond; Skelton, Jonathan M; Chong, Tow-Chong; Elliott, Stephen R

    2016-12-21

    One of the requirements for achieving faster CMOS electronics is to mitigate the unacceptably large chip areas required to steer heat away from or, more recently, toward the critical nodes of state-of-the-art devices. Thermal-guiding (TG) structures can efficiently direct heat by "meta-materials" engineering; however, some key aspects of the behavior of these systems are not fully understood. Here, we demonstrate control of the thermal-diffusion properties of TG structures by using nanometer-scale, CMOS-integrable, graphene-on-silica stacked materials through finite-element-methods simulations. It has been shown that it is possible to implement novel, controllable, thermally based Boolean-logic and spike-timing-dependent plasticity operations for advanced (neuromorphic) computing applications using such thermal-guide architectures.

  10. Digest: Ant workers might use ancient regulatory pathways to divide labor

    Czech Academy of Sciences Publication Activity Database

    Ernst, Ulrich R.

    2017-01-01

    Roč. 71, č. 1 (2017), s. 193-194 ISSN 0014-3820 Institutional support: RVO:61388963 Keywords : regulatory pathways * social insect * ants Subject RIV: EH - Ecology, Behaviour OBOR OECD: Biology (theoretical, mathematical, thermal, cryobiology, biological rhythm), Evolutionary biology Impact factor: 4.201, year: 2016

  11. Regulatory variation: an emerging vantage point for cancer biology.

    Science.gov (United States)

    Li, Luolan; Lorzadeh, Alireza; Hirst, Martin

    2014-01-01

    Transcriptional regulation involves complex and interdependent interactions of noncoding and coding regions of the genome with proteins that interact and modify them. Genetic variation/mutation in coding and noncoding regions of the genome can drive aberrant transcription and disease. In spite of accounting for nearly 98% of the genome comparatively little is known about the contribution of noncoding DNA elements to disease. Genome-wide association studies of complex human diseases including cancer have revealed enrichment for variants in the noncoding genome. A striking finding of recent cancer genome re-sequencing efforts has been the previously underappreciated frequency of mutations in epigenetic modifiers across a wide range of cancer types. Taken together these results point to the importance of dysregulation in transcriptional regulatory control in genesis of cancer. Powered by recent technological advancements in functional genomic profiling, exploration of normal and transformed regulatory networks will provide novel insight into the initiation and progression of cancer and open new windows to future prognostic and diagnostic tools. © 2013 Wiley Periodicals, Inc.

  12. The nomenclature of MHC class I gene regulatory regions - the case of two different downstream regulatory elements

    Czech Academy of Sciences Publication Activity Database

    Hatina, J.; Jansa, Petr; Forejt, Jiří

    2001-01-01

    Roč. 37, 12-13 (2001), s. 799-800 ISSN 0161-5890 Institutional research plan: CEZ:AV0Z5052915 Keywords : MHC I gene regulatory elements Subject RIV: EB - Genetics ; Molecular Biology Impact factor: 1.973, year: 2001

  13. Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures

    Science.gov (United States)

    Liang, Shoudan; Fuhrman, Stefanie; Somogyi, Roland

    1998-01-01

    Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.

  14. Towards a predictive theory for genetic regulatory networks

    Science.gov (United States)

    Tkacik, Gasper

    When cells respond to changes in the environment by regulating the expression levels of their genes, we often draw parallels between these biological processes and engineered information processing systems. One can go beyond this qualitative analogy, however, by analyzing information transmission in biochemical ``hardware'' using Shannon's information theory. Here, gene regulation is viewed as a transmission channel operating under restrictive constraints set by the resource costs and intracellular noise. We present a series of results demonstrating that a theory of information transmission in genetic regulatory circuits feasibly yields non-trivial, testable predictions. These predictions concern strategies by which individual gene regulatory elements, e.g., promoters or enhancers, read out their signals; as well as strategies by which small networks of genes, independently or in spatially coupled settings, respond to their inputs. These predictions can be quantitatively compared to the known regulatory networks and their function, and can elucidate how reproducible biological processes, such as embryonic development, can be orchestrated by networks built out of noisy components. Preliminary successes in the gap gene network of the fruit fly Drosophila indicate that a full ab initio theoretical prediction of a regulatory network is possible, a feat that has not yet been achieved for any real regulatory network. We end by describing open challenges on the path towards such a prediction.

  15. Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory

    Energy Technology Data Exchange (ETDEWEB)

    Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S., E-mail: miaoxs@mail.hust.edu.cn [Wuhan National Laboratory for Optoelectronics (WNLO), Huazhong University of Science and Technology (HUST), Wuhan 430074 (China); School of Optical and Electronic Information, Huazhong University of Science and Technology, Wuhan 430074 (China)

    2013-12-21

    Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices.

  16. Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory

    International Nuclear Information System (INIS)

    Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S.

    2013-01-01

    Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices

  17. Calculating the bidirectional reflectance of natural vegetation covers using Boolean models and geometric optics

    Science.gov (United States)

    Strahler, Alan H.; Li, Xiao-Wen; Jupp, David L. B.

    1991-01-01

    The bidirectional radiance or reflectance of a forest or woodland can be modeled using principles of geometric optics and Boolean models for random sets in a three dimensional space. This model may be defined at two levels, the scene includes four components; sunlight and shadowed canopy, and sunlit and shadowed background. The reflectance of the scene is modeled as the sum of the reflectances of the individual components as weighted by their areal proportions in the field of view. At the leaf level, the canopy envelope is an assemblage of leaves, and thus the reflectance is a function of the areal proportions of sunlit and shadowed leaf, and sunlit and shadowed background. Because the proportions of scene components are dependent upon the directions of irradiance and exitance, the model accounts for the hotspot that is well known in leaf and tree canopies.

  18. FDA Regulation of Follow-On Biologics

    Science.gov (United States)

    2009-02-24

    opening a pathway for the approval of follow-on biologics. A biologic is a preparation, such as a drug or a vaccine , that is made from living...2006 Drug Trend Report, April 2006, p. 38. C Biologic vs. Follow-on Biologic A biologic is a preparation, such as a drug or a vaccine , that is...doc9496/s1695.pdf. 19 Thijs J. Giezen, Aukje K. Mantel-Teeuwisse, and Sabine M. J. M. Straus, et al., “Safety-related regulatory actions for biologicals

  19. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

    KAUST Repository

    Lima, Ricardo

    2016-06-16

    This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

  20. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

    KAUST Repository

    Lima, Ricardo; Grossmann, Ignacio E.

    2016-01-01

    This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

  1. Programming Morphogenesis through Systems and Synthetic Biology.

    Science.gov (United States)

    Velazquez, Jeremy J; Su, Emily; Cahan, Patrick; Ebrahimkhani, Mo R

    2018-04-01

    Mammalian tissue development is an intricate, spatiotemporal process of self-organization that emerges from gene regulatory networks of differentiating stem cells. A major goal in stem cell biology is to gain a sufficient understanding of gene regulatory networks and cell-cell interactions to enable the reliable and robust engineering of morphogenesis. Here, we review advances in synthetic biology, single cell genomics, and multiscale modeling, which, when synthesized, provide a framework to achieve the ambitious goal of programming morphogenesis in complex tissues and organoids. Copyright © 2017 Elsevier Ltd. All rights reserved.

  2. Quantitative inference of dynamic regulatory pathways via microarray data

    Directory of Open Access Journals (Sweden)

    Chen Bor-Sen

    2005-03-01

    Full Text Available Abstract Background The cellular signaling pathway (network is one of the main topics of organismic investigations. The intracellular interactions between genes in a signaling pathway are considered as the foundation of functional genomics. Thus, what genes and how much they influence each other through transcriptional binding or physical interactions are essential problems. Under the synchronous measures of gene expression via a microarray chip, an amount of dynamic information is embedded and remains to be discovered. Using a systematically dynamic modeling approach, we explore the causal relationship among genes in cellular signaling pathways from the system biology approach. Results In this study, a second-order dynamic model is developed to describe the regulatory mechanism of a target gene from the upstream causality point of view. From the expression profile and dynamic model of a target gene, we can estimate its upstream regulatory function. According to this upstream regulatory function, we would deduce the upstream regulatory genes with their regulatory abilities and activation delays, and then link up a regulatory pathway. Iteratively, these regulatory genes are considered as target genes to trace back their upstream regulatory genes. Then we could construct the regulatory pathway (or network to the genome wide. In short, we can infer the genetic regulatory pathways from gene-expression profiles quantitatively, which can confirm some doubted paths or seek some unknown paths in a regulatory pathway (network. Finally, the proposed approach is validated by randomly reshuffling the time order of microarray data. Conclusion We focus our algorithm on the inference of regulatory abilities of the identified causal genes, and how much delay before they regulate the downstream genes. With this information, a regulatory pathway would be built up using microarray data. In the present study, two signaling pathways, i.e. circadian regulatory

  3. Risk management of biologicals: a regulatory and clinical perspective

    NARCIS (Netherlands)

    Giezen, T.J.|info:eu-repo/dai/nl/304823112

    2011-01-01

    Biologicals are a relatively new class of drugs and are important treatment options for a variety of chronic and/or serious conditions. Biologicals have different characteristics as compared to the traditional chemically synthesised drugs, which may result in different risk profiles and the need for

  4. MicroRNAs as regulatory elements in psoriasis

    Directory of Open Access Journals (Sweden)

    Liu Yuan

    2016-01-01

    Full Text Available Psoriasis is a chronic, autoimmune, and complex genetic disorder that affects 23% of the European population. The symptoms of Psoriatic skin are inflammation, raised and scaly lesions. microRNA, which is short, nonprotein-coding, regulatory RNAs, plays critical roles in psoriasis. microRNA participates in nearly all biological processes, such as cell differentiation, development and metabolism. Recent researches reveal that multitudinous novel microRNAs have been identified in skin. Some of these substantial novel microRNAs play as a class of posttranscriptional gene regulator in skin disease, such as psoriasis. In order to insight into microRNAs biological functions and verify microRNAs biomarker, we review diverse references about characterization, profiling and subtype of microRNAs. Here we will share our opinions about how and which microRNAs are as regulatory in psoriasis.

  5. Using boolean and fuzzy logic combined with analytic hierarchy process for hazardous waste landfill site selection: A case study from Hormozgan province, Iran

    Directory of Open Access Journals (Sweden)

    Mahdieh Saadat Foomani

    2017-01-01

    Full Text Available Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where these special types of waste can be disposed of securely. Since landfills are permanent sites, special attention must be afforded in selecting the location. This paper investigated the use of the Boolean theory and Fuzzy logic in combination with Analytic Hierarchy Process (AHP methods by applying GIS and IDRISI software for the selection of a hazardous waste landfill site in the Iranian province of Hormozgan. The best location was determined via the Fuzzy and the Boolean methodologies. By collating the area selected for the hazardous waste landfill, this study found that Fuzzy logic with an AND operator had the best options for this purpose. In the end, the most suitable area for a hazardous waste landfill was about 1.6 km2 which was obtained by employing Fuzzy in combination with AHP and by using an AND operator. In addition, all the fundamental criteria affecting the landfill location were considered.

  6. Bioattractors: dynamical systems theory and the evolution of regulatory processes

    Science.gov (United States)

    Jaeger, Johannes; Monk, Nick

    2014-01-01

    In this paper, we illustrate how dynamical systems theory can provide a unifying conceptual framework for evolution of biological regulatory systems. Our argument is that the genotype–phenotype map can be characterized by the phase portrait of the underlying regulatory process. The features of this portrait – such as attractors with associated basins and their bifurcations – define the regulatory and evolutionary potential of a system. We show how the geometric analysis of phase space connects Waddington's epigenetic landscape to recent computational approaches for the study of robustness and evolvability in network evolution. We discuss how the geometry of phase space determines the probability of possible phenotypic transitions. Finally, we demonstrate how the active, self-organizing role of the environment in phenotypic evolution can be understood in terms of dynamical systems concepts. This approach yields mechanistic explanations that go beyond insights based on the simulation of evolving regulatory networks alone. Its predictions can now be tested by studying specific, experimentally tractable regulatory systems using the tools of modern systems biology. A systematic exploration of such systems will enable us to understand better the nature and origin of the phenotypic variability, which provides the substrate for evolution by natural selection. PMID:24882812

  7. Modular arrangement of regulatory RNA elements.

    Science.gov (United States)

    Roßmanith, Johanna; Narberhaus, Franz

    2017-03-04

    Due to their simple architecture and control mechanism, regulatory RNA modules are attractive building blocks in synthetic biology. This is especially true for riboswitches, which are natural ligand-binding regulators of gene expression. The discovery of various tandem riboswitches inspired the design of combined RNA modules with activities not yet found in nature. Riboswitches were placed in tandem or in combination with a ribozyme or temperature-responsive RNA thermometer resulting in new functionalities. Here, we compare natural examples of tandem riboswitches with recently designed artificial RNA regulators suggesting substantial modularity of regulatory RNA elements. Challenges associated with modular RNA design are discussed.

  8. MIRA: An R package for DNA methylation-based inference of regulatory activity.

    Science.gov (United States)

    Lawson, John T; Tomazou, Eleni M; Bock, Christoph; Sheffield, Nathan C

    2018-03-01

    DNA methylation contains information about the regulatory state of the cell. MIRA aggregates genome-scale DNA methylation data into a DNA methylation profile for independent region sets with shared biological annotation. Using this profile, MIRA infers and scores the collective regulatory activity for each region set. MIRA facilitates regulatory analysis in situations where classical regulatory assays would be difficult and allows public sources of open chromatin and protein binding regions to be leveraged for novel insight into the regulatory state of DNA methylation datasets. R package available on Bioconductor: http://bioconductor.org/packages/release/bioc/html/MIRA.html. nsheffield@virginia.edu.

  9. Core regulatory network motif underlies the ocellar complex patterning in Drosophila melanogaster

    Science.gov (United States)

    Aguilar-Hidalgo, D.; Lemos, M. C.; Córdoba, A.

    2015-03-01

    During organogenesis, developmental programs governed by Gene Regulatory Networks (GRN) define the functionality, size and shape of the different constituents of living organisms. Robustness, thus, is an essential characteristic that GRNs need to fulfill in order to maintain viability and reproducibility in a species. In the present work we analyze the robustness of the patterning for the ocellar complex formation in Drosophila melanogaster fly. We have systematically pruned the GRN that drives the development of this visual system to obtain the minimum pathway able to satisfy this pattern. We found that the mechanism underlying the patterning obeys to the dynamics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion. A Boolean modeling of the GRN confirms robustness in the patterning mechanism showing the same result for different network complexity levels. Interestingly, the network provides a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli. This theoretical result predicts that the ocellar pattern may underlie oscillatory dynamics in its genetic regulation.

  10. On the Interplay between Entropy and Robustness of Gene Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Bor-Sen Chen

    2010-05-01

    Full Text Available The interplay between entropy and robustness of gene network is a core mechanism of systems biology. The entropy is a measure of randomness or disorder of a physical system due to random parameter fluctuation and environmental noises in gene regulatory networks. The robustness of a gene regulatory network, which can be measured as the ability to tolerate the random parameter fluctuation and to attenuate the effect of environmental noise, will be discussed from the robust H∞ stabilization and filtering perspective. In this review, we will also discuss their balancing roles in evolution and potential applications in systems and synthetic biology.

  11. RNA SURVEILLANCE– AN EMERGING ROLE FOR RNA REGULATORY NETWORKS IN AGING

    OpenAIRE

    Montano, Monty; Long, Kimberly

    2010-01-01

    In this review, we describe recent advances in the field of RNA regulatory biology and relate these advances to aging science. We introduce a new term, RNA surveillance, an RNA regulatory process that is conserved in metazoans, and describe how RNA surveillance represents molecular cross-talk between two emerging RNA regulatory systems – RNA interference and RNA editing. We discuss how RNA surveillance mechanisms influence mRNA and microRNA expression and activity during lifespan. Additionall...

  12. Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.

    Science.gov (United States)

    Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad

    2017-12-19

    Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.

  13. Psychological state is related to the remission of the Boolean-based definition of patient global assessment in patients with rheumatoid arthritis.

    Science.gov (United States)

    Fusama, Mie; Miura, Yasushi; Yukioka, Kumiko; Kuroiwa, Takanori; Yukioka, Chikako; Inoue, Miyako; Nakanishi, Tae; Murata, Norikazu; Takai, Noriko; Higashi, Kayoko; Kuritani, Taro; Maeda, Keiji; Sano, Hajime; Yukioka, Masao; Nakahara, Hideko

    2015-09-01

    To evaluate whether the psychological state is related to the Boolean-based definition of patient global assessment (PGA) remission in patients with rheumatoid arthritis (RA). Patients with RA who met the criteria of swollen joint count (SJC) ≤ 1, tender joint count (TJC) ≤ 1 and C-reactive protein (CRP) ≤ 1 were divided into two groups, PGA remission group (PGA ≤ 1 cm) and non-remission group (PGA > 1 cm). Anxiety was evaluated utilizing the Hospital Anxiety and Depression Scale-Anxiety (HADS-A), while depression was evaluated with HADS-Depression (HADS-D) and the Center for Epidemiologic Studies Depression Scale (CES-D). Comparison analyses were done between the PGA remission and non-remission groups in HADS-A, HADS-D and CES-D. Seventy-eight patients met the criteria for SJC ≤ 1, TJC ≤ 1 and CRP ≤ 1. There were no significant differences between the PGA remission group (n = 45) and the non-remission group (n = 33) in age, sex, disease duration and Steinbrocker's class and stage. HADS-A, HADS-D and CES-D scores were significantly lower in the PGA remission group. Patients with RA who did not meet the PGA remission criteria despite good disease condition were in a poorer psychological state than those who satisfied the Boolean-based definition of clinical remission. Psychological support might be effective for improvement of PGA, resulting in the attainment of true remission.

  14. Transcription regulatory networks analysis using CAGE

    KAUST Repository

    Tegnér, Jesper N.

    2009-10-01

    Mapping out cellular networks in general and transcriptional networks in particular has proved to be a bottle-neck hampering our understanding of biological processes. Integrative approaches fusing computational and experimental technologies for decoding transcriptional networks at a high level of resolution is therefore of uttermost importance. Yet, this is challenging since the control of gene expression in eukaryotes is a complex multi-level process influenced by several epigenetic factors and the fine interplay between regulatory proteins and the promoter structure governing the combinatorial regulation of gene expression. In this chapter we review how the CAGE data can be integrated with other measurements such as expression, physical interactions and computational prediction of regulatory motifs, which together can provide a genome-wide picture of eukaryotic transcriptional regulatory networks at a new level of resolution. © 2010 by Pan Stanford Publishing Pte. Ltd. All rights reserved.

  15. Measuring the evolutionary rewiring of biological networks.

    Directory of Open Access Journals (Sweden)

    Chong Shou

    Full Text Available We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or "rewire", at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of "commonplace" networks such as family trees, co-authorships and linux-kernel function dependencies.

  16. Information transmission in genetic regulatory networks: a review

    International Nuclear Information System (INIS)

    Tkacik, Gasper; Walczak, Aleksandra M

    2011-01-01

    Genetic regulatory networks enable cells to respond to changes in internal and external conditions by dynamically coordinating their gene expression profiles. Our ability to make quantitative measurements in these biochemical circuits has deepened our understanding of what kinds of computations genetic regulatory networks can perform, and with what reliability. These advances have motivated researchers to look for connections between the architecture and function of genetic regulatory networks. Transmitting information between a network's inputs and outputs has been proposed as one such possible measure of function, relevant in certain biological contexts. Here we summarize recent developments in the application of information theory to gene regulatory networks. We first review basic concepts in information theory necessary for understanding recent work. We then discuss the functional complexity of gene regulation, which arises from the molecular nature of the regulatory interactions. We end by reviewing some experiments that support the view that genetic networks responsible for early development of multicellular organisms might be maximizing transmitted 'positional information'. (topical review)

  17. Synthetic biology and regulatory networks: where metabolic systems biology meets control engineering

    NARCIS (Netherlands)

    He, F.; Murabito, E.; Westerhoff, H.V.

    2016-01-01

    Metabolic pathways can be engineered to maximize the synthesis of various products of interest. With the advent of computational systems biology, this endeavour is usually carried out throughin silicotheoretical studies with the aim to guide and complement furtherin vitroandin vivoexperimental

  18. Characterization of noncoding regulatory DNA in the human genome.

    Science.gov (United States)

    Elkon, Ran; Agami, Reuven

    2017-08-08

    Genetic variants associated with common diseases are usually located in noncoding parts of the human genome. Delineation of the full repertoire of functional noncoding elements, together with efficient methods for probing their biological roles, is therefore of crucial importance. Over the past decade, DNA accessibility and various epigenetic modifications have been associated with regulatory functions. Mapping these features across the genome has enabled researchers to begin to document the full complement of putative regulatory elements. High-throughput reporter assays to probe the functions of regulatory regions have also been developed but these methods separate putative regulatory elements from the chromosome so that any effects of chromatin context and long-range regulatory interactions are lost. Definitive assignment of function(s) to putative cis-regulatory elements requires perturbation of these elements. Genome-editing technologies are now transforming our ability to perturb regulatory elements across entire genomes. Interpretation of high-throughput genetic screens that incorporate genome editors might enable the construction of an unbiased map of functional noncoding elements in the human genome.

  19. Bottom-up GGM algorithm for constructing multiple layered hierarchical gene regulatory networks

    Science.gov (United States)

    Multilayered hierarchical gene regulatory networks (ML-hGRNs) are very important for understanding genetics regulation of biological pathways. However, there are currently no computational algorithms available for directly building ML-hGRNs that regulate biological pathways. A bottom-up graphic Gaus...

  20. Global Acceptance of Biosimilars: Importance of Regulatory Consistency, Education, and Trust.

    Science.gov (United States)

    Cazap, Eduardo; Jacobs, Ira; McBride, Ali; Popovian, Robert; Sikora, Karol

    2018-05-16

    Globally, biosimilars are expected to have a key role in improving patient access to biological therapies and addressing concerns regarding the escalating cost of health care. Indeed, in Europe, increased use of biologics and reduced drug prices have been observed after the introduction of biosimilars. Recently, several monoclonal antibody biosimilars of anticancer therapies have been approved, and numerous others are in various stages of clinical development. Biosimilars are authorized via a regulatory pathway separate from that used for generic drugs; they are also regulated separately from novel biologics. Biosimilar approval pathways in many major regulatory regions worldwide are, to a broad degree, scientifically aligned. However, owing to regional differences in health care priorities, policies, and resources, some important regulatory inconsistencies are evident. Acceptance of biosimilars by health care systems, health care professionals, and patients will be a key factor in the uptake of these therapies, and such regulatory variations could contribute to confusion and diminished confidence regarding the quality, efficacy, and reliability of these agents. Furthermore, the need for manufacturers to account for regulatory inconsistencies introduces inefficiencies and delays into biosimilar development programs. These issues should be addressed if biosimilars are to attain their maximal global potential. This review summarizes the evolution of the global biosimilar landscape and provides examples of inconsistencies between regulatory requirements in different regions. In addition, we review ongoing efforts to improve regulatory alignment and highlight the importance of education as a crucial factor in generating trust in, and acceptance of, biosimilars on a worldwide scale. Biosimilars of monoclonal antibody anticancer therapies are beginning to emerge, and more are likely to become available for clinical use in the near future. The extent to which biosimilars

  1. Regulatory agencies and regulatory risk

    OpenAIRE

    Knieps, Günter; Weiß, Hans-Jörg

    2008-01-01

    The aim of this paper is to show that regulatory risk is due to the discretionary behaviour of regulatory agencies, caused by a too extensive regulatory mandate provided by the legislator. The normative point of reference and a behavioural model of regulatory agencies based on the positive theory of regulation are presented. Regulatory risk with regard to the future behaviour of regulatory agencies is modelled as the consequence of the ex ante uncertainty about the relative influence of inter...

  2. An integer optimization algorithm for robust identification of non-linear gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Chemmangattuvalappil Nishanth

    2012-09-01

    Full Text Available Abstract Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters

  3. Synthetic biology and regulatory networks: where metabolic systems biology meets control engineering.

    Science.gov (United States)

    He, Fei; Murabito, Ettore; Westerhoff, Hans V

    2016-04-01

    Metabolic pathways can be engineered to maximize the synthesis of various products of interest. With the advent of computational systems biology, this endeavour is usually carried out through in silico theoretical studies with the aim to guide and complement further in vitro and in vivo experimental efforts. Clearly, what counts is the result in vivo, not only in terms of maximal productivity but also robustness against environmental perturbations. Engineering an organism towards an increased production flux, however, often compromises that robustness. In this contribution, we review and investigate how various analytical approaches used in metabolic engineering and synthetic biology are related to concepts developed by systems and control engineering. While trade-offs between production optimality and cellular robustness have already been studied diagnostically and statically, the dynamics also matter. Integration of the dynamic design aspects of control engineering with the more diagnostic aspects of metabolic, hierarchical control and regulation analysis is leading to the new, conceptual and operational framework required for the design of robust and productive dynamic pathways. © 2016 The Author(s).

  4. XcisClique: analysis of regulatory bicliques

    Directory of Open Access Journals (Sweden)

    Grene Ruth

    2006-04-01

    Full Text Available Abstract Background Modeling of cis-elements or regulatory motifs in promoter (upstream regions of genes is a challenging computational problem. In this work, set of regulatory motifs simultaneously present in the promoters of a set of genes is modeled as a biclique in a suitably defined bipartite graph. A biologically meaningful co-occurrence of multiple cis-elements in a gene promoter is assessed by the combined analysis of genomic and gene expression data. Greater statistical significance is associated with a set of genes that shares a common set of regulatory motifs, while simultaneously exhibiting highly correlated gene expression under given experimental conditions. Methods XcisClique, the system developed in this work, is a comprehensive infrastructure that associates annotated genome and gene expression data, models known cis-elements as regular expressions, identifies maximal bicliques in a bipartite gene-motif graph; and ranks bicliques based on their computed statistical significance. Significance is a function of the probability of occurrence of those motifs in a biclique (a hypergeometric distribution, and on the new sum of absolute values statistic (SAV that uses Spearman correlations of gene expression vectors. SAV is a statistic well-suited for this purpose as described in the discussion. Results XcisClique identifies new motif and gene combinations that might indicate as yet unidentified involvement of sets of genes in biological functions and processes. It currently supports Arabidopsis thaliana and can be adapted to other organisms, assuming the existence of annotated genomic sequences, suitable gene expression data, and identified regulatory motifs. A subset of Xcis Clique functionalities, including the motif visualization component MotifSee, source code, and supplementary material are available at https://bioinformatics.cs.vt.edu/xcisclique/.

  5. Interchangeability of biosimilar and biological reference product: updated regulatory positions and pre- and post-marketing evidence.

    Science.gov (United States)

    Trifirò, Gianluca; Marcianò, Ilaria; Ingrasciotta, Ylenia

    2018-03-01

    Since 2006, biosimilars have been available in several countries worldwide, thus allowing for potential savings in pharmaceutical expenditure. However, there have been numerous debates about the interchangeability of biosimilars and reference products based on concerns of immunogenicity by switching between biological products, which may cause lack of effect and toxicity. Areas covered: The authors provide the reader with an overview of the different positions of regulatory authorities on the interchangeability and automatic substitution of biosimilars and reference products. Presently, the FDA allows automatic substitution without prescriber intervention if the biosimilar is interchangeable with reference products, while the European Medicines Agency delegate to each single EU member state. Expert opinion: Different approaches in defining interchangeability and automatic substitution call for harmonization to increase confidence of healthcare professionals and patients about the clinical impact of switching. Networks of electronic healthcare records and administrative databases, potentially linkable to clinical charts and registries may rapidly assess frequency and benefit-risk profile of different switching patterns in routine care at different levels, thus integrating and strengthening pre-marketing evidence.

  6. Computational Genetic Regulatory Networks Evolvable, Self-organizing Systems

    CERN Document Server

    Knabe, Johannes F

    2013-01-01

    Genetic Regulatory Networks (GRNs) in biological organisms are primary engines for cells to enact their engagements with environments, via incessant, continually active coupling. In differentiated multicellular organisms, tremendous complexity has arisen in the course of evolution of life on earth. Engineering and science have so far achieved no working system that can compare with this complexity, depth and scope of organization. Abstracting the dynamics of genetic regulatory control to a computational framework in which artificial GRNs in artificial simulated cells differentiate while connected in a changing topology, it is possible to apply Darwinian evolution in silico to study the capacity of such developmental/differentiated GRNs to evolve. In this volume an evolutionary GRN paradigm is investigated for its evolvability and robustness in models of biological clocks, in simple differentiated multicellularity, and in evolving artificial developing 'organisms' which grow and express an ontogeny starting fr...

  7. A mathematical framework for agent based models of complex biological networks.

    Science.gov (United States)

    Hinkelmann, Franziska; Murrugarra, David; Jarrah, Abdul Salam; Laubenbacher, Reinhard

    2011-07-01

    Agent-based modeling and simulation is a useful method to study biological phenomena in a wide range of fields, from molecular biology to ecology. Since there is currently no agreed-upon standard way to specify such models, it is not always easy to use published models. Also, since model descriptions are not usually given in mathematical terms, it is difficult to bring mathematical analysis tools to bear, so that models are typically studied through simulation. In order to address this issue, Grimm et al. proposed a protocol for model specification, the so-called ODD protocol, which provides a standard way to describe models. This paper proposes an addition to the ODD protocol which allows the description of an agent-based model as a dynamical system, which provides access to computational and theoretical tools for its analysis. The mathematical framework is that of algebraic models, that is, time-discrete dynamical systems with algebraic structure. It is shown by way of several examples how this mathematical specification can help with model analysis. This mathematical framework can also accommodate other model types such as Boolean networks and the more general logical models, as well as Petri nets.

  8. Analysis and logical modeling of biological signaling transduction networks

    Science.gov (United States)

    Sun, Zhongyao

    The study of network theory and its application span across a multitude of seemingly disparate fields of science and technology: computer science, biology, social science, linguistics, etc. It is the intrinsic similarities embedded in the entities and the way they interact with one another in these systems that link them together. In this dissertation, I present from both the aspect of theoretical analysis and the aspect of application three projects, which primarily focus on signal transduction networks in biology. In these projects, I assembled a network model through extensively perusing literature, performed model-based simulations and validation, analyzed network topology, and proposed a novel network measure. The application of network modeling to the system of stomatal opening in plants revealed a fundamental question about the process that has been left unanswered in decades. The novel measure of the redundancy of signal transduction networks with Boolean dynamics by calculating its maximum node-independent elementary signaling mode set accurately predicts the effect of single node knockout in such signaling processes. The three projects as an organic whole advance the understanding of a real system as well as the behavior of such network models, giving me an opportunity to take a glimpse at the dazzling facets of the immense world of network science.

  9. Gene regulatory and signaling networks exhibit distinct topological distributions of motifs

    Science.gov (United States)

    Ferreira, Gustavo Rodrigues; Nakaya, Helder Imoto; Costa, Luciano da Fontoura

    2018-04-01

    The biological processes of cellular decision making and differentiation involve a plethora of signaling pathways and gene regulatory circuits. These networks in turn exhibit a multitude of motifs playing crucial parts in regulating network activity. Here we compare the topological placement of motifs in gene regulatory and signaling networks and observe that it suggests different evolutionary strategies in motif distribution for distinct cellular subnetworks.

  10. An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.

    Science.gov (United States)

    Jiang, Han; Li, Xue; Xu, Qiuliang

    2016-12-01

    The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.

  11. Semi-supervised prediction of gene regulatory networks using ...

    Indian Academy of Sciences (India)

    2015-09-28

    Sep 28, 2015 ... Use of computational methods to predict gene regulatory networks (GRNs) from gene expression data is a challenging ... two types of methods differ primarily based on whether ..... negligible, allowing us to draw the qualitative conclusions .... research will be conducted to develop additional biologically.

  12. Recurrent rewiring and emergence of RNA regulatory networks.

    Science.gov (United States)

    Wilinski, Daniel; Buter, Natascha; Klocko, Andrew D; Lapointe, Christopher P; Selker, Eric U; Gasch, Audrey P; Wickens, Marvin

    2017-04-04

    Alterations in regulatory networks contribute to evolutionary change. Transcriptional networks are reconfigured by changes in the binding specificity of transcription factors and their cognate sites. The evolution of RNA-protein regulatory networks is far less understood. The PUF (Pumilio and FBF) family of RNA regulatory proteins controls the translation, stability, and movements of hundreds of mRNAs in a single species. We probe the evolution of PUF-RNA networks by direct identification of the mRNAs bound to PUF proteins in budding and filamentous fungi and by computational analyses of orthologous RNAs from 62 fungal species. Our findings reveal that PUF proteins gain and lose mRNAs with related and emergent biological functions during evolution. We demonstrate at least two independent rewiring events for PUF3 orthologs, independent but convergent evolution of PUF4/5 binding specificity and the rewiring of the PUF4/5 regulons in different fungal lineages. These findings demonstrate plasticity in RNA regulatory networks and suggest ways in which their rewiring occurs.

  13. Analysis of a dynamic model of guard cell signaling reveals the stability of signal propagation

    Science.gov (United States)

    Gan, Xiao; Albert, RéKa

    Analyzing the long-term behaviors (attractors) of dynamic models of biological systems can provide valuable insight into biological phenotypes and their stability. We identified the long-term behaviors of a multi-level, 70-node discrete dynamic model of the stomatal opening process in plants. We reduce the model's huge state space by reducing unregulated nodes and simple mediator nodes, and by simplifying the regulatory functions of selected nodes while keeping the model consistent with experimental observations. We perform attractor analysis on the resulting 32-node reduced model by two methods: 1. converting it into a Boolean model, then applying two attractor-finding algorithms; 2. theoretical analysis of the regulatory functions. We conclude that all nodes except two in the reduced model have a single attractor; and only two nodes can admit oscillations. The multistability or oscillations do not affect the stomatal opening level in any situation. This conclusion applies to the original model as well in all the biologically meaningful cases. We further demonstrate the robustness of signal propagation by showing that a large percentage of single-node knockouts does not affect the stomatal opening level. Thus, we conclude that the complex structure of this signal transduction network provides multiple information propagation pathways while not allowing extensive multistability or oscillations, resulting in robust signal propagation. Our innovative combination of methods offers a promising way to analyze multi-level models.

  14. Timing robustness in the budding and fission yeast cell cycles.

    KAUST Repository

    Mangla, Karan; Dill, David L; Horowitz, Mark A

    2010-01-01

    Robustness of biological models has emerged as an important principle in systems biology. Many past analyses of Boolean models update all pending changes in signals simultaneously (i.e., synchronously), making it impossible to consider robustness

  15. The future of yogurt: scientific and regulatory needs.

    Science.gov (United States)

    German, J Bruce

    2014-05-01

    Lactation biology, microbial selection, and human diversity are central themes that could guide investment in scientific research, industrial innovation, and regulatory policy oversight to propel yogurt into the central role for health-promoting food products. The ability of yogurt to provide the nourishing properties of milk together with the live microorganisms from fermentation provides a unique combination of food assets. Academic research must now define the various targets on which these biological assets act to improve health and develop the metrics that can quantitatively document their benefits. The food industry must reconcile that yogurt and its microorganisms cannot be expected to provide measurable benefits for all consumers, at all doses, and at all times. A supportive regulatory oversight must demand safety and yet encourage innovations that support a value proposition for yogurt in health. Health valuation in the marketplace will be driven by parallel innovations, including accurate assessment technologies, validated microbial ingredients, and health-aware consumers.

  16. Inference of cancer-specific gene regulatory networks using soft computing rules.

    Science.gov (United States)

    Wang, Xiaosheng; Gotoh, Osamu

    2010-03-24

    Perturbations of gene regulatory networks are essentially responsible for oncogenesis. Therefore, inferring the gene regulatory networks is a key step to overcoming cancer. In this work, we propose a method for inferring directed gene regulatory networks based on soft computing rules, which can identify important cause-effect regulatory relations of gene expression. First, we identify important genes associated with a specific cancer (colon cancer) using a supervised learning approach. Next, we reconstruct the gene regulatory networks by inferring the regulatory relations among the identified genes, and their regulated relations by other genes within the genome. We obtain two meaningful findings. One is that upregulated genes are regulated by more genes than downregulated ones, while downregulated genes regulate more genes than upregulated ones. The other one is that tumor suppressors suppress tumor activators and activate other tumor suppressors strongly, while tumor activators activate other tumor activators and suppress tumor suppressors weakly, indicating the robustness of biological systems. These findings provide valuable insights into the pathogenesis of cancer.

  17. In silico analysis of cis-acting regulatory elements in 5' regulatory regions of sucrose transporter gene families in rice (Oryza sativa Japonica) and Arabidopsis thaliana.

    Science.gov (United States)

    Ibraheem, Omodele; Botha, Christiaan E J; Bradley, Graeme

    2010-12-01

    The regulation of gene expression involves a multifarious regulatory system. Each gene contains a unique combination of cis-acting regulatory sequence elements in the 5' regulatory region that determines its temporal and spatial expression. Cis-acting regulatory elements are essential transcriptional gene regulatory units; they control many biological processes and stress responses. Thus a full understanding of the transcriptional gene regulation system will depend on successful functional analyses of cis-acting elements. Cis-acting regulatory elements present within the 5' regulatory region of the sucrose transporter gene families in rice (Oryza sativa Japonica cultivar-group) and Arabidopsis thaliana, were identified using a bioinformatics approach. The possible cis-acting regulatory elements were predicted by scanning 1.5kbp of 5' regulatory regions of the sucrose transporter genes translational start sites, using Plant CARE, PLACE and Genomatix Matinspector professional databases. Several cis-acting regulatory elements that are associated with plant development, plant hormonal regulation and stress response were identified, and were present in varying frequencies within the 1.5kbp of 5' regulatory region, among which are; A-box, RY, CAT, Pyrimidine-box, Sucrose-box, ABRE, ARF, ERE, GARE, Me-JA, ARE, DRE, GA-motif, GATA, GT-1, MYC, MYB, W-box, and I-box. This result reveals the probable cis-acting regulatory elements that possibly are involved in the expression and regulation of sucrose transporter gene families in rice and Arabidopsis thaliana during cellular development or environmental stress conditions. Copyright © 2010 Elsevier Ltd. All rights reserved.

  18. Review of Biological Network Data and Its Applications

    Directory of Open Access Journals (Sweden)

    Donghyeon Yu

    2013-12-01

    Full Text Available Studying biological networks, such as protein-protein interactions, is key to understanding complex biological activities. Various types of large-scale biological datasets have been collected and analyzed with high-throughput technologies, including DNA microarray, next-generation sequencing, and the two-hybrid screening system, for this purpose. In this review, we focus on network-based approaches that help in understanding biological systems and identifying biological functions. Accordingly, this paper covers two major topics in network biology: reconstruction of gene regulatory networks and network-based applications, including protein function prediction, disease gene prioritization, and network-based genome-wide association study.

  19. European regulatory tools for advanced therapy medicinal products.

    Science.gov (United States)

    Flory, Egbert; Reinhardt, Jens

    2013-12-01

    Increasing scientific knowledge and technical innovations in the areas of cell biology, biotechnology and medicine resulted in the development of promising therapeutic approaches for the prevention and treatment of human diseases. Advanced therapy medicinal products (ATMPs) reflect a complex and innovative class of biopharmaceuticals as these products are highly research-driven, characterised by innovative manufacturing processes and heterogeneous with regard to their origin, type and complexity. This class of ATMP integrates gene therapy medicinal products, somatic cell therapy medicinal products and tissue engineering products and are often individualized and patient-specific products. Multiple challenges arise from the nature of ATMPs, which are often developed by micro, small and medium sized enterprises, university and academia, for whom regulatory experiences are limited and regulatory requirements are challenging. Regulatory guidance such as the reflection paper on classification of ATMPs and guidelines highlighting product-specific issues support academic research groups and pharmaceutical companies to foster the development of safe and effective ATMPs. This review provides an overview on the European regulatory aspects of ATMPs and highlights specific regulatory tools such as the ATMP classification procedure, a discussion on the hospital exemption for selected ATMPs as well as borderline issues towards transplants/transfusion products.

  20. Biological Networks Entropies: Examples in Neural Memory Networks, Genetic Regulation Networks and Social Epidemic Networks

    Directory of Open Access Journals (Sweden)

    Jacques Demongeot

    2018-01-01

    Full Text Available Networks used in biological applications at different scales (molecule, cell and population are of different types: neuronal, genetic, and social, but they share the same dynamical concepts, in their continuous differential versions (e.g., non-linear Wilson-Cowan system as well as in their discrete Boolean versions (e.g., non-linear Hopfield system; in both cases, the notion of interaction graph G(J associated to its Jacobian matrix J, and also the concepts of frustrated nodes, positive or negative circuits of G(J, kinetic energy, entropy, attractors, structural stability, etc., are relevant and useful for studying the dynamics and the robustness of these systems. We will give some general results available for both continuous and discrete biological networks, and then study some specific applications of three new notions of entropy: (i attractor entropy, (ii isochronal entropy and (iii entropy centrality; in three domains: a neural network involved in the memory evocation, a genetic network responsible of the iron control and a social network accounting for the obesity spread in high school environment.

  1. Prediction of transcriptional regulatory sites in the complete genome sequence of Escherichia coli K-12.

    Science.gov (United States)

    Thieffry, D; Salgado, H; Huerta, A M; Collado-Vides, J

    1998-06-01

    As one of the best-characterized free-living organisms, Escherichia coli and its recently completed genomic sequence offer a special opportunity to exploit systematically the variety of regulatory data available in the literature in order to make a comprehensive set of regulatory predictions in the whole genome. The complete genome sequence of E.coli was analyzed for the binding of transcriptional regulators upstream of coding sequences. The biological information contained in RegulonDB (Huerta, A.M. et al., Nucleic Acids Res.,26,55-60, 1998) for 56 different transcriptional proteins was the support to implement a stringent strategy combining string search and weight matrices. We estimate that our search included representatives of 15-25% of the total number of regulatory binding proteins in E.coli. This search was performed on the set of 4288 putative regulatory regions, each 450 bp long. Within the regions with predicted sites, 89% are regulated by one protein and 81% involve only one site. These numbers are reasonably consistent with the distribution of experimental regulatory sites. Regulatory sites are found in 603 regions corresponding to 16% of operon regions and 10% of intra-operonic regions. Additional evidence gives stronger support to some of these predictions, including the position of the site, biological consistency with the function of the downstream gene, as well as genetic evidence for the regulatory interaction. The predictions described here were incorporated into the map presented in the paper describing the complete E.coli genome (Blattner,F.R. et al., Science, 277, 1453-1461, 1997). The complete set of predictions in GenBank format is available at the url: http://www. cifn.unam.mx/Computational_Biology/E.coli-predictions ecoli-reg@cifn.unam.mx, collado@cifn.unam.mx

  2. Synthetic Biology: Tools to Design, Build, and Optimize Cellular Processes

    Science.gov (United States)

    Young, Eric; Alper, Hal

    2010-01-01

    The general central dogma frames the emergent properties of life, which make biology both necessary and difficult to engineer. In a process engineering paradigm, each biological process stream and process unit is heavily influenced by regulatory interactions and interactions with the surrounding environment. Synthetic biology is developing the tools and methods that will increase control over these interactions, eventually resulting in an integrative synthetic biology that will allow ground-up cellular optimization. In this review, we attempt to contextualize the areas of synthetic biology into three tiers: (1) the process units and associated streams of the central dogma, (2) the intrinsic regulatory mechanisms, and (3) the extrinsic physical and chemical environment. Efforts at each of these three tiers attempt to control cellular systems and take advantage of emerging tools and approaches. Ultimately, it will be possible to integrate these approaches and realize the vision of integrative synthetic biology when cells are completely rewired for biotechnological goals. This review will highlight progress towards this goal as well as areas requiring further research. PMID:20150964

  3. Synthetic Biology: Tools to Design, Build, and Optimize Cellular Processes

    Directory of Open Access Journals (Sweden)

    Eric Young

    2010-01-01

    Full Text Available The general central dogma frames the emergent properties of life, which make biology both necessary and difficult to engineer. In a process engineering paradigm, each biological process stream and process unit is heavily influenced by regulatory interactions and interactions with the surrounding environment. Synthetic biology is developing the tools and methods that will increase control over these interactions, eventually resulting in an integrative synthetic biology that will allow ground-up cellular optimization. In this review, we attempt to contextualize the areas of synthetic biology into three tiers: (1 the process units and associated streams of the central dogma, (2 the intrinsic regulatory mechanisms, and (3 the extrinsic physical and chemical environment. Efforts at each of these three tiers attempt to control cellular systems and take advantage of emerging tools and approaches. Ultimately, it will be possible to integrate these approaches and realize the vision of integrative synthetic biology when cells are completely rewired for biotechnological goals. This review will highlight progress towards this goal as well as areas requiring further research.

  4. Synthetic biology: tools to design, build, and optimize cellular processes.

    Science.gov (United States)

    Young, Eric; Alper, Hal

    2010-01-01

    The general central dogma frames the emergent properties of life, which make biology both necessary and difficult to engineer. In a process engineering paradigm, each biological process stream and process unit is heavily influenced by regulatory interactions and interactions with the surrounding environment. Synthetic biology is developing the tools and methods that will increase control over these interactions, eventually resulting in an integrative synthetic biology that will allow ground-up cellular optimization. In this review, we attempt to contextualize the areas of synthetic biology into three tiers: (1) the process units and associated streams of the central dogma, (2) the intrinsic regulatory mechanisms, and (3) the extrinsic physical and chemical environment. Efforts at each of these three tiers attempt to control cellular systems and take advantage of emerging tools and approaches. Ultimately, it will be possible to integrate these approaches and realize the vision of integrative synthetic biology when cells are completely rewired for biotechnological goals. This review will highlight progress towards this goal as well as areas requiring further research.

  5. Regulatory approaches for addressing dissolved oxygen concerns at hydropower facilities

    Energy Technology Data Exchange (ETDEWEB)

    Peterson, Mark J. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Cada, Glenn F. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sale, Michael J. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Eddlemon, Gerald K. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2003-03-01

    Low dissolved oxygen (DO) concentrations are a common water quality problem downstream of hydropower facilities. At some facilities, structural improvements (e.g. installation of weir dams or aerating turbines) or operational changes (e.g., spilling water over the dam) can be made to improve DO levels. In other cases, structural and operational approaches are too costly for the project to implement or are likely to be of limited effectiveness. Despite improvements in overall water quality below dams in recent years, many hydropower projects are unable to meet state water quality standards for DO. Regulatory agencies in the U.S. are considering or implementing dramatic changes in their approach to protecting the quality of the Nation’s waters. New policies and initiatives have emphasized flexibility, increased collaboration and shared responsibility among all parties, and market-based, economic incentives. The use of new regulatory approaches may now be a viable option for addressing the DO problem at some hydropower facilities. This report summarizes some of the regulatory-related options available to hydropower projects, including negotiation of site-specific water quality criteria, use of biological monitoring, watershed-based strategies for the management of water quality, and watershed-based trading. Key decision points center on the health of the local biological communities and whether there are contributing impacts (i.e., other sources of low DO effluents) in the watershed. If the biological communities downstream of the hydropower project are healthy, negotiation for site-specific water quality standards or biocriteria (discharge performance criteria based on characteristics of the aquatic biota) might be pursued. If there are other effluent dischargers in the watershed that contribute to low DO problems, watershed-scale strategies and effluent trading may be effective. This report examines the value of regulatory approaches by reviewing their use in

  6. Systems Biology of the Fluxome

    Directory of Open Access Journals (Sweden)

    Miguel A. Aon

    2015-07-01

    Full Text Available The advent of high throughput -omics has made the accumulation of comprehensive data sets possible, consisting of changes in genes, transcripts, proteins and metabolites. Systems biology-inspired computational methods for translating metabolomics data into fluxomics provide a direct functional, dynamic readout of metabolic networks. When combined with appropriate experimental design, these methods deliver insightful knowledge about cellular function under diverse conditions. The use of computational models accounting for detailed kinetics and regulatory mechanisms allow us to unravel the control and regulatory properties of the fluxome under steady and time-dependent behaviors. This approach extends the analysis of complex systems from description to prediction, including control of complex dynamic behavior ranging from biological rhythms to catastrophic lethal arrhythmias. The powerful quantitative metabolomics-fluxomics approach will help our ability to engineer unicellular and multicellular organisms evolve from trial-and-error to a more predictable process, and from cells to organ and organisms.

  7. Tracking of time-varying genomic regulatory networks with a LASSO-Kalman smoother

    OpenAIRE

    Khan, Jehandad; Bouaynaya, Nidhal; Fathallah-Shaykh, Hassan M

    2014-01-01

    It is widely accepted that cellular requirements and environmental conditions dictate the architecture of genetic regulatory networks. Nonetheless, the status quo in regulatory network modeling and analysis assumes an invariant network topology over time. In this paper, we refocus on a dynamic perspective of genetic networks, one that can uncover substantial topological changes in network structure during biological processes such as developmental growth. We propose a novel outlook on the inf...

  8. Genetic control of mammalian T-cell proliferation with synthetic RNA regulatory systems

    OpenAIRE

    Chen, Yvonne Y.; Jensen, Michael C.; Smolke, Christina D.

    2010-01-01

    RNA molecules perform diverse regulatory functions in natural biological systems, and numerous synthetic RNA-based control devices that integrate sensing and gene-regulatory functions have been demonstrated, predominantly in bacteria and yeast. Despite potential advantages of RNA-based genetic control strategies in clinical applications, there has been limited success in extending engineered RNA devices to mammalian gene-expression control and no example of their application to functional res...

  9. The future of yogurt: scientific and regulatory needs1234

    Science.gov (United States)

    German, J Bruce

    2014-01-01

    Lactation biology, microbial selection, and human diversity are central themes that could guide investment in scientific research, industrial innovation, and regulatory policy oversight to propel yogurt into the central role for health-promoting food products. The ability of yogurt to provide the nourishing properties of milk together with the live microorganisms from fermentation provides a unique combination of food assets. Academic research must now define the various targets on which these biological assets act to improve health and develop the metrics that can quantitatively document their benefits. The food industry must reconcile that yogurt and its microorganisms cannot be expected to provide measurable benefits for all consumers, at all doses, and at all times. A supportive regulatory oversight must demand safety and yet encourage innovations that support a value proposition for yogurt in health. Health valuation in the marketplace will be driven by parallel innovations, including accurate assessment technologies, validated microbial ingredients, and health-aware consumers. PMID:24695899

  10. Metabolic engineering of Bacillus subtilis fueled by systems biology: Recent advances and future directions.

    Science.gov (United States)

    Liu, Yanfeng; Li, Jianghua; Du, Guocheng; Chen, Jian; Liu, Long

    By combining advanced omics technology and computational modeling, systems biologists have identified and inferred thousands of regulatory events and system-wide interactions of the bacterium Bacillus subtilis, which is commonly used both in the laboratory and in industry. This dissection of the multiple layers of regulatory networks and their interactions has provided invaluable information for unraveling regulatory mechanisms and guiding metabolic engineering. In this review, we discuss recent advances in the systems biology and metabolic engineering of B. subtilis and highlight current gaps in our understanding of global metabolism and global pathway engineering in this organism. We also propose future perspectives in the systems biology of B. subtilis and suggest ways that this approach can be used to guide metabolic engineering. Specifically, although hundreds of regulatory events have been identified or inferred via systems biology approaches, systematic investigation of the functionality of these events in vivo has lagged, thereby preventing the elucidation of regulatory mechanisms and further rational pathway engineering. In metabolic engineering, ignoring the engineering of multilayer regulation hinders metabolic flux redistribution. Post-translational engineering, allosteric engineering, and dynamic pathway analyses and control will also contribute to the modulation and control of the metabolism of engineered B. subtilis, ultimately producing the desired cellular traits. We hope this review will aid metabolic engineers in making full use of available systems biology datasets and approaches for the design and perfection of microbial cell factories through global metabolism optimization. Copyright © 2016 Elsevier Inc. All rights reserved.

  11. Inference of Cancer-specific Gene Regulatory Networks Using Soft Computing Rules

    Directory of Open Access Journals (Sweden)

    Xiaosheng Wang

    2010-03-01

    Full Text Available Perturbations of gene regulatory networks are essentially responsible for oncogenesis. Therefore, inferring the gene regulatory networks is a key step to overcoming cancer. In this work, we propose a method for inferring directed gene regulatory networks based on soft computing rules, which can identify important cause-effect regulatory relations of gene expression. First, we identify important genes associated with a specific cancer (colon cancer using a supervised learning approach. Next, we reconstruct the gene regulatory networks by inferring the regulatory relations among the identified genes, and their regulated relations by other genes within the genome. We obtain two meaningful findings. One is that upregulated genes are regulated by more genes than downregulated ones, while downregulated genes regulate more genes than upregulated ones. The other one is that tumor suppressors suppress tumor activators and activate other tumor suppressors strongly, while tumor activators activate other tumor activators and suppress tumor suppressors weakly, indicating the robustness of biological systems. These findings provide valuable insights into the pathogenesis of cancer.

  12. How causal analysis can reveal autonomy in models of biological systems

    Science.gov (United States)

    Marshall, William; Kim, Hyunju; Walker, Sara I.; Tononi, Giulio; Albantakis, Larissa

    2017-11-01

    Standard techniques for studying biological systems largely focus on their dynamical or, more recently, their informational properties, usually taking either a reductionist or holistic perspective. Yet, studying only individual system elements or the dynamics of the system as a whole disregards the organizational structure of the system-whether there are subsets of elements with joint causes or effects, and whether the system is strongly integrated or composed of several loosely interacting components. Integrated information theory offers a theoretical framework to (1) investigate the compositional cause-effect structure of a system and to (2) identify causal borders of highly integrated elements comprising local maxima of intrinsic cause-effect power. Here we apply this comprehensive causal analysis to a Boolean network model of the fission yeast (Schizosaccharomyces pombe) cell cycle. We demonstrate that this biological model features a non-trivial causal architecture, whose discovery may provide insights about the real cell cycle that could not be gained from holistic or reductionist approaches. We also show how some specific properties of this underlying causal architecture relate to the biological notion of autonomy. Ultimately, we suggest that analysing the causal organization of a system, including key features like intrinsic control and stable causal borders, should prove relevant for distinguishing life from non-life, and thus could also illuminate the origin of life problem. This article is part of the themed issue 'Reconceptualizing the origins of life'.

  13. Genotet: An Interactive Web-based Visual Exploration Framework to Support Validation of Gene Regulatory Networks.

    Science.gov (United States)

    Yu, Bowen; Doraiswamy, Harish; Chen, Xi; Miraldi, Emily; Arrieta-Ortiz, Mario Luis; Hafemeister, Christoph; Madar, Aviv; Bonneau, Richard; Silva, Cláudio T

    2014-12-01

    Elucidation of transcriptional regulatory networks (TRNs) is a fundamental goal in biology, and one of the most important components of TRNs are transcription factors (TFs), proteins that specifically bind to gene promoter and enhancer regions to alter target gene expression patterns. Advances in genomic technologies as well as advances in computational biology have led to multiple large regulatory network models (directed networks) each with a large corpus of supporting data and gene-annotation. There are multiple possible biological motivations for exploring large regulatory network models, including: validating TF-target gene relationships, figuring out co-regulation patterns, and exploring the coordination of cell processes in response to changes in cell state or environment. Here we focus on queries aimed at validating regulatory network models, and on coordinating visualization of primary data and directed weighted gene regulatory networks. The large size of both the network models and the primary data can make such coordinated queries cumbersome with existing tools and, in particular, inhibits the sharing of results between collaborators. In this work, we develop and demonstrate a web-based framework for coordinating visualization and exploration of expression data (RNA-seq, microarray), network models and gene-binding data (ChIP-seq). Using specialized data structures and multiple coordinated views, we design an efficient querying model to support interactive analysis of the data. Finally, we show the effectiveness of our framework through case studies for the mouse immune system (a dataset focused on a subset of key cellular functions) and a model bacteria (a small genome with high data-completeness).

  14. Follow-on biologics: competition in the biopharmaceutical marketplace.

    Science.gov (United States)

    Devine, Joshua W; Cline, Richard R; Farley, Joel F

    2006-01-01

    To describe the implications of a follow-on biologic approval process with focus on current stakeholders, implications of the status quo, and recommendations for future policy. A search using Medline, International Pharmaceutical Abstracts, Med Ad News, F-D-C Reports/Pink Sheets, and Google index directories was conducted with terms such as biologic, biopharmaceutical, generic, and follow-on. Articles pertaining to the follow-on biologic debate. By the authors. Over the past decade, the biopharmaceutical market has experienced substantial growth in the number of product approvals and sales. In contrast with prescription medications, biologic agents currently lack an abbreviated regulatory approval process. Evidence from the Drug Price Competition and Patent Term Restoration Act of 1984 suggests that reducing barriers to generic competition in the pharmaceutical market successfully increases generic market penetration and reduces overall prices to consumers. Although scientific and regulatory dissimilarities between biopharmaceuticals and other medications exist, a follow-on biologic approval process has the potential to play an important role in containing growth in pharmaceutical spending. In addition to biopharmaceutical and generic biopharmaceutical manufacturers, stakeholders with a vested interest in this debate include individual consumers who continue to bear the burden of spending increases in the pharmaceutical market. The debate over a follow-on process likely will be difficult as parties seek a balance between incentives for biopharmaceutical innovation, consumer safety, and affordability of existing biologic products.

  15. Effective use of latent semantic indexing and computational linguistics in biological and biomedical applications.

    Science.gov (United States)

    Chen, Hongyu; Martin, Bronwen; Daimon, Caitlin M; Maudsley, Stuart

    2013-01-01

    Text mining is rapidly becoming an essential technique for the annotation and analysis of large biological data sets. Biomedical literature currently increases at a rate of several thousand papers per week, making automated information retrieval methods the only feasible method of managing this expanding corpus. With the increasing prevalence of open-access journals and constant growth of publicly-available repositories of biomedical literature, literature mining has become much more effective with respect to the extraction of biomedically-relevant data. In recent years, text mining of popular databases such as MEDLINE has evolved from basic term-searches to more sophisticated natural language processing techniques, indexing and retrieval methods, structural analysis and integration of literature with associated metadata. In this review, we will focus on Latent Semantic Indexing (LSI), a computational linguistics technique increasingly used for a variety of biological purposes. It is noted for its ability to consistently outperform benchmark Boolean text searches and co-occurrence models at information retrieval and its power to extract indirect relationships within a data set. LSI has been used successfully to formulate new hypotheses, generate novel connections from existing data, and validate empirical data.

  16. Predicting gene regulatory networks of soybean nodulation from RNA-Seq transcriptome data.

    Science.gov (United States)

    Zhu, Mingzhu; Dahmen, Jeremy L; Stacey, Gary; Cheng, Jianlin

    2013-09-22

    High-throughput RNA sequencing (RNA-Seq) is a revolutionary technique to study the transcriptome of a cell under various conditions at a systems level. Despite the wide application of RNA-Seq techniques to generate experimental data in the last few years, few computational methods are available to analyze this huge amount of transcription data. The computational methods for constructing gene regulatory networks from RNA-Seq expression data of hundreds or even thousands of genes are particularly lacking and urgently needed. We developed an automated bioinformatics method to predict gene regulatory networks from the quantitative expression values of differentially expressed genes based on RNA-Seq transcriptome data of a cell in different stages and conditions, integrating transcriptional, genomic and gene function data. We applied the method to the RNA-Seq transcriptome data generated for soybean root hair cells in three different development stages of nodulation after rhizobium infection. The method predicted a soybean nodulation-related gene regulatory network consisting of 10 regulatory modules common for all three stages, and 24, 49 and 70 modules separately for the first, second and third stage, each containing both a group of co-expressed genes and several transcription factors collaboratively controlling their expression under different conditions. 8 of 10 common regulatory modules were validated by at least two kinds of validations, such as independent DNA binding motif analysis, gene function enrichment test, and previous experimental data in the literature. We developed a computational method to reliably reconstruct gene regulatory networks from RNA-Seq transcriptome data. The method can generate valuable hypotheses for interpreting biological data and designing biological experiments such as ChIP-Seq, RNA interference, and yeast two hybrid experiments.

  17. A flood-based information flow analysis and network minimization method for gene regulatory networks.

    Science.gov (United States)

    Pavlogiannis, Andreas; Mozhayskiy, Vadim; Tagkopoulos, Ilias

    2013-04-24

    Biological networks tend to have high interconnectivity, complex topologies and multiple types of interactions. This renders difficult the identification of sub-networks that are involved in condition- specific responses. In addition, we generally lack scalable methods that can reveal the information flow in gene regulatory and biochemical pathways. Doing so will help us to identify key participants and paths under specific environmental and cellular context. This paper introduces the theory of network flooding, which aims to address the problem of network minimization and regulatory information flow in gene regulatory networks. Given a regulatory biological network, a set of source (input) nodes and optionally a set of sink (output) nodes, our task is to find (a) the minimal sub-network that encodes the regulatory program involving all input and output nodes and (b) the information flow from the source to the sink nodes of the network. Here, we describe a novel, scalable, network traversal algorithm and we assess its potential to achieve significant network size reduction in both synthetic and E. coli networks. Scalability and sensitivity analysis show that the proposed method scales well with the size of the network, and is robust to noise and missing data. The method of network flooding proves to be a useful, practical approach towards information flow analysis in gene regulatory networks. Further extension of the proposed theory has the potential to lead in a unifying framework for the simultaneous network minimization and information flow analysis across various "omics" levels.

  18. Large-scale modeling of condition-specific gene regulatory networks by information integration and inference.

    Science.gov (United States)

    Ellwanger, Daniel Christian; Leonhardt, Jörn Florian; Mewes, Hans-Werner

    2014-12-01

    Understanding how regulatory networks globally coordinate the response of a cell to changing conditions, such as perturbations by shifting environments, is an elementary challenge in systems biology which has yet to be met. Genome-wide gene expression measurements are high dimensional as these are reflecting the condition-specific interplay of thousands of cellular components. The integration of prior biological knowledge into the modeling process of systems-wide gene regulation enables the large-scale interpretation of gene expression signals in the context of known regulatory relations. We developed COGERE (http://mips.helmholtz-muenchen.de/cogere), a method for the inference of condition-specific gene regulatory networks in human and mouse. We integrated existing knowledge of regulatory interactions from multiple sources to a comprehensive model of prior information. COGERE infers condition-specific regulation by evaluating the mutual dependency between regulator (transcription factor or miRNA) and target gene expression using prior information. This dependency is scored by the non-parametric, nonlinear correlation coefficient η(2) (eta squared) that is derived by a two-way analysis of variance. We show that COGERE significantly outperforms alternative methods in predicting condition-specific gene regulatory networks on simulated data sets. Furthermore, by inferring the cancer-specific gene regulatory network from the NCI-60 expression study, we demonstrate the utility of COGERE to promote hypothesis-driven clinical research. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

  19. Transcriptional Regulatory Network Analysis of MYB Transcription Factor Family Genes in Rice

    Directory of Open Access Journals (Sweden)

    Shuchi eSmita

    2015-12-01

    Full Text Available MYB transcription factor (TF is one of the largest TF families and regulates defense responses to various stresses, hormone signaling as well as many metabolic and developmental processes in plants. Understanding these regulatory hierarchies of gene expression networks in response to developmental and environmental cues is a major challenge due to the complex interactions between the genetic elements. Correlation analyses are useful to unravel co-regulated gene pairs governing biological process as well as identification of new candidate hub genes in response to these complex processes. High throughput expression profiling data are highly useful for construction of co-expression networks. In the present study, we utilized transcriptome data for comprehensive regulatory network studies of MYB TFs by top down and guide gene approaches. More than 50% of OsMYBs were strongly correlated under fifty experimental conditions with 51 hub genes via top down approach. Further, clusters were identified using Markov Clustering (MCL. To maximize the clustering performance, parameter evaluation of the MCL inflation score (I was performed in terms of enriched GO categories by measuring F-score. Comparison of co-expressed cluster and clads analyzed from phylogenetic analysis signifies their evolutionarily conserved co-regulatory role. We utilized compendium of known interaction and biological role with Gene Ontology enrichment analysis to hypothesize function of coexpressed OsMYBs. In the other part, the transcriptional regulatory network analysis by guide gene approach revealed 40 putative targets of 26 OsMYB TF hubs with high correlation value utilizing 815 microarray data. The putative targets with MYB-binding cis-elements enrichment in their promoter region, functional co-occurrence as well as nuclear localization supports our finding. Specially, enrichment of MYB binding regions involved in drought-inducibility implying their regulatory role in drought

  20. Inferring the conservative causal core of gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Emmert-Streib Frank

    2010-09-01

    Full Text Available Abstract Background Inferring gene regulatory networks from large-scale expression data is an important problem that received much attention in recent years. These networks have the potential to gain insights into causal molecular interactions of biological processes. Hence, from a methodological point of view, reliable estimation methods based on observational data are needed to approach this problem practically. Results In this paper, we introduce a novel gene regulatory network inference (GRNI algorithm, called C3NET. We compare C3NET with four well known methods, ARACNE, CLR, MRNET and RN, conducting in-depth numerical ensemble simulations and demonstrate also for biological expression data from E. coli that C3NET performs consistently better than the best known GRNI methods in the literature. In addition, it has also a low computational complexity. Since C3NET is based on estimates of mutual information values in conjunction with a maximization step, our numerical investigations demonstrate that our inference algorithm exploits causal structural information in the data efficiently. Conclusions For systems biology to succeed in the long run, it is of crucial importance to establish methods that extract large-scale gene networks from high-throughput data that reflect the underlying causal interactions among genes or gene products. Our method can contribute to this endeavor by demonstrating that an inference algorithm with a neat design permits not only a more intuitive and possibly biological interpretation of its working mechanism but can also result in superior results.

  1. Inferring the conservative causal core of gene regulatory networks.

    Science.gov (United States)

    Altay, Gökmen; Emmert-Streib, Frank

    2010-09-28

    Inferring gene regulatory networks from large-scale expression data is an important problem that received much attention in recent years. These networks have the potential to gain insights into causal molecular interactions of biological processes. Hence, from a methodological point of view, reliable estimation methods based on observational data are needed to approach this problem practically. In this paper, we introduce a novel gene regulatory network inference (GRNI) algorithm, called C3NET. We compare C3NET with four well known methods, ARACNE, CLR, MRNET and RN, conducting in-depth numerical ensemble simulations and demonstrate also for biological expression data from E. coli that C3NET performs consistently better than the best known GRNI methods in the literature. In addition, it has also a low computational complexity. Since C3NET is based on estimates of mutual information values in conjunction with a maximization step, our numerical investigations demonstrate that our inference algorithm exploits causal structural information in the data efficiently. For systems biology to succeed in the long run, it is of crucial importance to establish methods that extract large-scale gene networks from high-throughput data that reflect the underlying causal interactions among genes or gene products. Our method can contribute to this endeavor by demonstrating that an inference algorithm with a neat design permits not only a more intuitive and possibly biological interpretation of its working mechanism but can also result in superior results.

  2. Systems Biology Approach to the Dissection of the Complexity of Regulatory Networks in the S. scrofa Cardiocirculatory System

    Directory of Open Access Journals (Sweden)

    Paolo Martini

    2013-11-01

    Full Text Available Genome-wide experiments are routinely used to increase the understanding of the biological processes involved in the development and maintenance of a variety of pathologies. Although the technical feasibility of this type of experiment has improved in recent years, data analysis remains challenging. In this context, gene set analysis has emerged as a fundamental tool for the interpretation of the results. Here, we review strategies used in the gene set approach, and using datasets for the pig cardiocirculatory system as a case study, we demonstrate how the use of a combination of these strategies can enhance the interpretation of results. Gene set analyses are able to distinguish vessels from the heart and arteries from veins in a manner that is consistent with the different cellular composition of smooth muscle cells. By integrating microRNA elements in the regulatory circuits identified, we find that vessel specificity is maintained through specific miRNAs, such as miR-133a and miR-143, which show anti-correlated expression with their mRNA targets.

  3. Sparsity in Model Gene Regulatory Networks

    International Nuclear Information System (INIS)

    Zagorski, M.

    2011-01-01

    We propose a gene regulatory network model which incorporates the microscopic interactions between genes and transcription factors. In particular the gene's expression level is determined by deterministic synchronous dynamics with contribution from excitatory interactions. We study the structure of networks that have a particular '' function '' and are subject to the natural selection pressure. The question of network robustness against point mutations is addressed, and we conclude that only a small part of connections defined as '' essential '' for cell's existence is fragile. Additionally, the obtained networks are sparse with narrow in-degree and broad out-degree, properties well known from experimental study of biological regulatory networks. Furthermore, during sampling procedure we observe that significantly different genotypes can emerge under mutation-selection balance. All the preceding features hold for the model parameters which lay in the experimentally relevant range. (author)

  4. Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.

    Science.gov (United States)

    Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S

    2011-02-01

    The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.

  5. Trichomes: different regulatory networks lead to convergent structures.

    Science.gov (United States)

    Serna, Laura; Martin, Cathie

    2006-06-01

    Sometimes, proteins, biological structures or even organisms have similar functions and appearances but have evolved through widely divergent pathways. There is experimental evidence to suggest that different developmental pathways have converged to produce similar outgrowths of the aerial plant epidermis, referred to as trichomes. The emerging picture suggests that trichomes in Arabidopsis thaliana and, perhaps, in cotton develop through a transcriptional regulatory network that differs from those regulating trichome formation in Antirrhinum and Solanaceous species. Several lines of evidence suggest that the duplication of a gene controlling anthocyanin production and subsequent divergence might be the major force driving trichome formation in Arabidopsis, whereas the multicellular trichomes of Antirrhinum and Solanaceous species appear to have a different regulatory origin.

  6. The Regulatory Evaluation of Vaccines for Human Use.

    Science.gov (United States)

    Baylor, Norman W

    2016-01-01

    A vaccine is an immunogen, the administration of which is intended to stimulate the immune system to result in the prevention, amelioration, or therapy of any disease or infection (US Food and Drug Administration. Guidance for Industry: content and format of chemistry, manufacturing, and controls information and establishment description information for a vaccine or related product). A vaccine may be a live attenuated preparation of microorganisms, inactivated (killed) whole organisms, living irradiated cells, crude fractions, or purified immunogens, including those derived from recombinant DNA in a host cell, conjugates formed by covalent linkage of components, synthetic antigens, polynucleotides (such as the plasmid DNA vaccines), living vectored cells expressing specific heterologous immunogens, or cells pulsed with immunogen. Vaccines are highly complex products that differ from small molecule drugs because of the biological nature of the source materials such as those derived from microorganisms as well as the various cell substrates from which some are derived. Regardless of the technology used, because of their complexities, vaccines must undergo extensive characterization and testing. Special expertise and procedures are needed for their manufacture, control, and regulation. The Food and Drug Administration (FDA) is the National Regulatory Authority (NRA) in the United States responsible for assuring quality, safety, and effectiveness of all human medical products, including vaccines for human use.The Center for Biologics Evaluation and Research (CBER) within the US FDA is responsible for overseeing the regulation of therapeutic and preventative vaccines against infectious diseases. Authority for the regulation of vaccines resides in Section 351 of the Public Health Service Act and specific sections of the Federal Food, Drug, and Cosmetic Act (FD&C). Vaccines are regulated as biologics and licensed based on the demonstration of safety and effectiveness. The

  7. As to achieve regulatory action, regulatory approaches

    International Nuclear Information System (INIS)

    Cid, R.; Encinas, D.

    2014-01-01

    The achievement of the effectiveness in the performance of a nuclear regulatory body has been a permanent challenge in the recent history of nuclear regulation. In the post-Fukushima era this challenge is even more important. This article addresses the subject from two complementary points of view: the characteristics of an effective regulatory body and the regulatory approaches. This work is based on the most recent studies carried out by the Committee on Nuclear Regulatory Activities, CNRA (OECD/NEA), as well as on the experience of the Consejo de Seguridad Nuclear, CSN, the Spanish regulatory body. Rafael Cid is the representative of CSN in these project: Diego Encinas has participated in the study on regulatory approaches. (Author)

  8. ChIP-Seq-Annotated Heliconius erato Genome Highlights Patterns of cis-Regulatory Evolution in Lepidoptera

    Directory of Open Access Journals (Sweden)

    James J. Lewis

    2016-09-01

    Full Text Available Uncovering phylogenetic patterns of cis-regulatory evolution remains a fundamental goal for evolutionary and developmental biology. Here, we characterize the evolution of regulatory loci in butterflies and moths using chromatin immunoprecipitation sequencing (ChIP-seq annotation of regulatory elements across three stages of head development. In the process we provide a high-quality, functionally annotated genome assembly for the butterfly, Heliconius erato. Comparing cis-regulatory element conservation across six lepidopteran genomes, we find that regulatory sequences evolve at a pace similar to that of protein-coding regions. We also observe that elements active at multiple developmental stages are markedly more conserved than elements with stage-specific activity. Surprisingly, we also find that stage-specific proximal and distal regulatory elements evolve at nearly identical rates. Our study provides a benchmark for genome-wide patterns of regulatory element evolution in insects, and it shows that developmental timing of activity strongly predicts patterns of regulatory sequence evolution.

  9. The boolean algebra with restricted variables as a tool for fault tree modularization

    International Nuclear Information System (INIS)

    Caldarola, L.; Wickenhaeuser, A.

    1981-08-01

    The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de

  10. Understanding Federal regulations as guidelines for classical biological control programs

    Science.gov (United States)

    Michael E. Montgomery

    2011-01-01

    This chapter reviews the legislation and rules that provide the foundation for federal regulation of the introduction of natural enemies of insects as biological control agents. It also outlines the steps for complying with regulatory requirements, using biological control of Adelges tsugae Annand, the hemlock woolly adelgid (HWA), as an example. The...

  11. Finding gene regulatory network candidates using the gene expression knowledge base.

    Science.gov (United States)

    Venkatesan, Aravind; Tripathi, Sushil; Sanz de Galdeano, Alejandro; Blondé, Ward; Lægreid, Astrid; Mironov, Vladimir; Kuiper, Martin

    2014-12-10

    Network-based approaches for the analysis of large-scale genomics data have become well established. Biological networks provide a knowledge scaffold against which the patterns and dynamics of 'omics' data can be interpreted. The background information required for the construction of such networks is often dispersed across a multitude of knowledge bases in a variety of formats. The seamless integration of this information is one of the main challenges in bioinformatics. The Semantic Web offers powerful technologies for the assembly of integrated knowledge bases that are computationally comprehensible, thereby providing a potentially powerful resource for constructing biological networks and network-based analysis. We have developed the Gene eXpression Knowledge Base (GeXKB), a semantic web technology based resource that contains integrated knowledge about gene expression regulation. To affirm the utility of GeXKB we demonstrate how this resource can be exploited for the identification of candidate regulatory network proteins. We present four use cases that were designed from a biological perspective in order to find candidate members relevant for the gastrin hormone signaling network model. We show how a combination of specific query definitions and additional selection criteria derived from gene expression data and prior knowledge concerning candidate proteins can be used to retrieve a set of proteins that constitute valid candidates for regulatory network extensions. Semantic web technologies provide the means for processing and integrating various heterogeneous information sources. The GeXKB offers biologists such an integrated knowledge resource, allowing them to address complex biological questions pertaining to gene expression. This work illustrates how GeXKB can be used in combination with gene expression results and literature information to identify new potential candidates that may be considered for extending a gene regulatory network.

  12. Conserved Transcriptional Regulatory Programs Underlying Rice and Barley Germination

    Science.gov (United States)

    Lin, Li; Tian, Shulan; Kaeppler, Shawn; Liu, Zongrang; An, Yong-Qiang (Charles)

    2014-01-01

    Germination is a biological process important to plant development and agricultural production. Barley and rice diverged 50 million years ago, but share a similar germination process. To gain insight into the conservation of their underlying gene regulatory programs, we compared transcriptomes of barley and rice at start, middle and end points of germination, and revealed that germination regulated barley and rice genes (BRs) diverged significantly in expression patterns and/or protein sequences. However, BRs with higher protein sequence similarity tended to have more conserved expression patterns. We identified and characterized 316 sets of conserved barley and rice genes (cBRs) with high similarity in both protein sequences and expression patterns, and provided a comprehensive depiction of the transcriptional regulatory program conserved in barley and rice germination at gene, pathway and systems levels. The cBRs encoded proteins involved in a variety of biological pathways and had a wide range of expression patterns. The cBRs encoding key regulatory components in signaling pathways often had diverse expression patterns. Early germination up-regulation of cell wall metabolic pathway and peroxidases, and late germination up-regulation of chromatin structure and remodeling pathways were conserved in both barley and rice. Protein sequence and expression pattern of a gene change quickly if it is not subjected to a functional constraint. Preserving germination-regulated expression patterns and protein sequences of those cBRs for 50 million years strongly suggests that the cBRs are functionally significant and equivalent in germination, and contribute to the ancient characteristics of germination preserved in barley and rice. The functional significance and equivalence of the cBR genes predicted here can serve as a foundation to further characterize their biological functions and facilitate bridging rice and barley germination research with greater confidence. PMID

  13. RNA-ID, a Powerful Tool for Identifying and Characterizing Regulatory Sequences.

    Science.gov (United States)

    Brule, C E; Dean, K M; Grayhack, E J

    2016-01-01

    The identification and analysis of sequences that regulate gene expression is critical because regulated gene expression underlies biology. RNA-ID is an efficient and sensitive method to discover and investigate regulatory sequences in the yeast Saccharomyces cerevisiae, using fluorescence-based assays to detect green fluorescent protein (GFP) relative to a red fluorescent protein (RFP) control in individual cells. Putative regulatory sequences can be inserted either in-frame or upstream of a superfolder GFP fusion protein whose expression, like that of RFP, is driven by the bidirectional GAL1,10 promoter. In this chapter, we describe the methodology to identify and study cis-regulatory sequences in the RNA-ID system, explaining features and variations of the RNA-ID reporter, as well as some applications of this system. We describe in detail the methods to analyze a single regulatory sequence, from construction of a single GFP variant to assay of variants by flow cytometry, as well as modifications required to screen libraries of different strains simultaneously. We also describe subsequent analyses of regulatory sequences. © 2016 Elsevier Inc. All rights reserved.

  14. The logic of the floral transition: Reverse-engineering the switch controlling the identity of lateral organs.

    Directory of Open Access Journals (Sweden)

    Jean-Louis Dinh

    2017-09-01

    Full Text Available Much laboratory work has been carried out to determine the gene regulatory network (GRN that results in plant cells becoming flowers instead of leaves. However, this also involves the spatial distribution of different cell types, and poses the question of whether alternative networks could produce the same set of observed results. This issue has been addressed here through a survey of the published intercellular distribution of expressed regulatory genes and techniques both developed and applied to Boolean network models. This has uncovered a large number of models which are compatible with the currently available data. An exhaustive exploration had some success but proved to be unfeasible due to the massive number of alternative models, so genetic programming algorithms have also been employed. This approach allows exploration on the basis of both data-fitting criteria and parsimony of the regulatory processes, ruling out biologically unrealistic mechanisms. One of the conclusions is that, despite the multiplicity of acceptable models, an overall structure dominates, with differences mostly in alternative fine-grained regulatory interactions. The overall structure confirms the known interactions, including some that were not present in the training set, showing that current data are sufficient to determine the overall structure of the GRN. The model stresses the importance of relative spatial location, through explicit references to this aspect. This approach also provides a quantitative indication of how likely some regulatory interactions might be, and can be applied to the study of other developmental transitions.

  15. The logic of the floral transition: Reverse-engineering the switch controlling the identity of lateral organs.

    Science.gov (United States)

    Dinh, Jean-Louis; Farcot, Etienne; Hodgman, Charlie

    2017-09-01

    Much laboratory work has been carried out to determine the gene regulatory network (GRN) that results in plant cells becoming flowers instead of leaves. However, this also involves the spatial distribution of different cell types, and poses the question of whether alternative networks could produce the same set of observed results. This issue has been addressed here through a survey of the published intercellular distribution of expressed regulatory genes and techniques both developed and applied to Boolean network models. This has uncovered a large number of models which are compatible with the currently available data. An exhaustive exploration had some success but proved to be unfeasible due to the massive number of alternative models, so genetic programming algorithms have also been employed. This approach allows exploration on the basis of both data-fitting criteria and parsimony of the regulatory processes, ruling out biologically unrealistic mechanisms. One of the conclusions is that, despite the multiplicity of acceptable models, an overall structure dominates, with differences mostly in alternative fine-grained regulatory interactions. The overall structure confirms the known interactions, including some that were not present in the training set, showing that current data are sufficient to determine the overall structure of the GRN. The model stresses the importance of relative spatial location, through explicit references to this aspect. This approach also provides a quantitative indication of how likely some regulatory interactions might be, and can be applied to the study of other developmental transitions.

  16. Technical Memory 2010. Nuclear Regulatory Authority

    International Nuclear Information System (INIS)

    2010-01-01

    The technical memory 2010 of the Nuclear Regulatory Authority of Argentine Republic, compile the papers published in the subject on radiation protection and nuclear safety presented in journals, technical reports, congress or meetings of these subjects by the ARN personnel during 2010. In this edition the documents are presented on: environmental protection; safety transport of radioactive materials; regulations; licensing of medical installations; biological radiation effects; therapeutic uses of ionizing radiation and radioprotection of patients; internal dosimetry; radioactive waste management [es

  17. Technical Memory 2011. Nuclear Regulatory Authority

    International Nuclear Information System (INIS)

    2011-01-01

    The technical memory 2011 of the Nuclear Regulatory Authority of Argentine Republic, compile the papers published in the subject on radiation protection and nuclear safety presented in journals, technical reports, congress or meetings of these subjects by the ARN personnel during 2011. In this edition the documents are presented on: environmental protection; safety transport of radioactive materials; regulations; licensing of medical installations; biological radiation effects; therapeutic uses of ionizing radiation and radioprotection of patients; internal dosimetry; radioactive waste management [es

  18. Collaborative international research: ethical and regulatory issues pertaining to human biological materials at a South African institutional research ethics committee.

    Science.gov (United States)

    Sathar, Aslam; Dhai, Amaboo; van der Linde, Stephan

    2014-12-01

    Human Biological Materials (HBMs) are an invaluable resource in biomedical research. To determine if researchers and a Research Ethics Committee (REC) at a South African institution addressed ethical issues pertaining to HBMs in collaborative research with developed countries. Ethically approved retrospective cross-sectional descriptive audit. Of the 1305 protocols audited, 151 (11.57%) fulfilled the study's inclusion criteria. Compared to other developed countries, a majority of sponsors (90) were from the USA (p = 0.0001). The principle investigators (PIs) in all 151 protocols informed the REC of their intent to store HBMs. Only 132 protocols informed research participants (P ethical and regulatory issues pertaining to HBMs. There was a lack of congruence between the ethical guidelines of developed countries and their actions which are central to the access to HBMs in collaborative research. HBMs may be leaving South Africa without EPs and MTAs during the process of international collaborative research. © 2013 John Wiley & Sons Ltd.

  19. Identification of miRNA-mRNA regulatory modules by exploring collective group relationships.

    Science.gov (United States)

    Masud Karim, S M; Liu, Lin; Le, Thuc Duy; Li, Jiuyong

    2016-01-11

    microRNAs (miRNAs) play an essential role in the post-transcriptional gene regulation in plants and animals. They regulate a wide range of biological processes by targeting messenger RNAs (mRNAs). Evidence suggests that miRNAs and mRNAs interact collectively in gene regulatory networks. The collective relationships between groups of miRNAs and groups of mRNAs may be more readily interpreted than those between individual miRNAs and mRNAs, and thus are useful for gaining insight into gene regulation and cell functions. Several computational approaches have been developed to discover miRNA-mRNA regulatory modules (MMRMs) with a common aim to elucidate miRNA-mRNA regulatory relationships. However, most existing methods do not consider the collective relationships between a group of miRNAs and the group of targeted mRNAs in the process of discovering MMRMs. Our aim is to develop a framework to discover MMRMs and reveal miRNA-mRNA regulatory relationships from the heterogeneous expression data based on the collective relationships. We propose DIscovering COllective group RElationships (DICORE), an effective computational framework for revealing miRNA-mRNA regulatory relationships. We utilize the notation of collective group relationships to build the computational framework. The method computes the collaboration scores of the miRNAs and mRNAs on the basis of their interactions with mRNAs and miRNAs, respectively. Then it determines the groups of miRNAs and groups of mRNAs separately based on their respective collaboration scores. Next, it calculates the strength of the collective relationship between each pair of miRNA group and mRNA group using canonical correlation analysis, and the group pairs with significant canonical correlations are considered as the MMRMs. We applied this method to three gene expression datasets, and validated the computational discoveries. Analysis of the results demonstrates that a large portion of the regulatory relationships discovered by

  20. Complexity of generic biochemical circuits: topology versus strength of interactions

    Science.gov (United States)

    Tikhonov, Mikhail; Bialek, William

    2016-12-01

    The historical focus on network topology as a determinant of biological function is still largely maintained today, illustrated by the rise of structure-only approaches to network analysis. However, biochemical circuits and genetic regulatory networks are defined both by their topology and by a multitude of continuously adjustable parameters, such as the strength of interactions between nodes, also recognized as important. Here we present a class of simple perceptron-based Boolean models within which comparing the relative importance of topology versus interaction strengths becomes a quantitatively well-posed problem. We quantify the intuition that for generic networks, optimization of interaction strengths is a crucial ingredient of achieving high complexity, defined here as the number of fixed points the network can accommodate. We propose a new methodology for characterizing the relative role of parameter optimization for topologies of a given class.

  1. Efficient Reverse-Engineering of a Developmental Gene Regulatory Network

    Science.gov (United States)

    Cicin-Sain, Damjan; Ashyraliyev, Maksat; Jaeger, Johannes

    2012-01-01

    Understanding the complex regulatory networks underlying development and evolution of multi-cellular organisms is a major problem in biology. Computational models can be used as tools to extract the regulatory structure and dynamics of such networks from gene expression data. This approach is called reverse engineering. It has been successfully applied to many gene networks in various biological systems. However, to reconstitute the structure and non-linear dynamics of a developmental gene network in its spatial context remains a considerable challenge. Here, we address this challenge using a case study: the gap gene network involved in segment determination during early development of Drosophila melanogaster. A major problem for reverse-engineering pattern-forming networks is the significant amount of time and effort required to acquire and quantify spatial gene expression data. We have developed a simplified data processing pipeline that considerably increases the throughput of the method, but results in data of reduced accuracy compared to those previously used for gap gene network inference. We demonstrate that we can infer the correct network structure using our reduced data set, and investigate minimal data requirements for successful reverse engineering. Our results show that timing and position of expression domain boundaries are the crucial features for determining regulatory network structure from data, while it is less important to precisely measure expression levels. Based on this, we define minimal data requirements for gap gene network inference. Our results demonstrate the feasibility of reverse-engineering with much reduced experimental effort. This enables more widespread use of the method in different developmental contexts and organisms. Such systematic application of data-driven models to real-world networks has enormous potential. Only the quantitative investigation of a large number of developmental gene regulatory networks will allow us to

  2. Understanding Biological Regulation Through Synthetic Biology.

    Science.gov (United States)

    Bashor, Caleb J; Collins, James J

    2018-03-16

    Engineering synthetic gene regulatory circuits proceeds through iterative cycles of design, building, and testing. Initial circuit designs must rely on often-incomplete models of regulation established by fields of reductive inquiry-biochemistry and molecular and systems biology. As differences in designed and experimentally observed circuit behavior are inevitably encountered, investigated, and resolved, each turn of the engineering cycle can force a resynthesis in understanding of natural network function. Here, we outline research that uses the process of gene circuit engineering to advance biological discovery. Synthetic gene circuit engineering research has not only refined our understanding of cellular regulation but furnished biologists with a toolkit that can be directed at natural systems to exact precision manipulation of network structure. As we discuss, using circuit engineering to predictively reorganize, rewire, and reconstruct cellular regulation serves as the ultimate means of testing and understanding how cellular phenotype emerges from systems-level network function. Expected final online publication date for the Annual Review of Biophysics Volume 47 is May 20, 2018. Please see http://www.annualreviews.org/page/journal/pubdates for revised estimates.

  3. Plant synthetic biology for molecular engineering of signalling and development.

    Science.gov (United States)

    Nemhauser, Jennifer L; Torii, Keiko U

    2016-03-02

    Molecular genetic studies of model plants in the past few decades have identified many key genes and pathways controlling development, metabolism and environmental responses. Recent technological and informatics advances have led to unprecedented volumes of data that may uncover underlying principles of plants as biological systems. The newly emerged discipline of synthetic biology and related molecular engineering approaches is built on this strong foundation. Today, plant regulatory pathways can be reconstituted in heterologous organisms to identify and manipulate parameters influencing signalling outputs. Moreover, regulatory circuits that include receptors, ligands, signal transduction components, epigenetic machinery and molecular motors can be engineered and introduced into plants to create novel traits in a predictive manner. Here, we provide a brief history of plant synthetic biology and significant recent examples of this approach, focusing on how knowledge generated by the reference plant Arabidopsis thaliana has contributed to the rapid rise of this new discipline, and discuss potential future directions.

  4. Solving a discrete model of the lac operon using Z3

    Science.gov (United States)

    Gutierrez, Natalia A.

    2014-05-01

    A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

  5. Reconstructing transcriptional regulatory networks through genomics data

    OpenAIRE

    Sun, Ning; Zhao, Hongyu

    2009-01-01

    One central problem in biology is to understand how gene expression is regulated under different conditions. Microarray gene expression data and other high throughput data have made it possible to dissect transcriptional regulatory networks at the genomics level. Owing to the very large number of genes that need to be studied, the relatively small number of data sets available, the noise in the data and the different natures of the distinct data types, network inference presents great challen...

  6. Regulatory Challenges for Cartilage Repair Technologies.

    Science.gov (United States)

    McGowan, Kevin B; Stiegman, Glenn

    2013-01-01

    In the United States, few Food and Drug Administration (FDA)-approved options exist for the treatment of focal cartilage and osteochondral lesions. Developers of products for cartilage repair face many challenges to obtain marketing approval from the FDA. The objective of this review is to discuss the necessary steps for FDA application and approval for a new cartilage repair product. FDA Guidance Documents, FDA Panel Meetings, scientific organization recommendations, and clinicaltrials.gov were reviewed to demonstrate the current thinking of FDA and the scientific community on the regulatory process for cartilage repair therapies. Cartilage repair therapies can receive market approval from FDA as medical devices, drugs, or biologics, and the specific classification of product can affect the nonclinical, clinical, and regulatory strategy to bring the product to market. Recent FDA guidance gives an outline of the required elements to bring a cartilage repair product to market, although these standards are often very general. As a result, companies have to carefully craft their study patient population, comparator group, and clinical endpoint to best showcase their product's attributes. In addition, regulatory strategy and manufacturing process validation need to be considered early in the clinical study process to allow for timely product approval following the completion of clinical study. Although the path to regulatory approval for a cartilage repair therapy is challenging and time-consuming, proper clinical trial planning and attention to the details can eventually save companies time and money by bringing a product to the market in the most expeditious process possible.

  7. Systems Biology and Stem Cell Pluripotency

    DEFF Research Database (Denmark)

    Mashayekhi, Kaveh; Hall, Vanessa Jane; Freude, Kristine

    2016-01-01

    Recent breakthroughs in stem cell biology have accelerated research in the area of regenerative medicine. Over the past years, it has become possible to derive patient-specific stem cells which can be used to generate different cell populations for potential cell therapy. Systems biological...... modeling of stem cell pluripotency and differentiation have largely been based on prior knowledge of signaling pathways, gene regulatory networks, and epigenetic factors. However, there is a great need to extend the complexity of the modeling and to integrate different types of data, which would further...... improve systems biology and its uses in the field. In this chapter, we first give a general background on stem cell biology and regenerative medicine. Stem cell potency is introduced together with the hierarchy of stem cells ranging from pluripotent embryonic stem cells (ESCs) and induced pluripotent stem...

  8. Assessment of regulatory effectiveness. Peer discussions on regulatory practices

    International Nuclear Information System (INIS)

    1999-09-01

    This report arises from the seventh series of peer discussions on regulatory practices entitled 'Assessment of Regulatory Effectiveness'. The term 'regulatory effectiveness' covers the quality of the work and level of performance of a regulatory body. In this sense, regulatory effectiveness applies to regulatory body activities aimed at preventing safety degradation and ensuring that an acceptable level of safety is being maintained by the regulated operating organizations. In addition, regulatory effectiveness encompasses the promotion of safety improvements, the timely and cost effective performance of regulatory functions in a manner which ensures the confidence of the operating organizations, the general public and the government, and striving for continuous improvements to performance. Senior regulators from 22 Member States participated in two peer group discussions during March and May 1999. The discussions were focused on the elements of an effective regulatory body, possible indicators of regulatory effectiveness and its assessment. This report presents the outcome of these meetings and recommendations of good practices identified by senior regulators, which do not necessarily reflect those of the governments of the nominating Member States, the organizations they belong to, or the International Atomic Energy Agency. In order to protect people and the environment from hazards associated with nuclear facilities, the main objective of a nuclear regulatory body is to ensure that a high level of safety in the nuclear activities under its jurisdiction is achieved, maintained and within the control of operating organizations. Even if it is possible to directly judge objective safety levels at nuclear facilities, such safety levels would not provide an exclusive indicator of regulatory effectiveness. The way the regulatory body ensures the safety of workers and the public and the way it discharges its responsibilities also determine its effectiveness. Hence the

  9. Piecing together cis-regulatory networks: insights from epigenomics studies in plants.

    Science.gov (United States)

    Huang, Shao-Shan C; Ecker, Joseph R

    2018-05-01

    5-Methylcytosine, a chemical modification of DNA, is a covalent modification found in the genomes of both plants and animals. Epigenetic inheritance of phenotypes mediated by DNA methylation is well established in plants. Most of the known mechanisms of establishing, maintaining and modifying DNA methylation have been worked out in the reference plant Arabidopsis thaliana. Major functions of DNA methylation in plants include regulation of gene expression and silencing of transposable elements (TEs) and repetitive sequences, both of which have parallels in mammalian biology, involve interaction with the transcriptional machinery, and may have profound effects on the regulatory networks in the cell. Methylome and transcriptome dynamics have been investigated in development and environmental responses in Arabidopsis and agriculturally and ecologically important plants, revealing the interdependent relationship among genomic context, methylation patterns, and expression of TE and protein coding genes. Analyses of methylome variation among plant natural populations and species have begun to quantify the extent of genetic control of methylome variation vs. true epimutation, and model the evolutionary forces driving methylome evolution in both short and long time scales. The ability of DNA methylation to positively or negatively modulate binding affinity of transcription factors (TFs) provides a natural link from genome sequence and methylation changes to transcription. Technologies that allow systematic determination of methylation sensitivities of TFs, in native genomic and methylation context without confounding factors such as histone modifications, will provide baseline datasets for building cell-type- and individual-specific regulatory networks that underlie the establishment and inheritance of complex traits. This article is categorized under: Laboratory Methods and Technologies > Genetic/Genomic Methods Biological Mechanisms > Regulatory Biology. © 2017 Wiley

  10. A dynamic genetic-hormonal regulatory network model explains multiple cellular behaviors of the root apical meristem of Arabidopsis thaliana.

    Science.gov (United States)

    García-Gómez, Mónica L; Azpeitia, Eugenio; Álvarez-Buylla, Elena R

    2017-04-01

    The study of the concerted action of hormones and transcription factors is fundamental to understand cell differentiation and pattern formation during organ development. The root apical meristem of Arabidopsis thaliana is a useful model to address this. It has a stem cell niche near its tip conformed of a quiescent organizer and stem or initial cells around it, then a proliferation domain followed by a transition domain, where cells diminish division rate before transiting to the elongation zone; here, cells grow anisotropically prior to their final differentiation towards the plant base. A minimal model of the gene regulatory network that underlies cell-fate specification and patterning at the root stem cell niche was proposed before. In this study, we update and couple such network with both the auxin and cytokinin hormone signaling pathways to address how they collectively give rise to attractors that correspond to the genetic and hormonal activity profiles that are characteristic of different cell types along A. thaliana root apical meristem. We used a Boolean model of the genetic-hormonal regulatory network to integrate known and predicted regulatory interactions into alternative models. Our analyses show that, after adding some putative missing interactions, the model includes the necessary and sufficient components and regulatory interactions to recover attractors characteristic of the root cell types, including the auxin and cytokinin activity profiles that correlate with different cellular behaviors along the root apical meristem. Furthermore, the model predicts the existence of activity configurations that could correspond to the transition domain. The model also provides a possible explanation for apparently paradoxical cellular behaviors in the root meristem. For example, how auxin may induce and at the same time inhibit WOX5 expression. According to the model proposed here the hormonal regulation of WOX5 might depend on the cell type. Our results

  11. A dynamic genetic-hormonal regulatory network model explains multiple cellular behaviors of the root apical meristem of Arabidopsis thaliana.

    Directory of Open Access Journals (Sweden)

    Mónica L García-Gómez

    2017-04-01

    Full Text Available The study of the concerted action of hormones and transcription factors is fundamental to understand cell differentiation and pattern formation during organ development. The root apical meristem of Arabidopsis thaliana is a useful model to address this. It has a stem cell niche near its tip conformed of a quiescent organizer and stem or initial cells around it, then a proliferation domain followed by a transition domain, where cells diminish division rate before transiting to the elongation zone; here, cells grow anisotropically prior to their final differentiation towards the plant base. A minimal model of the gene regulatory network that underlies cell-fate specification and patterning at the root stem cell niche was proposed before. In this study, we update and couple such network with both the auxin and cytokinin hormone signaling pathways to address how they collectively give rise to attractors that correspond to the genetic and hormonal activity profiles that are characteristic of different cell types along A. thaliana root apical meristem. We used a Boolean model of the genetic-hormonal regulatory network to integrate known and predicted regulatory interactions into alternative models. Our analyses show that, after adding some putative missing interactions, the model includes the necessary and sufficient components and regulatory interactions to recover attractors characteristic of the root cell types, including the auxin and cytokinin activity profiles that correlate with different cellular behaviors along the root apical meristem. Furthermore, the model predicts the existence of activity configurations that could correspond to the transition domain. The model also provides a possible explanation for apparently paradoxical cellular behaviors in the root meristem. For example, how auxin may induce and at the same time inhibit WOX5 expression. According to the model proposed here the hormonal regulation of WOX5 might depend on the cell

  12. Inference of gene regulatory networks from time series by Tsallis entropy

    Directory of Open Access Journals (Sweden)

    de Oliveira Evaldo A

    2011-05-01

    Full Text Available Abstract Background The inference of gene regulatory networks (GRNs from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information, a new criterion function is here proposed. Results In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5

  13. Technical Memory 2008. Nuclear Regulatory Authority

    International Nuclear Information System (INIS)

    2011-01-01

    The technical memory 2008 of the Nuclear Regulatory Authority of Argentine Republic, compile the papers published in the subject on radiation protection and nuclear safety, and presented in journals, technical reports, congress or meetings of these specialties by personnel of the mentioned institution during 2008. In this edition the documents are presented on: environmental protection; transport of radioactive materials; regulations; research reactors and nuclear power plants; biological radiation effects; therapeutic uses of ionizing radiation and radioprotection of patients; internal dosimetry; physical dosimetry; knowledge management; radioactive waste management. [es

  14. Intervention in gene regulatory networks with maximal phenotype alteration.

    Science.gov (United States)

    Yousefi, Mohammadmahdi R; Dougherty, Edward R

    2013-07-15

    A basic issue for translational genomics is to model gene interaction via gene regulatory networks (GRNs) and thereby provide an informatics environment to study the effects of intervention (say, via drugs) and to derive effective intervention strategies. Taking the view that the phenotype is characterized by the long-run behavior (steady-state distribution) of the network, we desire interventions to optimally move the probability mass from undesirable to desirable states Heretofore, two external control approaches have been taken to shift the steady-state mass of a GRN: (i) use a user-defined cost function for which desirable shift of the steady-state mass is a by-product and (ii) use heuristics to design a greedy algorithm. Neither approach provides an optimal control policy relative to long-run behavior. We use a linear programming approach to optimally shift the steady-state mass from undesirable to desirable states, i.e. optimization is directly based on the amount of shift and therefore must outperform previously proposed methods. Moreover, the same basic linear programming structure is used for both unconstrained and constrained optimization, where in the latter case, constraints on the optimization limit the amount of mass that may be shifted to 'ambiguous' states, these being states that are not directly undesirable relative to the pathology of interest but which bear some perceived risk. We apply the method to probabilistic Boolean networks, but the theory applies to any Markovian GRN. Supplementary materials, including the simulation results, MATLAB source code and description of suboptimal methods are available at http://gsp.tamu.edu/Publications/supplementary/yousefi13b. edward@ece.tamu.edu Supplementary data are available at Bioinformatics online.

  15. Peptidomics and processing of regulatory peptides in the fruit fly Drosophila

    Directory of Open Access Journals (Sweden)

    Dennis Pauls

    2014-06-01

    Full Text Available More than a decade has passed since the release of the Drosophila melanogaster genome and the first predictions of fruit fly regulatory peptides (neuropeptides and peptide hormones. Since then, mass spectrometry-based methods have fuelled the chemical characterisation of regulatory peptides, from 7 Drosophila peptides in the pre-genomic area to more than 60 today. We review the development of fruit fly peptidomics, and present a comprehensive list of the regulatory peptides that have been chemically characterised until today. We also summarise the knowledge on peptide processing in Drosophila, which has strongly profited from a combination of MS-based techniques and the genetic tools available for the fruit fly. This combination has a very high potential to study the functional biology of peptide signalling on all levels, especially with the ongoing developments in quantitative MS in Drosophila.

  16. Biosimilars for psoriasis: worldwide overview of regulatory guidelines, uptake and implications for dermatology clinical practice.

    Science.gov (United States)

    Cohen, A D; Wu, J J; Puig, L; Chimenti, S; Vender, R; Rajagopalan, M; Romiti, R; de la Cruz, C; Skov, L; Zachariae, C; Young, H S; Foley, P; van der Walt, J M; Naldi, L; Prens, E P; Blauvelt, A

    2017-12-01

    The introduction of biological drugs for the treatment of patients with psoriasis has revolutionized treatment paradigms and enabled numerous patients to achieve disease control with an acceptable safety profile. However, the high cost of biologics limits access to these medications for the majority of patients worldwide. In recent years, the introduction of biosimilars for inflammatory diseases has become a fast evolving field. The future use of biosimilars offers the potential for decreased cost and increased access to biologics for patients with psoriasis. For approval of biosimilars, different regulatory agencies use highly variable methods for definition, production, approval, marketing and postmarketing surveillance. Due to potential interchangeability between biologics and biosimilars, traceability and pharmacovigilance are required to collect accurate data about adverse events in patients with psoriasis; spontaneous reporting, registries and use of 'big data' should facilitate this process on a global basis. The current article describes biosimilar regulatory guidelines and examples of biosimilar uptake in clinical practice in several countries around the world. As it is apparent that biological therapy treatment decisions may become more physician independent, the International Psoriasis Council recommends that dermatologists should take an active role in the development of biosimilar prescribing policies with their respective healthcare settings and government agencies. © 2017 British Association of Dermatologists.

  17. Sequence-based model of gap gene regulatory network.

    Science.gov (United States)

    Kozlov, Konstantin; Gursky, Vitaly; Kulakovskiy, Ivan; Samsonova, Maria

    2014-01-01

    The detailed analysis of transcriptional regulation is crucially important for understanding biological processes. The gap gene network in Drosophila attracts large interest among researches studying mechanisms of transcriptional regulation. It implements the most upstream regulatory layer of the segmentation gene network. The knowledge of molecular mechanisms involved in gap gene regulation is far less complete than that of genetics of the system. Mathematical modeling goes beyond insights gained by genetics and molecular approaches. It allows us to reconstruct wild-type gene expression patterns in silico, infer underlying regulatory mechanism and prove its sufficiency. We developed a new model that provides a dynamical description of gap gene regulatory systems, using detailed DNA-based information, as well as spatial transcription factor concentration data at varying time points. We showed that this model correctly reproduces gap gene expression patterns in wild type embryos and is able to predict gap expression patterns in Kr mutants and four reporter constructs. We used four-fold cross validation test and fitting to random dataset to validate the model and proof its sufficiency in data description. The identifiability analysis showed that most model parameters are well identifiable. We reconstructed the gap gene network topology and studied the impact of individual transcription factor binding sites on the model output. We measured this impact by calculating the site regulatory weight as a normalized difference between the residual sum of squares error for the set of all annotated sites and for the set with the site of interest excluded. The reconstructed topology of the gap gene network is in agreement with previous modeling results and data from literature. We showed that 1) the regulatory weights of transcription factor binding sites show very weak correlation with their PWM score; 2) sites with low regulatory weight are important for the model output; 3

  18. Harnessing diversity towards the reconstructing of large scale gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Takeshi Hase

    Full Text Available Elucidating gene regulatory network (GRN from large scale experimental data remains a central challenge in systems biology. Recently, numerous techniques, particularly consensus driven approaches combining different algorithms, have become a potentially promising strategy to infer accurate GRNs. Here, we develop a novel consensus inference algorithm, TopkNet that can integrate multiple algorithms to infer GRNs. Comprehensive performance benchmarking on a cloud computing framework demonstrated that (i a simple strategy to combine many algorithms does not always lead to performance improvement compared to the cost of consensus and (ii TopkNet integrating only high-performance algorithms provide significant performance improvement compared to the best individual algorithms and community prediction. These results suggest that a priori determination of high-performance algorithms is a key to reconstruct an unknown regulatory network. Similarity among gene-expression datasets can be useful to determine potential optimal algorithms for reconstruction of unknown regulatory networks, i.e., if expression-data associated with known regulatory network is similar to that with unknown regulatory network, optimal algorithms determined for the known regulatory network can be repurposed to infer the unknown regulatory network. Based on this observation, we developed a quantitative measure of similarity among gene-expression datasets and demonstrated that, if similarity between the two expression datasets is high, TopkNet integrating algorithms that are optimal for known dataset perform well on the unknown dataset. The consensus framework, TopkNet, together with the similarity measure proposed in this study provides a powerful strategy towards harnessing the wisdom of the crowds in reconstruction of unknown regulatory networks.

  19. Information processing in the transcriptional regulatory network of yeast: Functional robustness

    Directory of Open Access Journals (Sweden)

    Dehmer Matthias

    2009-03-01

    Full Text Available Abstract Background Gene networks are considered to represent various aspects of molecular biological systems meaningfully because they naturally provide a systems perspective of molecular interactions. In this respect, the functional understanding of the transcriptional regulatory network is considered as key to elucidate the functional organization of an organism. Results In this paper we study the functional robustness of the transcriptional regulatory network of S. cerevisiae. We model the information processing in the network as a first order Markov chain and study the influence of single gene perturbations on the global, asymptotic communication among genes. Modification in the communication is measured by an information theoretic measure allowing to predict genes that are 'fragile' with respect to single gene knockouts. Our results demonstrate that the predicted set of fragile genes contains a statistically significant enrichment of so called essential genes that are experimentally found to be necessary to ensure vital yeast. Further, a structural analysis of the transcriptional regulatory network reveals that there are significant differences between fragile genes, hub genes and genes with a high betweenness centrality value. Conclusion Our study does not only demonstrate that a combination of graph theoretical, information theoretical and statistical methods leads to meaningful biological results but also that such methods allow to study information processing in gene networks instead of just their structural properties.

  20. INCLUSION RATIO BASED ESTIMATOR FOR THE MEAN LENGTH OF THE BOOLEAN LINE SEGMENT MODEL WITH AN APPLICATION TO NANOCRYSTALLINE CELLULOSE

    Directory of Open Access Journals (Sweden)

    Mikko Niilo-Rämä

    2014-06-01

    Full Text Available A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation of its variance is derived. The accuracies of the approximations are evaluated by means of simulation experiments. The novel method is compared to other methods and applied to real-world industrial data from nanocellulose crystalline.

  1. Regulatory cascade and biological activity of Beauveria bassiana oosporein that limits bacterial growth after host death.

    Science.gov (United States)

    Fan, Yanhua; Liu, Xi; Keyhani, Nemat O; Tang, Guirong; Pei, Yan; Zhang, Wenwen; Tong, Sheng

    2017-02-28

    The regulatory network and biological functions of the fungal secondary metabolite oosporein have remained obscure. Beauveria bassiana has evolved the ability to parasitize insects and outcompete microbial challengers for assimilation of host nutrients. A novel zinc finger transcription factor, BbSmr1 ( B. bassiana secondary metabolite regulator 1), was identified in a screen for oosporein overproduction. Deletion of Bbsmr1 resulted in up-regulation of the oosporein biosynthetic gene cluster ( OpS genes) and constitutive oosporein production. Oosporein production was abolished in double mutants of Bbsmr1 and a second transcription factor, OpS3 , within the oosporein gene cluster ( ΔBbsmr1ΔOpS3 ), indicating that BbSmr1 acts as a negative regulator of OpS3 expression. Real-time quantitative PCR and a GFP promoter fusion construct of OpS1 , the oosporein polyketide synthase, indicated that OpS1 is expressed mainly in insect cadavers at 24-48 h after death. Bacterial colony analysis in B. bassiana -infected insect hosts revealed increasing counts until host death, with a dramatic decrease (∼90%) after death that correlated with oosporein production. In vitro studies verified the inhibitory activity of oosporein against bacteria derived from insect cadavers. These results suggest that oosporein acts as an antimicrobial compound to limit microbial competition on B. bassiana -killed hosts, allowing the fungus to maximally use host nutrients to grow and sporulate on infected cadavers.

  2. ADAM: analysis of discrete models of biological systems using computer algebra.

    Science.gov (United States)

    Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

    2011-07-20

    Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web

  3. Modeling Dynamic Regulatory Processes in Stroke

    Science.gov (United States)

    McDermott, Jason E.; Jarman, Kenneth; Taylor, Ronald; Lancaster, Mary; Shankaran, Harish; Vartanian, Keri B.; Stevens, Susan L.; Stenzel-Poore, Mary P.; Sanfilippo, Antonio

    2012-01-01

    The ability to examine the behavior of biological systems in silico has the potential to greatly accelerate the pace of discovery in diseases, such as stroke, where in vivo analysis is time intensive and costly. In this paper we describe an approach for in silico examination of responses of the blood transcriptome to neuroprotective agents and subsequent stroke through the development of dynamic models of the regulatory processes observed in the experimental gene expression data. First, we identified functional gene clusters from these data. Next, we derived ordinary differential equations (ODEs) from the data relating these functional clusters to each other in terms of their regulatory influence on one another. Dynamic models were developed by coupling these ODEs into a model that simulates the expression of regulated functional clusters. By changing the magnitude of gene expression in the initial input state it was possible to assess the behavior of the networks through time under varying conditions since the dynamic model only requires an initial starting state, and does not require measurement of regulatory influences at each time point in order to make accurate predictions. We discuss the implications of our models on neuroprotection in stroke, explore the limitations of the approach, and report that an optimized dynamic model can provide accurate predictions of overall system behavior under several different neuroprotective paradigms. PMID:23071432

  4. Using hexamers to predict cis-regulatory motifs in Drosophila

    Directory of Open Access Journals (Sweden)

    Kibler Dennis

    2005-10-01

    Full Text Available Abstract Background Cis-regulatory modules (CRMs are short stretches of DNA that help regulate gene expression in higher eukaryotes. They have been found up to 1 megabase away from the genes they regulate and can be located upstream, downstream, and even within their target genes. Due to the difficulty of finding CRMs using biological and computational techniques, even well-studied regulatory systems may contain CRMs that have not yet been discovered. Results We present a simple, efficient method (HexDiff based only on hexamer frequencies of known CRMs and non-CRM sequence to predict novel CRMs in regulatory systems. On a data set of 16 gap and pair-rule genes containing 52 known CRMs, predictions made by HexDiff had a higher correlation with the known CRMs than several existing CRM prediction algorithms: Ahab, Cluster Buster, MSCAN, MCAST, and LWF. After combining the results of the different algorithms, 10 putative CRMs were identified and are strong candidates for future study. The hexamers used by HexDiff to distinguish between CRMs and non-CRM sequence were also analyzed and were shown to be enriched in regulatory elements. Conclusion HexDiff provides an efficient and effective means for finding new CRMs based on known CRMs, rather than known binding sites.

  5. An approach for reduction of false predictions in reverse engineering of gene regulatory networks.

    Science.gov (United States)

    Khan, Abhinandan; Saha, Goutam; Pal, Rajat Kumar

    2018-05-14

    A gene regulatory network discloses the regulatory interactions amongst genes, at a particular condition of the human body. The accurate reconstruction of such networks from time-series genetic expression data using computational tools offers a stiff challenge for contemporary computer scientists. This is crucial to facilitate the understanding of the proper functioning of a living organism. Unfortunately, the computational methods produce many false predictions along with the correct predictions, which is unwanted. Investigations in the domain focus on the identification of as many correct regulations as possible in the reverse engineering of gene regulatory networks to make it more reliable and biologically relevant. One way to achieve this is to reduce the number of incorrect predictions in the reconstructed networks. In the present investigation, we have proposed a novel scheme to decrease the number of false predictions by suitably combining several metaheuristic techniques. We have implemented the same using a dataset ensemble approach (i.e. combining multiple datasets) also. We have employed the proposed methodology on real-world experimental datasets of the SOS DNA Repair network of Escherichia coli and the IMRA network of Saccharomyces cerevisiae. Subsequently, we have experimented upon somewhat larger, in silico networks, namely, DREAM3 and DREAM4 Challenge networks, and 15-gene and 20-gene networks extracted from the GeneNetWeaver database. To study the effect of multiple datasets on the quality of the inferred networks, we have used four datasets in each experiment. The obtained results are encouraging enough as the proposed methodology can reduce the number of false predictions significantly, without using any supplementary prior biological information for larger gene regulatory networks. It is also observed that if a small amount of prior biological information is incorporated here, the results improve further w.r.t. the prediction of true positives

  6. Synthetic biology and occupational risk.

    Science.gov (United States)

    Howard, John; Murashov, Vladimir; Schulte, Paul

    2017-03-01

    Synthetic biology is an emerging interdisciplinary field of biotechnology that involves applying the principles of engineering and chemical design to biological systems. Biosafety professionals have done an excellent job in addressing research laboratory safety as synthetic biology and gene editing have emerged from the larger field of biotechnology. Despite these efforts, risks posed by synthetic biology are of increasing concern as research procedures scale up to industrial processes in the larger bioeconomy. A greater number and variety of workers will be exposed to commercial synthetic biology risks in the future, including risks to a variety of workers from the use of lentiviral vectors as gene transfer devices. There is a need to review and enhance current protection measures in the field of synthetic biology, whether in experimental laboratories where new advances are being researched, in health care settings where treatments using viral vectors as gene delivery systems are increasingly being used, or in the industrial bioeconomy. Enhanced worker protection measures should include increased injury and illness surveillance of the synthetic biology workforce; proactive risk assessment and management of synthetic biology products; research on the relative effectiveness of extrinsic and intrinsic biocontainment methods; specific safety guidance for synthetic biology industrial processes; determination of appropriate medical mitigation measures for lentiviral vector exposure incidents; and greater awareness and involvement in synthetic biology safety by the general occupational safety and health community as well as by government occupational safety and health research and regulatory agencies.

  7. Reconstruction of gene regulatory modules from RNA silencing of IFN-α modulators: experimental set-up and inference method.

    Science.gov (United States)

    Grassi, Angela; Di Camillo, Barbara; Ciccarese, Francesco; Agnusdei, Valentina; Zanovello, Paola; Amadori, Alberto; Finesso, Lorenzo; Indraccolo, Stefano; Toffolo, Gianna Maria

    2016-03-12

    Inference of gene regulation from expression data may help to unravel regulatory mechanisms involved in complex diseases or in the action of specific drugs. A challenging task for many researchers working in the field of systems biology is to build up an experiment with a limited budget and produce a dataset suitable to reconstruct putative regulatory modules worth of biological validation. Here, we focus on small-scale gene expression screens and we introduce a novel experimental set-up and a customized method of analysis to make inference on regulatory modules starting from genetic perturbation data, e.g. knockdown and overexpression data. To illustrate the utility of our strategy, it was applied to produce and analyze a dataset of quantitative real-time RT-PCR data, in which interferon-α (IFN-α) transcriptional response in endothelial cells is investigated by RNA silencing of two candidate IFN-α modulators, STAT1 and IFIH1. A putative regulatory module was reconstructed by our method, revealing an intriguing feed-forward loop, in which STAT1 regulates IFIH1 and they both negatively regulate IFNAR1. STAT1 regulation on IFNAR1 was object of experimental validation at the protein level. Detailed description of the experimental set-up and of the analysis procedure is reported, with the intent to be of inspiration for other scientists who want to realize similar experiments to reconstruct gene regulatory modules starting from perturbations of possible regulators. Application of our approach to the study of IFN-α transcriptional response modulators in endothelial cells has led to many interesting novel findings and new biological hypotheses worth of validation.

  8. Investigation of miRNA Biology by Bioinformatic Tools and Impact of miRNAs in Colorectal Cancer: Regulatory Relationship of c-Myc and p53 with miRNAs

    Directory of Open Access Journals (Sweden)

    Yaguang Xi

    2007-01-01

    Full Text Available MicroRNAs (miRNAs are a class of small non-coding RNAs that mediate gene expression at the posttranscriptional and translational levels and have been demonstrated to be involved in diverse biological functions. Mounting evidence in recent years has shown that miRNAs play key roles in tumorigenesis due to abnormal expression of and mutations in miRNAs. High throughput miRNA expression profiling of several major tumor types has identified miRNAs associated with clinical diagnosis and prognosis of cancer treatment. Previously our group has discovered a novel regulatory relationship between tumor suppressor gene p53 with miRNAs expression and a number of miRNA promoters contain putative p53 binding sites. In addition, others have reported that c-myc can mediate a large number of miRNAs expression. In this review, we will emphasize algorithms to identify mRNA targets of miRNAs and the roles of miRNAs in colorectal cancer. In particular, we will discuss a novel regulatory relationship of miRNAs with tumor suppressor p53 and c-myc. miRNAs are becoming promising novel targets and biomarkers for future cancer therapeutic development and clinical molecular diagnosis.

  9. Furfural and hydroxymethylfurfural tolerance in Escherichia coli ΔacrR regulatory mutants.

    Science.gov (United States)

    Luhe, Annette Lin; Lim, Chan Yuen; Gerken, Henri; Wu, Jinchuan; Zhao, Hua

    2015-01-01

    The presence of the highly toxic furfural and hydroxymethylfurfural (HMF) in the hydrolysate of lignocellulosic biomass prompted the investigation of the Escherichia coli ΔacrR regulatory mutant for higher tolerance to these compounds, to facilitate the production of biofuels and biochemicals, and further biocatalytic conversions. In comparison with the parental strain, the regulatory mutant with the upregulated efflux pump AcrAB-TolC produced moderately better growth and higher tolerance to concentrations of furfural and HMF between 1 and 2 g L(-1) . © 2014 International Union of Biochemistry and Molecular Biology, Inc.

  10. Feather development genes and associated regulatory innovation predate the origin of Dinosauria.

    Science.gov (United States)

    Lowe, Craig B; Clarke, Julia A; Baker, Allan J; Haussler, David; Edwards, Scott V

    2015-01-01

    The evolution of avian feathers has recently been illuminated by fossils and the identification of genes involved in feather patterning and morphogenesis. However, molecular studies have focused mainly on protein-coding genes. Using comparative genomics and more than 600,000 conserved regulatory elements, we show that patterns of genome evolution in the vicinity of feather genes are consistent with a major role for regulatory innovation in the evolution of feathers. Rates of innovation at feather regulatory elements exhibit an extended period of innovation with peaks in the ancestors of amniotes and archosaurs. We estimate that 86% of such regulatory elements and 100% of the nonkeratin feather gene set were present prior to the origin of Dinosauria. On the branch leading to modern birds, we detect a strong signal of regulatory innovation near insulin-like growth factor binding protein (IGFBP) 2 and IGFBP5, which have roles in body size reduction, and may represent a genomic signature for the miniaturization of dinosaurian body size preceding the origin of flight. © The Author 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

  11. Networks in Cell Biology

    Science.gov (United States)

    Buchanan, Mark; Caldarelli, Guido; De Los Rios, Paolo; Rao, Francesco; Vendruscolo, Michele

    2010-05-01

    Introduction; 1. Network views of the cell Paolo De Los Rios and Michele Vendruscolo; 2. Transcriptional regulatory networks Sarath Chandra Janga and M. Madan Babu; 3. Transcription factors and gene regulatory networks Matteo Brilli, Elissa Calistri and Pietro Lió; 4. Experimental methods for protein interaction identification Peter Uetz, Björn Titz, Seesandra V. Rajagopala and Gerard Cagney; 5. Modeling protein interaction networks Francesco Rao; 6. Dynamics and evolution of metabolic networks Daniel Segré; 7. Hierarchical modularity in biological networks: the case of metabolic networks Erzsébet Ravasz Regan; 8. Signalling networks Gian Paolo Rossini; Appendix 1. Complex networks: from local to global properties D. Garlaschelli and G. Caldarelli; Appendix 2. Modelling the local structure of networks D. Garlaschelli and G. Caldarelli; Appendix 3. Higher-order topological properties S. Ahnert, T. Fink and G. Caldarelli; Appendix 4. Elementary mathematical concepts A. Gabrielli and G. Caldarelli; References.

  12. Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks.

    Science.gov (United States)

    Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P; Gerstein, Mark

    2010-05-18

    The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers' continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems.

  13. Consistent robustness analysis (CRA) identifies biologically relevant properties of regulatory network models.

    Science.gov (United States)

    Saithong, Treenut; Painter, Kevin J; Millar, Andrew J

    2010-12-16

    A number of studies have previously demonstrated that "goodness of fit" is insufficient in reliably classifying the credibility of a biological model. Robustness and/or sensitivity analysis is commonly employed as a secondary method for evaluating the suitability of a particular model. The results of such analyses invariably depend on the particular parameter set tested, yet many parameter values for biological models are uncertain. Here, we propose a novel robustness analysis that aims to determine the "common robustness" of the model with multiple, biologically plausible parameter sets, rather than the local robustness for a particular parameter set. Our method is applied to two published models of the Arabidopsis circadian clock (the one-loop [1] and two-loop [2] models). The results reinforce current findings suggesting the greater reliability of the two-loop model and pinpoint the crucial role of TOC1 in the circadian network. Consistent Robustness Analysis can indicate both the relative plausibility of different models and also the critical components and processes controlling each model.

  14. Dynamic Regulatory Network Reconstruction for Alzheimer’s Disease Based on Matrix Decomposition Techniques

    Directory of Open Access Journals (Sweden)

    Wei Kong

    2014-01-01

    Full Text Available Alzheimer’s disease (AD is the most common form of dementia and leads to irreversible neurodegenerative damage of the brain. Finding the dynamic responses of genes, signaling proteins, transcription factor (TF activities, and regulatory networks of the progressively deteriorative progress of AD would represent a significant advance in discovering the pathogenesis of AD. However, the high throughput technologies of measuring TF activities are not yet available on a genome-wide scale. In this study, based on DNA microarray gene expression data and a priori information of TFs, network component analysis (NCA algorithm is applied to determining the TF activities and regulatory influences on TGs of incipient, moderate, and severe AD. Based on that, the dynamical gene regulatory networks of the deteriorative courses of AD were reconstructed. To select significant genes which are differentially expressed in different courses of AD, independent component analysis (ICA, which is better than the traditional clustering methods and can successfully group one gene in different meaningful biological processes, was used. The molecular biological analysis showed that the changes of TF activities and interactions of signaling proteins in mitosis, cell cycle, immune response, and inflammation play an important role in the deterioration of AD.

  15. Deciphering the genetic regulatory code using an inverse error control coding framework.

    Energy Technology Data Exchange (ETDEWEB)

    Rintoul, Mark Daniel; May, Elebeoba Eni; Brown, William Michael; Johnston, Anna Marie; Watson, Jean-Paul

    2005-03-01

    We have found that developing a computational framework for reconstructing error control codes for engineered data and ultimately for deciphering genetic regulatory coding sequences is a challenging and uncharted area that will require advances in computational technology for exact solutions. Although exact solutions are desired, computational approaches that yield plausible solutions would be considered sufficient as a proof of concept to the feasibility of reverse engineering error control codes and the possibility of developing a quantitative model for understanding and engineering genetic regulation. Such evidence would help move the idea of reconstructing error control codes for engineered and biological systems from the high risk high payoff realm into the highly probable high payoff domain. Additionally this work will impact biological sensor development and the ability to model and ultimately develop defense mechanisms against bioagents that can be engineered to cause catastrophic damage. Understanding how biological organisms are able to communicate their genetic message efficiently in the presence of noise can improve our current communication protocols, a continuing research interest. Towards this end, project goals include: (1) Develop parameter estimation methods for n for block codes and for n, k, and m for convolutional codes. Use methods to determine error control (EC) code parameters for gene regulatory sequence. (2) Develop an evolutionary computing computational framework for near-optimal solutions to the algebraic code reconstruction problem. Method will be tested on engineered and biological sequences.

  16. Comparison of evolutionary algorithms in gene regulatory network model inference.

    LENUS (Irish Health Repository)

    2010-01-01

    ABSTRACT: BACKGROUND: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineering of GRNs). However, the nature of these data has made this process very difficult. At the moment, several methods of discovering qualitative causal relationships between genes with high accuracy from microarray data exist, but large scale quantitative analysis on real biological datasets cannot be performed, to date, as existing approaches are not suitable for real microarray data which are noisy and insufficient. RESULTS: This paper performs an analysis of several existing evolutionary algorithms for quantitative gene regulatory network modelling. The aim is to present the techniques used and offer a comprehensive comparison of approaches, under a common framework. Algorithms are applied to both synthetic and real gene expression data from DNA microarrays, and ability to reproduce biological behaviour, scalability and robustness to noise are assessed and compared. CONCLUSIONS: Presented is a comparison framework for assessment of evolutionary algorithms, used to infer gene regulatory networks. Promising methods are identified and a platform for development of appropriate model formalisms is established.

  17. Mining biological networks from full-text articles.

    Science.gov (United States)

    Czarnecki, Jan; Shepherd, Adrian J

    2014-01-01

    The study of biological networks is playing an increasingly important role in the life sciences. Many different kinds of biological system can be modelled as networks; perhaps the most important examples are protein-protein interaction (PPI) networks, metabolic pathways, gene regulatory networks, and signalling networks. Although much useful information is easily accessible in publicly databases, a lot of extra relevant data lies scattered in numerous published papers. Hence there is a pressing need for automated text-mining methods capable of extracting such information from full-text articles. Here we present practical guidelines for constructing a text-mining pipeline from existing code and software components capable of extracting PPI networks from full-text articles. This approach can be adapted to tackle other types of biological network.

  18. Cis-regulatory somatic mutations and gene-expression alteration in B-cell lymphomas.

    Science.gov (United States)

    Mathelier, Anthony; Lefebvre, Calvin; Zhang, Allen W; Arenillas, David J; Ding, Jiarui; Wasserman, Wyeth W; Shah, Sohrab P

    2015-04-23

    With the rapid increase of whole-genome sequencing of human cancers, an important opportunity to analyze and characterize somatic mutations lying within cis-regulatory regions has emerged. A focus on protein-coding regions to identify nonsense or missense mutations disruptive to protein structure and/or function has led to important insights; however, the impact on gene expression of mutations lying within cis-regulatory regions remains under-explored. We analyzed somatic mutations from 84 matched tumor-normal whole genomes from B-cell lymphomas with accompanying gene expression measurements to elucidate the extent to which these cancers are disrupted by cis-regulatory mutations. We characterize mutations overlapping a high quality set of well-annotated transcription factor binding sites (TFBSs), covering a similar portion of the genome as protein-coding exons. Our results indicate that cis-regulatory mutations overlapping predicted TFBSs are enriched in promoter regions of genes involved in apoptosis or growth/proliferation. By integrating gene expression data with mutation data, our computational approach culminates with identification of cis-regulatory mutations most likely to participate in dysregulation of the gene expression program. The impact can be measured along with protein-coding mutations to highlight key mutations disrupting gene expression and pathways in cancer. Our study yields specific genes with disrupted expression triggered by genomic mutations in either the coding or the regulatory space. It implies that mutated regulatory components of the genome contribute substantially to cancer pathways. Our analyses demonstrate that identifying genomically altered cis-regulatory elements coupled with analysis of gene expression data will augment biological interpretation of mutational landscapes of cancers.

  19. An enhanced computational platform for investigating the roles of regulatory RNA and for identifying functional RNA motifs

    OpenAIRE

    Chang, Tzu-Hao; Huang, Hsi-Yuan; Hsu, Justin Bo-Kai; Weng, Shun-Long; Horng, Jorng-Tzong; Huang, Hsien-Da

    2013-01-01

    Background Functional RNA molecules participate in numerous biological processes, ranging from gene regulation to protein synthesis. Analysis of functional RNA motifs and elements in RNA sequences can obtain useful information for deciphering RNA regulatory mechanisms. Our previous work, RegRNA, is widely used in the identification of regulatory motifs, and this work extends it by incorporating more comprehensive and updated data sources and analytical approaches into a new platform. Methods ...

  20. LmSmdB: an integrated database for metabolic and gene regulatory network in Leishmania major and Schistosoma mansoni

    Directory of Open Access Journals (Sweden)

    Priyanka Patel

    2016-03-01

    Full Text Available A database that integrates all the information required for biological processing is essential to be stored in one platform. We have attempted to create one such integrated database that can be a one stop shop for the essential features required to fetch valuable result. LmSmdB (L. major and S. mansoni database is an integrated database that accounts for the biological networks and regulatory pathways computationally determined by integrating the knowledge of the genome sequences of the mentioned organisms. It is the first database of its kind that has together with the network designing showed the simulation pattern of the product. This database intends to create a comprehensive canopy for the regulation of lipid metabolism reaction in the parasite by integrating the transcription factors, regulatory genes and the protein products controlled by the transcription factors and hence operating the metabolism at genetic level. Keywords: L.major, S.mansoni, Regulatory networks, Transcription factors, Database

  1. Regulatory Oversight of Cell and Gene Therapy Products in Canada.

    Science.gov (United States)

    Ridgway, Anthony; Agbanyo, Francisca; Wang, Jian; Rosu-Myles, Michael

    2015-01-01

    Health Canada regulates gene therapy products and many cell therapy products as biological drugs under the Canadian Food and Drugs Act and its attendant regulations. Cellular products that meet certain criteria, including minimal manipulation and homologous use, may be subjected to a standards-based approach under the Safety of Human Cells, Tissues and Organs for Transplantation Regulations. The manufacture and clinical testing of cell and gene therapy products (CGTPs) presents many challenges beyond those for protein biologics. Cells cannot be subjected to pathogen removal or inactivation procedures and must frequently be administered shortly after final formulation. Viral vector design and manufacturing control are critically important to overall product quality and linked to safety and efficacy in patients through concerns such as replication competence, vector integration, and vector shedding. In addition, for many CGTPs, the value of nonclinical studies is largely limited to providing proof of concept, and the first meaningful data relating to appropriate dosing, safety parameters, and validity of surrogate or true determinants of efficacy must come from carefully designed clinical trials in patients. Addressing these numerous challenges requires application of various risk mitigation strategies and meeting regulatory expectations specifically adapted to the product types. Regulatory cooperation and harmonisation at an international level are essential for progress in the development and commercialisation of these products. However, particularly in the area of cell therapy, new regulatory paradigms may be needed to harness the benefits of clinical progress in situations where the resources and motivation to pursue a typical drug product approval pathway may be lacking.

  2. Debate on GMOs health risks after statistical findings in regulatory tests.

    Science.gov (United States)

    de Vendômois, Joël Spiroux; Cellier, Dominique; Vélot, Christian; Clair, Emilie; Mesnage, Robin; Séralini, Gilles-Eric

    2010-10-05

    We summarize the major points of international debate on health risk studies for the main commercialized edible GMOs. These GMOs are soy, maize and oilseed rape designed to contain new pesticide residues since they have been modified to be herbicide-tolerant (mostly to Roundup) or to produce mutated Bt toxins. The debated alimentary chronic risks may come from unpredictable insertional mutagenesis effects, metabolic effects, or from the new pesticide residues. The most detailed regulatory tests on the GMOs are three-month long feeding trials of laboratory rats, which are biochemically assessed. The tests are not compulsory, and are not independently conducted. The test data and the corresponding results are kept in secret by the companies. Our previous analyses of regulatory raw data at these levels, taking the representative examples of three GM maize NK 603, MON 810, and MON 863 led us to conclude that hepatorenal toxicities were possible, and that longer testing was necessary. Our study was criticized by the company developing the GMOs in question and the regulatory bodies, mainly on the divergent biological interpretations of statistically significant biochemical and physiological effects. We present the scientific reasons for the crucially different biological interpretations and also highlight the shortcomings in the experimental protocols designed by the company. The debate implies an enormous responsibility towards public health and is essential due to nonexistent traceability or epidemiological studies in the GMO-producing countries.

  3. Characterization of WRKY co-regulatory networks in rice and Arabidopsis

    Directory of Open Access Journals (Sweden)

    Kikuchi Shoshi

    2009-09-01

    Full Text Available Abstract Background The WRKY transcription factor gene family has a very ancient origin and has undergone extensive duplications in the plant kingdom. Several studies have pointed out their involvement in a range of biological processes, revealing that a large number of WRKY genes are transcriptionally regulated under conditions of biotic and/or abiotic stress. To investigate the existence of WRKY co-regulatory networks in plants, a whole gene family WRKYs expression study was carried out in rice (Oryza sativa. This analysis was extended to Arabidopsis thaliana taking advantage of an extensive repository of gene expression data. Results The presented results suggested that 24 members of the rice WRKY gene family (22% of the total were differentially-regulated in response to at least one of the stress conditions tested. We defined the existence of nine OsWRKY gene clusters comprising both phylogenetically related and unrelated genes that were significantly co-expressed, suggesting that specific sets of WRKY genes might act in co-regulatory networks. This hypothesis was tested by Pearson Correlation Coefficient analysis of the Arabidopsis WRKY gene family in a large set of Affymetrix microarray experiments. AtWRKYs were found to belong to two main co-regulatory networks (COR-A, COR-B and two smaller ones (COR-C and COR-D, all including genes belonging to distinct phylogenetic groups. The COR-A network contained several AtWRKY genes known to be involved mostly in response to pathogens, whose physical and/or genetic interaction was experimentally proven. We also showed that specific co-regulatory networks were conserved between the two model species by identifying Arabidopsis orthologs of the co-expressed OsWRKY genes. Conclusion In this work we identified sets of co-expressed WRKY genes in both rice and Arabidopsis that are functionally likely to cooperate in the same signal transduction pathways. We propose that, making use of data from co-regulatory

  4. Evaluation of the published biological bases for regulations concerning non-coherent light

    International Nuclear Information System (INIS)

    Sykes, S.M.; Bockstahler, L.; Felten, R.; Hellman, K.; Jacobson, E.; Krell, K.; Lytle, C.D.; Waxler, M.; Withrow, T.; Zaremba, T.

    1981-01-01

    The development of an information base of light-induced bioeffects data to support regulatory activities is a continuing process. Though standards covering the three spectral regions of light, ultraviolet (UV), visible, and infrared (IR), currently exist, attempts must regularly be made to assess the adequacy of these standards with respect to currently available biological information. In order to establish a starting point for these reassessments, the biological effects of light considered in establishing the standards must first be determined. Using this information, the strengths and weaknesses of each standard can be evaluated, and particularly important areas of future research can be determined. This document analyzes current standards covering non-coherent light with respect to the biological effects considered in their adoption. The current standards covering non-coherent light are based on few biological endpoints. The ACGIH standard for ultraviolet considers only skin erythema and eye keratitis; the visible light standard considers only retinal damage; and the infrared standard considers only lens cataracts. Clearly, other biological effects need to be considered. But any standard represents a state-of-the-art estimate of maximum allowable exposure levels, and while there is considerable qualitative information on many additional biological effects of light, there is little quantitative information. Without this information it is difficult either to incorporate these effects into the regulatory process or to determine if the current standards are adequate to cover them

  5. Politically Induced Regulatory Risk and Independent Regulatory Agencies

    OpenAIRE

    Strausz, Roland

    2015-01-01

    Uncertainty in election outcomes generates politically induced regulatory risk. Political parties' risk attitudes towards such risk depend on a fluctuation effect that hurts both parties and an output--expansion effect that benefits at least one party. Notwithstanding the parties' risk attitudes, political parties have incentives to negotiate away all regulatory risk by pre-electoral bargaining. Efficient pre-electoral bargaining outcomes fully eliminate politically induced regulatory risk. P...

  6. Optimizing nitrification in biological rapid sand filters: Diagnosing and supplementing micronutrients needed for proper filter performance

    DEFF Research Database (Denmark)

    Lee, Carson Odell; Wagner, Florian Benedikt; Boe-Hansen, Rasmus

    Nitrification is an important biological process commonly used in biological drinking water filters to remove ammonium from drinking water. Recent research has shown that a lack of micronutrients could be limiting the performance of these filters. Because nitrification is a biological process, ca...... to be an important diagnostic tool that could decrease regulatory hurdles, and save time and money....

  7. Improving the Timed Automata Approach to Biological Pathway Dynamics

    NARCIS (Netherlands)

    Langerak, R.; Pol, Jaco van de; Post, Janine N.; Schivo, Stefano; Aceto, Luca; Bacci, Giorgio; Bacci, Giovanni; Ingólfsdóttir, Anna; Legay, Axel; Mardare, Radu

    2017-01-01

    Biological systems such as regulatory or gene networks can be seen as a particular type of distributed systems, and for this reason they can be modeled within the Timed Automata paradigm, which was developed in the computer science context. However, tools designed to model distributed systems often

  8. Mutual information and the fidelity of response of gene regulatory models

    International Nuclear Information System (INIS)

    Tabbaa, Omar P; Jayaprakash, C

    2014-01-01

    We investigate cellular response to extracellular signals by using information theory techniques motivated by recent experiments. We present results for the steady state of the following gene regulatory models found in both prokaryotic and eukaryotic cells: a linear transcription-translation model and a positive or negative auto-regulatory model. We calculate both the information capacity and the mutual information exactly for simple models and approximately for the full model. We find that (1) small changes in mutual information can lead to potentially important changes in cellular response and (2) there are diminishing returns in the fidelity of response as the mutual information increases. We calculate the information capacity using Gillespie simulations of a model for the TNF-α-NF-κ B network and find good agreement with the measured value for an experimental realization of this network. Our results provide a quantitative understanding of the differences in cellular response when comparing experimentally measured mutual information values of different gene regulatory models. Our calculations demonstrate that Gillespie simulations can be used to compute the mutual information of more complex gene regulatory models, providing a potentially useful tool in synthetic biology. (paper)

  9. Genomic analysis of the hierarchical structure of regulatory networks

    Science.gov (United States)

    Yu, Haiyuan; Gerstein, Mark

    2006-01-01

    A fundamental question in biology is how the cell uses transcription factors (TFs) to coordinate the expression of thousands of genes in response to various stimuli. The relationships between TFs and their target genes can be modeled in terms of directed regulatory networks. These relationships, in turn, can be readily compared with commonplace “chain-of-command” structures in social networks, which have characteristic hierarchical layouts. Here, we develop algorithms for identifying generalized hierarchies (allowing for various loop structures) and use these approaches to illuminate extensive pyramid-shaped hierarchical structures existing in the regulatory networks of representative prokaryotes (Escherichia coli) and eukaryotes (Saccharomyces cerevisiae), with most TFs at the bottom levels and only a few master TFs on top. These masters are situated near the center of the protein–protein interaction network, a different type of network from the regulatory one, and they receive most of the input for the whole regulatory hierarchy through protein interactions. Moreover, they have maximal influence over other genes, in terms of affecting expression-level changes. Surprisingly, however, TFs at the bottom of the regulatory hierarchy are more essential to the viability of the cell. Finally, one might think master TFs achieve their wide influence through directly regulating many targets, but TFs with most direct targets are in the middle of the hierarchy. We find, in fact, that these midlevel TFs are “control bottlenecks” in the hierarchy, and this great degree of control for “middle managers” has parallels in efficient social structures in various corporate and governmental settings. PMID:17003135

  10. Analysis of deterministic cyclic gene regulatory network models with delays

    CERN Document Server

    Ahsen, Mehmet Eren; Niculescu, Silviu-Iulian

    2015-01-01

    This brief examines a deterministic, ODE-based model for gene regulatory networks (GRN) that incorporates nonlinearities and time-delayed feedback. An introductory chapter provides some insights into molecular biology and GRNs. The mathematical tools necessary for studying the GRN model are then reviewed, in particular Hill functions and Schwarzian derivatives. One chapter is devoted to the analysis of GRNs under negative feedback with time delays and a special case of a homogenous GRN is considered. Asymptotic stability analysis of GRNs under positive feedback is then considered in a separate chapter, in which conditions leading to bi-stability are derived. Graduate and advanced undergraduate students and researchers in control engineering, applied mathematics, systems biology and synthetic biology will find this brief to be a clear and concise introduction to the modeling and analysis of GRNs.

  11. Reconstructing the regulatory circuit of cell fate determination in yeast mating response.

    Science.gov (United States)

    Shao, Bin; Yuan, Haiyu; Zhang, Rongfei; Wang, Xuan; Zhang, Shuwen; Ouyang, Qi; Hao, Nan; Luo, Chunxiong

    2017-07-01

    Massive technological advances enabled high-throughput measurements of proteomic changes in biological processes. However, retrieving biological insights from large-scale protein dynamics data remains a challenging task. Here we used the mating differentiation in yeast Saccharomyces cerevisiae as a model and developed integrated experimental and computational approaches to analyze the proteomic dynamics during the process of cell fate determination. When exposed to a high dose of mating pheromone, the yeast cell undergoes growth arrest and forms a shmoo-like morphology; however, at intermediate doses, chemotropic elongated growth is initialized. To understand the gene regulatory networks that control this differentiation switch, we employed a high-throughput microfluidic imaging system that allows real-time and simultaneous measurements of cell growth and protein expression. Using kinetic modeling of protein dynamics, we classified the stimulus-dependent changes in protein abundance into two sources: global changes due to physiological alterations and gene-specific changes. A quantitative framework was proposed to decouple gene-specific regulatory modes from the growth-dependent global modulation of protein abundance. Based on the temporal patterns of gene-specific regulation, we established the network architectures underlying distinct cell fates using a reverse engineering method and uncovered the dose-dependent rewiring of gene regulatory network during mating differentiation. Furthermore, our results suggested a potential crosstalk between the pheromone response pathway and the target of rapamycin (TOR)-regulated ribosomal biogenesis pathway, which might underlie a cell differentiation switch in yeast mating response. In summary, our modeling approach addresses the distinct impacts of the global and gene-specific regulation on the control of protein dynamics and provides new insights into the mechanisms of cell fate determination. We anticipate that our

  12. 78 FR 53138 - South Carolina Public Service Authority; Notice of Meeting to Discuss Santee-Cooper Biological...

    Science.gov (United States)

    2013-08-28

    ... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission [Project No. 199-205] South Carolina Public Service Authority; Notice of Meeting to Discuss Santee-Cooper Biological Opinion On July 15, 2010, the National Marine Fisheries Service (NMFS) filed its Biological Opinion (BO) on the relicensing of...

  13. Instream sand and gravel mining: Environmental issues and regulatory process in the United States

    Science.gov (United States)

    Meador, M.R.; Layher, A.O.

    1998-01-01

    Sand and gravel are widely used throughout the U.S. construction industry, but their extraction can significantly affect the physical, chemical, and biological characteristics of mined streams. Fisheries biologists often find themselves involved in the complex environmental and regulatory issues related to instream sand and gravel mining. This paper provides an overview of information presented in a symposium held at the 1997 midyear meeting of the Southern Division of the American Fisheries Society in San Antonio, Texas, to discuss environmental issues and regulatory procedures related to instream mining. Conclusions from the symposium suggest that complex physicochemical and biotic responses to disturbance such as channel incision and alteration of riparian vegetation ultimately determine the effects of instream mining. An understanding of geomorphic processes can provide insight into the effects of mining operations on stream function, and multidisciplinary empirical studies are needed to determine the relative effects of mining versus other natural and human-induced stream alterations. Mining regulations often result in a confusing regulatory process complicated, for example, by the role of the U.S. Army Corps of Engineers, which has undergone numerous changes and remains unclear. Dialogue among scientists, miners, and regulators can provide an important first step toward developing a plan that integrates biology and politics to protect aquatic resources.

  14. Short-lived non-coding transcripts (SLiTs): Clues to regulatory long non-coding RNA.

    Science.gov (United States)

    Tani, Hidenori

    2017-03-22

    Whole transcriptome analyses have revealed a large number of novel long non-coding RNAs (lncRNAs). Although the importance of lncRNAs has been documented in previous reports, the biological and physiological functions of lncRNAs remain largely unknown. The role of lncRNAs seems an elusive problem. Here, I propose a clue to the identification of regulatory lncRNAs. The key point is RNA half-life. RNAs with a long half-life (t 1/2 > 4 h) contain a significant proportion of ncRNAs, as well as mRNAs involved in housekeeping functions, whereas RNAs with a short half-life (t 1/2 regulatory ncRNAs and regulatory mRNAs. This novel class of ncRNAs with a short half-life can be categorized as Short-Lived non-coding Transcripts (SLiTs). I consider that SLiTs are likely to be rich in functionally uncharacterized regulatory RNAs. This review describes recent progress in research into SLiTs.

  15. The impact of measurement errors in the identification of regulatory networks

    Directory of Open Access Journals (Sweden)

    Sato João R

    2009-12-01

    Full Text Available Abstract Background There are several studies in the literature depicting measurement error in gene expression data and also, several others about regulatory network models. However, only a little fraction describes a combination of measurement error in mathematical regulatory networks and shows how to identify these networks under different rates of noise. Results This article investigates the effects of measurement error on the estimation of the parameters in regulatory networks. Simulation studies indicate that, in both time series (dependent and non-time series (independent data, the measurement error strongly affects the estimated parameters of the regulatory network models, biasing them as predicted by the theory. Moreover, when testing the parameters of the regulatory network models, p-values computed by ignoring the measurement error are not reliable, since the rate of false positives are not controlled under the null hypothesis. In order to overcome these problems, we present an improved version of the Ordinary Least Square estimator in independent (regression models and dependent (autoregressive models data when the variables are subject to noises. Moreover, measurement error estimation procedures for microarrays are also described. Simulation results also show that both corrected methods perform better than the standard ones (i.e., ignoring measurement error. The proposed methodologies are illustrated using microarray data from lung cancer patients and mouse liver time series data. Conclusions Measurement error dangerously affects the identification of regulatory network models, thus, they must be reduced or taken into account in order to avoid erroneous conclusions. This could be one of the reasons for high biological false positive rates identified in actual regulatory network models.

  16. On the role of sparseness in the evolution of modularity in gene regulatory networks.

    Science.gov (United States)

    Espinosa-Soto, Carlos

    2018-05-01

    Modularity is a widespread property in biological systems. It implies that interactions occur mainly within groups of system elements. A modular arrangement facilitates adjustment of one module without perturbing the rest of the system. Therefore, modularity of developmental mechanisms is a major factor for evolvability, the potential to produce beneficial variation from random genetic change. Understanding how modularity evolves in gene regulatory networks, that create the distinct gene activity patterns that characterize different parts of an organism, is key to developmental and evolutionary biology. One hypothesis for the evolution of modules suggests that interactions between some sets of genes become maladaptive when selection favours additional gene activity patterns. The removal of such interactions by selection would result in the formation of modules. A second hypothesis suggests that modularity evolves in response to sparseness, the scarcity of interactions within a system. Here I simulate the evolution of gene regulatory networks and analyse diverse experimentally sustained networks to study the relationship between sparseness and modularity. My results suggest that sparseness alone is neither sufficient nor necessary to explain modularity in gene regulatory networks. However, sparseness amplifies the effects of forms of selection that, like selection for additional gene activity patterns, already produce an increase in modularity. That evolution of new gene activity patterns is frequent across evolution also supports that it is a major factor in the evolution of modularity. That sparseness is widespread across gene regulatory networks indicates that it may have facilitated the evolution of modules in a wide variety of cases.

  17. Discriminate the response of Acute Myeloid Leukemia patients to treatment by using proteomics data and Answer Set Programming.

    Science.gov (United States)

    Chebouba, Lokmane; Miannay, Bertrand; Boughaci, Dalila; Guziolowski, Carito

    2018-03-08

    During the last years, several approaches were applied on biomedical data to detect disease specific proteins and genes in order to better target drugs. It was shown that statistical and machine learning based methods use mainly clinical data and improve later their results by adding omics data. This work proposes a new method to discriminate the response of Acute Myeloid Leukemia (AML) patients to treatment. The proposed approach uses proteomics data and prior regulatory knowledge in the form of networks to predict cancer treatment outcomes by finding out the different Boolean networks specific to each type of response to drugs. To show its effectiveness we evaluate our method on a dataset from the DREAM 9 challenge. The results are encouraging and demonstrate the benefit of our approach to distinguish patient groups with different response to treatment. In particular each treatment response group is characterized by a predictive model in the form of a signaling Boolean network. This model describes regulatory mechanisms which are specific to each response group. The proteins in this model were selected from the complete dataset by imposing optimization constraints that maximize the difference in the logical response of the Boolean network associated to each group of patients given the omic dataset. This mechanistic and predictive model also allow us to classify new patients data into the two different patient response groups. We propose a new method to detect the most relevant proteins for understanding different patient responses upon treatments in order to better target drugs using a Prior Knowledge Network and proteomics data. The results are interesting and show the effectiveness of our method.

  18. Functions of MicroRNAs in Cardiovascular Biology and Disease

    Science.gov (United States)

    Hata, Akiko

    2015-01-01

    In 1993, lin-4 was discovered as a critical modulator of temporal development in Caenorhabditis elegans and, most notably, as the first in the class of small, single-stranded noncoding RNAs now defined as microRNAs (miRNAs). Another eight years elapsed before miRNA expression was detected in mammalian cells. Since then, explosive advancements in the field of miRNA biology have elucidated the basic mechanism of miRNA biogenesis, regulation, and gene-regulatory function. The discovery of this new class of small RNAs has augmented the complexity of gene-regulatory programs as well as the understanding of developmental and pathological processes in the cardiovascular system. Indeed, the contributions of miRNAs in cardiovascular development and function have been widely explored, revealing the extensive role of these small regulatory RNAs in cardiovascular physiology. PMID:23157557

  19. Strengthening Regulatory Competence in a Changing Nuclear Regulatory Environment

    International Nuclear Information System (INIS)

    Illizastigui, P.F.

    2016-01-01

    The paper addresses the approach followed by the Cuban National Center for Nuclear Safety for the management of current and new competences of its regulatory staff with the aim of allowing those staff to effectively fulfill their core regulatory functions. The approach is realized through an Integrated System for Competence Building, which is based on the IAEA recommendations, shown to be effective in ensuring the necessary competence in the relevant areas. In the author’s opinion, competence of the regulatory staff in the area of human and organizational factors is of paramount importance and needs to be further strengthened in order to be able to assess safety performance at the facilities and detect early signs of deteriorating safety performance. The former is defined by the author as the core regulatory function “Analysis” which covers the entire spectrum of assessment tasks carried out by the regulatory staff to: a) detect declining safety performance, b) diagnose latent weaknesses (root causes) and c) make effective safety culture interventions. The author suggests that competence associated with the fulfillment of the analysis function is distinctly identified and dealt with separately in the current system of managing regulatory competence. (author)

  20. A primer on thermodynamic-based models for deciphering transcriptional regulatory logic.

    Science.gov (United States)

    Dresch, Jacqueline M; Richards, Megan; Ay, Ahmet

    2013-09-01

    A rigorous analysis of transcriptional regulation at the DNA level is crucial to the understanding of many biological systems. Mathematical modeling has offered researchers a new approach to understanding this central process. In particular, thermodynamic-based modeling represents the most biophysically informed approach aimed at connecting DNA level regulatory sequences to the expression of specific genes. The goal of this review is to give biologists a thorough description of the steps involved in building, analyzing, and implementing a thermodynamic-based model of transcriptional regulation. The data requirements for this modeling approach are described, the derivation for a specific regulatory region is shown, and the challenges and future directions for the quantitative modeling of gene regulation are discussed. Copyright © 2013 Elsevier B.V. All rights reserved.

  1. Manufacturing, regulatory and commercial challenges of biopharmaceuticals production: a Finnish perspective.

    Science.gov (United States)

    Närhi, Marko; Nordström, Katrina

    2005-04-01

    Biopharmaceuticals product development is a broad and multidisciplinary field. Science and technology are combined with new manufacturing, regulatory and commercial challenges. However, although there is ample literature on the molecular biology and biochemistry of products, the implementation of processes from test tube to commercial scale has not received similar attention. Consequently, the present study aims to highlight, from practical point of view, some of the key issues involved with manufacturing technologies of biopharmaceuticals at a commercial scale. Regulatory requirements and investments are also addressed based on the practical experiences of start-up and small companies. Finland is used as a case-example of such companies as this is a EU-member state with strong technological growth and rapidly increasing number of biotech companies.

  2. Effect of regulatory architecture on broad versus narrow sense heritability.

    Directory of Open Access Journals (Sweden)

    Yunpeng Wang

    Full Text Available Additive genetic variance (VA and total genetic variance (VG are core concepts in biomedical, evolutionary and production-biology genetics. What determines the large variation in reported VA /VG ratios from line-cross experiments is not well understood. Here we report how the VA /VG ratio, and thus the ratio between narrow and broad sense heritability (h(2 /H(2 , varies as a function of the regulatory architecture underlying genotype-to-phenotype (GP maps. We studied five dynamic models (of the cAMP pathway, the glycolysis, the circadian rhythms, the cell cycle, and heart cell dynamics. We assumed genetic variation to be reflected in model parameters and extracted phenotypes summarizing the system dynamics. Even when imposing purely linear genotype to parameter maps and no environmental variation, we observed quite low VA /VG ratios. In particular, systems with positive feedback and cyclic dynamics gave more non-monotone genotype-phenotype maps and much lower VA /VG ratios than those without. The results show that some regulatory architectures consistently maintain a transparent genotype-to-phenotype relationship, whereas other architectures generate more subtle patterns. Our approach can be used to elucidate these relationships across a whole range of biological systems in a systematic fashion.

  3. The expanding regulatory universe of p53 in gastrointestinal cancer.

    Science.gov (United States)

    Fesler, Andrew; Zhang, Ning; Ju, Jingfang

    2016-01-01

    Tumor suppresser gene TP53 is one of the most frequently deleted or mutated genes in gastrointestinal cancers. As a transcription factor, p53 regulates a number of important protein coding genes to control cell cycle, cell death, DNA damage/repair, stemness, differentiation and other key cellular functions. In addition, p53 is also able to activate the expression of a number of small non-coding microRNAs (miRNAs) through direct binding to the promoter region of these miRNAs.  Many miRNAs have been identified to be potential tumor suppressors by regulating key effecter target mRNAs. Our understanding of the regulatory network of p53 has recently expanded to include long non-coding RNAs (lncRNAs). Like miRNA, lncRNAs have been found to play important roles in cancer biology.  With our increased understanding of the important functions of these non-coding RNAs and their relationship with p53, we are gaining exciting new insights into the biology and function of cells in response to various growth environment changes. In this review we summarize the current understanding of the ever expanding involvement of non-coding RNAs in the p53 regulatory network and its implications for our understanding of gastrointestinal cancer.

  4. Building for Biology: A Gene Therapy Trial Infrastructure

    Directory of Open Access Journals (Sweden)

    Samuel Taylor-Alexander

    2017-06-01

    Full Text Available In this article, we examine the construction of the infrastructure for a Phase II gene therapy trial for Cystic Fibrosis (CF. Tracing the development of the material technologies and physical spaces used in the trial, we show how the trial infrastructure took form at the uncertain intersection of scientific norms, built environments, regulatory negotiations, patienthood, and the biologies of both disease and therapy. We define infrastructures as material and immaterial (including symbols and affect composites that serve a selective distributive purpose and facilitate projects of making and doing. There is a politics to this distributive action, which is itself twofold, because whilst infrastructures enable and delimit the movement of matter, they also mediate the very activity for which they provide the grounds. An infrastructural focus allows us to show how purposeful connections are made in a context of epistemic and regulatory uncertainty. The gene therapy researchers were working in a context of multiple uncertainties, regarding not only how to do gene therapy, but also how to anticipate and enact ambiguous regulatory requirements in a context of limited resources (technical, spatial, and financial. At the same time, the trial infrastructure had to accommodate Cystic Fibrosis biology by bridging the gap between pathology and therapy. The consortium’s approach to treating CF required that they address concerns about contamination and safety while finding a way of getting a modified gene product into the lungs of the trial participants.

  5. News from the Biological Stain Commission no. 12

    DEFF Research Database (Denmark)

    Lyon, H O

    2012-01-01

    In this 12(th) issue of News from the Biological Stain Commission (BSC) under the heading of Regulatory affairs, the Biological Stain Commission's International Affairs Committee presents information from the meetings of ISO/TC 212/WG 1 Quality and competence in the medical laboratory and ISO....../TC 212/WG 3 In vitro diagnostic products both held on 2 - 3 June 2010, plus information on the second plenary meeting of ISO/TC 212 Clinical laboratory testing and in vitro diagnostic test systems held on 4 June 2010. All meetings took place in Seoul, Republic of Korea. Finally, information is provided...

  6. Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?

    Directory of Open Access Journals (Sweden)

    Saurabh Vashishtha

    Full Text Available There is a growing appreciation for the network biology that regulates the coordinated expression of molecular and cellular markers however questions persist regarding the identifiability of these networks. Here we explore some of the issues relevant to recovering directed regulatory networks from time course data collected under experimental constraints typical of in vivo studies. NetSim simulations of sparsely connected biological networks were used to evaluate two simple feature selection techniques used in the construction of linear Ordinary Differential Equation (ODE models, namely truncation of terms versus latent vector projection. Performance was compared with ODE-based Time Series Network Identification (TSNI integral, and the information-theoretic Time-Delay ARACNE (TD-ARACNE. Projection-based techniques and TSNI integral outperformed truncation-based selection and TD-ARACNE on aggregate networks with edge densities of 10-30%, i.e. transcription factor, protein-protein cliques and immune signaling networks. All were more robust to noise than truncation-based feature selection. Performance was comparable on the in silico 10-node DREAM 3 network, a 5-node Yeast synthetic network designed for In vivo Reverse-engineering and Modeling Assessment (IRMA and a 9-node human HeLa cell cycle network of similar size and edge density. Performance was more sensitive to the number of time courses than to sample frequency and extrapolated better to larger networks by grouping experiments. In all cases performance declined rapidly in larger networks with lower edge density. Limited recovery and high false positive rates obtained overall bring into question our ability to generate informative time course data rather than the design of any particular reverse engineering algorithm.

  7. Manufacturing of biodrugs: need for harmonization in regulatory standards.

    Science.gov (United States)

    Sahoo, Niharika; Choudhury, Koel; Manchikanti, Padmavati

    2009-01-01

    Biodrugs (biologics) are much more complex than chemically synthesized drugs because of their structural heterogeneity and interactions within a given biologic system. The manufacturing process in the biodrug industry varies with each type of molecule and is far more elaborate and stringent due to the use of living organisms and complex substrates. Product purity and altered structural characteristics leading to potential immunogenicity have often been of concern when establishing quality and safety in the use of biodrugs. Regulatory compliance in manufacturing and commercialization of biodrugs involves quality control, quality assurance, and batch documentation. Many factors such as host cell development, cell bank establishment, cell culture, protein production, purification, analysis, formulation, storage, and handling are critical for ensuring the purity, activity, and safety of the finished product. Good Manufacturing Practice (GMP) for biodrugs has been developed in certain regions such as the EU, US, and Japan. Due to differences in manufacturing methods and systems, product-specific GMP guidelines are evolving. In general, there are variations in GMP guidelines between countries, which lead to difficulty for the manufacturers in conforming to different standards, thus entailing delays in the commercialization of biodrugs. There is a need to develop a unified regulatory guideline for biodrug manufacturing across various countries, which would be helpful in the marketing of products and trade. This review deals with the comparative framework and analysis of GMP regulation of biodrugs.

  8. Prokaryotic regulatory systems biology: Common principles governing the functional architectures of Bacillus subtilis and Escherichia coli unveiled by the natural decomposition approach.

    Science.gov (United States)

    Freyre-González, Julio A; Treviño-Quintanilla, Luis G; Valtierra-Gutiérrez, Ilse A; Gutiérrez-Ríos, Rosa María; Alonso-Pavón, José A

    2012-10-31

    Escherichia coli and Bacillus subtilis are two of the best-studied prokaryotic model organisms. Previous analyses of their transcriptional regulatory networks have shown that they exhibit high plasticity during evolution and suggested that both converge to scale-free-like structures. Nevertheless, beyond this suggestion, no analyses have been carried out to identify the common systems-level components and principles governing these organisms. Here we show that these two phylogenetically distant organisms follow a set of common novel biologically consistent systems principles revealed by the mathematically and biologically founded natural decomposition approach. The discovered common functional architecture is a diamond-shaped, matryoshka-like, three-layer (coordination, processing, and integration) hierarchy exhibiting feedback, which is shaped by four systems-level components: global transcription factors (global TFs), locally autonomous modules, basal machinery and intermodular genes. The first mathematical criterion to identify global TFs, the κ-value, was reassessed on B. subtilis and confirmed its high predictive power by identifying all the previously reported, plus three potential, master regulators and eight sigma factors. The functionally conserved cores of modules, basal cell machinery, and a set of non-orthologous common physiological global responses were identified via both orthologous genes and non-orthologous conserved functions. This study reveals novel common systems principles maintained between two phylogenetically distant organisms and provides a comparison of their lifestyle adaptations. Our results shed new light on the systems-level principles and the fundamental functions required by bacteria to sustain life. Copyright © 2012 Elsevier B.V. All rights reserved.

  9. Regulatory challenges and approaches to characterize nanomedicines and their follow-on similars.

    Science.gov (United States)

    Mühlebach, Stefan; Borchard, Gerrit; Yildiz, Selcan

    2015-03-01

    Nanomedicines are highly complex products and are the result of difficult to control manufacturing processes. Nonbiological complex drugs and their biological counterparts can comprise nanoparticles and therefore show nanomedicine characteristics. They consist of not fully known nonhomomolecular structures, and can therefore not be characterized by physicochemical means only. Also, intended copies of nanomedicines (follow-on similars) may have clinically meaningful differences, creating the regulatory challenge of how to grant a high degree of assurance for patients' benefit and safety. As an example, the current regulatory approach for marketing authorization of intended copies of nonbiological complex drugs appears inappropriate; also, a valid strategy incorporating the complexity of such systems is undefined. To demonstrate sufficient similarity and comparability, a stepwise quality, nonclinical and clinical approach is necessary to obtain market authorization for follow-on products as therapeutic alternatives, substitution and/or interchangeable products. To fill the regulatory gap, harmonized and science-based standards are needed.

  10. Robust identification of transcriptional regulatory networks using a Gibbs sampler on outlier sum statistic.

    Science.gov (United States)

    Gu, Jinghua; Xuan, Jianhua; Riggins, Rebecca B; Chen, Li; Wang, Yue; Clarke, Robert

    2012-08-01

    Identification of transcriptional regulatory networks (TRNs) is of significant importance in computational biology for cancer research, providing a critical building block to unravel disease pathways. However, existing methods for TRN identification suffer from the inclusion of excessive 'noise' in microarray data and false-positives in binding data, especially when applied to human tumor-derived cell line studies. More robust methods that can counteract the imperfection of data sources are therefore needed for reliable identification of TRNs in this context. In this article, we propose to establish a link between the quality of one target gene to represent its regulator and the uncertainty of its expression to represent other target genes. Specifically, an outlier sum statistic was used to measure the aggregated evidence for regulation events between target genes and their corresponding transcription factors. A Gibbs sampling method was then developed to estimate the marginal distribution of the outlier sum statistic, hence, to uncover underlying regulatory relationships. To evaluate the effectiveness of our proposed method, we compared its performance with that of an existing sampling-based method using both simulation data and yeast cell cycle data. The experimental results show that our method consistently outperforms the competing method in different settings of signal-to-noise ratio and network topology, indicating its robustness for biological applications. Finally, we applied our method to breast cancer cell line data and demonstrated its ability to extract biologically meaningful regulatory modules related to estrogen signaling and action in breast cancer. The Gibbs sampler MATLAB package is freely available at http://www.cbil.ece.vt.edu/software.htm. xuan@vt.edu Supplementary data are available at Bioinformatics online.

  11. CRISPR-Cas9 epigenome editing enables high-throughput screening for functional regulatory elements in the human genome.

    Science.gov (United States)

    Klann, Tyler S; Black, Joshua B; Chellappan, Malathi; Safi, Alexias; Song, Lingyun; Hilton, Isaac B; Crawford, Gregory E; Reddy, Timothy E; Gersbach, Charles A

    2017-06-01

    Large genome-mapping consortia and thousands of genome-wide association studies have identified non-protein-coding elements in the genome as having a central role in various biological processes. However, decoding the functions of the millions of putative regulatory elements discovered in these studies remains challenging. CRISPR-Cas9-based epigenome editing technologies have enabled precise perturbation of the activity of specific regulatory elements. Here we describe CRISPR-Cas9-based epigenomic regulatory element screening (CERES) for improved high-throughput screening of regulatory element activity in the native genomic context. Using dCas9 KRAB repressor and dCas9 p300 activator constructs and lentiviral single guide RNA libraries to target DNase I hypersensitive sites surrounding a gene of interest, we carried out both loss- and gain-of-function screens to identify regulatory elements for the β-globin and HER2 loci in human cells. CERES readily identified known and previously unidentified regulatory elements, some of which were dependent on cell type or direction of perturbation. This technology allows the high-throughput functional annotation of putative regulatory elements in their native chromosomal context.

  12. Regulatory networks, legal federalism, and multi-level regulatory systems

    OpenAIRE

    Kerber, Wolfgang; Wendel, Julia

    2016-01-01

    Transnational regulatory networks play important roles in multi-level regulatory regimes, as e.g, the European Union. In this paper we analyze the role of regulatory networks from the perspective of the economic theory of legal federalism. Often sophisticated intermediate institutional solutions between pure centralisation and pure decentralisation can help to solve complex tradeoff problems between the benefits and problems of centralised and decentralised solutions. Drawing upon the insight...

  13. Regulatory RNA design through evolutionary computation and strand displacement.

    Science.gov (United States)

    Rostain, William; Landrain, Thomas E; Rodrigo, Guillermo; Jaramillo, Alfonso

    2015-01-01

    The discovery and study of a vast number of regulatory RNAs in all kingdoms of life over the past decades has allowed the design of new synthetic RNAs that can regulate gene expression in vivo. Riboregulators, in particular, have been used to activate or repress gene expression. However, to accelerate and scale up the design process, synthetic biologists require computer-assisted design tools, without which riboregulator engineering will remain a case-by-case design process requiring expert attention. Recently, the design of RNA circuits by evolutionary computation and adapting strand displacement techniques from nanotechnology has proven to be suited to the automated generation of DNA sequences implementing regulatory RNA systems in bacteria. Herein, we present our method to carry out such evolutionary design and how to use it to create various types of riboregulators, allowing the systematic de novo design of genetic control systems in synthetic biology.

  14. Construction of an integrated gene regulatory network link to stress-related immune system in cattle.

    Science.gov (United States)

    Behdani, Elham; Bakhtiarizadeh, Mohammad Reza

    2017-10-01

    The immune system is an important biological system that is negatively impacted by stress. This study constructed an integrated regulatory network to enhance our understanding of the regulatory gene network used in the stress-related immune system. Module inference was used to construct modules of co-expressed genes with bovine leukocyte RNA-Seq data. Transcription factors (TFs) were then assigned to these modules using Lemon-Tree algorithms. In addition, the TFs assigned to each module were confirmed using the promoter analysis and protein-protein interactions data. Therefore, our integrated method identified three TFs which include one TF that is previously known to be involved in immune response (MYBL2) and two TFs (E2F8 and FOXS1) that had not been recognized previously and were identified for the first time in this study as novel regulatory candidates in immune response. This study provides valuable insights on the regulatory programs of genes involved in the stress-related immune system.

  15. Services of the Nuclear Regulatory Authority Library

    International Nuclear Information System (INIS)

    Carregado, M.A.; Wallingre, G.V.

    2011-01-01

    Full text; The main of this work is to present the services and activities of the ARN (Autoridad Regulatoria Nuclear) Library to potential users from the biological dosimetry area in the framework of the intercomparison Meeting of the Latin American Biological Dosimetry Network held in Buenos Aires from October 27-30 of 2008. It makes a short chronology of the library; the services offered to each type of users and the tasks related to technical and international cooperation with other organizations such as: the terminology Committee of IRAM (Instituto Argentino de Normalizacion y Certificacion); the input of national literature to the INIS Database of the IAEA; the retrospective digitalisation, indexing and bibliographic description of institutional publications to be submitted to the repository of the Ibero American Forum of Nuclear and Radiation Safety Regulatory Organizations and the participation in nuclear information networks. Finally it shown some relevant data from the internal statistics. (authors)

  16. Conserved-peptide upstream open reading frames (CPuORFs are associated with regulatory genes in angiosperms

    Directory of Open Access Journals (Sweden)

    Richard A Jorgensen

    2012-08-01

    Full Text Available Upstream open reading frames (uORFs are common in eukaryotic transcripts, but those that encode conserved peptides (CPuORFs occur in less than 1% of transcripts. The peptides encoded by three plant CPuORF families are known to control translation of the downstream ORF in response to a small signal molecule (sucrose, polyamines and phosphocholine. In flowering plants, transcription factors are statistically over-represented among genes that possess CPuORFs, and in general it appeared that many CPuORF genes also had other regulatory functions, though the significance of this suggestion was uncertain (Hayden and Jorgensen, 2007. Five years later the literature provides much more information on the functions of many CPuORF genes. Here we reassess the functions of 27 known CPuORF gene families and find that 22 of these families play a variety of different regulatory roles, from transcriptional control to protein turnover, and from small signal molecules to signal transduction kinases. Clearly then, there is indeed a strong association of CPuORFs with regulatory genes. In addition, 16 of these families play key roles in a variety of different biological processes. Most strikingly, the core sucrose response network includes three different CPuORFs, creating the potential for sophisticated balancing of the network in response to three different molecular inputs. We propose that the function of most CPuORFs is to modulate translation of a downstream major ORF (mORF in response to a signal molecule recognized by the conserved peptide and that because the mORFs of CPuORF genes generally encode regulatory proteins, many of them centrally important in the biology of plants, CPuORFs play key roles in balancing such regulatory networks.

  17. Applications of biological tools or biomarkers in aquatic biota: A case study of the Tamar estuary, South West England.

    Science.gov (United States)

    Dallas, Lorna J; Jha, Awadhesh N

    2015-06-30

    Biological systems are the ultimate recipients of pollutant-induced damage. Consequently, our traditional reliance on analytical tools is not enough to assess ecosystem health. Biological responses or biomarkers are therefore also considered to be important tools for environmental hazard and risk assessments. Due to historical mining, other anthropogenic activities, and its conservational importance (e.g. NATURA sites, SACs), the Tamar estuary in South West England is an ideal environment in which to examine applications of such biological tools. This review presents a thorough and critical evaluation of the different biological tools used in the Tamar estuary thus far, while also discussing future perspectives for biomarker studies from a global perspective. In particular, we focus on the challenges which hinder applications of biological tools from being more readily incorporated into regulatory frameworks, with the aim of enabling both policymakers and primary stakeholders to maximise the environmental relevance and regulatory usefulness of such tools. Copyright © 2015 Elsevier Ltd. All rights reserved.

  18. Safety culture as a matter of regulatory control and regulatory effectiveness

    International Nuclear Information System (INIS)

    Camargo, C.T.M.; Furieri, E.B.; Arrieta, L.A.I.; Almeida, C.U.C.

    2002-01-01

    More than 15 years have passed since the term 'safety culture' was introduced by the International Nuclear Safety Advisory Group (INSAG), and although the concept now is widely accepted, practical applications and characteristics have been disseminated mainly for nuclear power plant operating organizations. There is still a lack of international guidance on the use of safety culture as a regulatory matter and on the application of the concept within regulatory organizations. This work explores the meaning of safety culture in two different fields: as an element of safety management systems it shall be a matter of regulatory control; as a complementary tool for quality management it should be used to enhance regulatory effectiveness. Brazilian recent experience on regulating nuclear power reactors provide some examples on how the concept of safety culture may influence regulatory strategies and regulatory management. (author)

  19. Network-based identification of biomarkers coexpressed with multiple pathways.

    Science.gov (United States)

    Guo, Nancy Lan; Wan, Ying-Wooi

    2014-01-01

    Unraveling complex molecular interactions and networks and incorporating clinical information in modeling will present a paradigm shift in molecular medicine. Embedding biological relevance via modeling molecular networks and pathways has become increasingly important for biomarker identification in cancer susceptibility and metastasis studies. Here, we give a comprehensive overview of computational methods used for biomarker identification, and provide a performance comparison of several network models used in studies of cancer susceptibility, disease progression, and prognostication. Specifically, we evaluated implication networks, Boolean networks, Bayesian networks, and Pearson's correlation networks in constructing gene coexpression networks for identifying lung cancer diagnostic and prognostic biomarkers. The results show that implication networks, implemented in Genet package, identified sets of biomarkers that generated an accurate prediction of lung cancer risk and metastases; meanwhile, implication networks revealed more biologically relevant molecular interactions than Boolean networks, Bayesian networks, and Pearson's correlation networks when evaluated with MSigDB database.

  20. Biological Activities of Royal Jelly - Review

    Directory of Open Access Journals (Sweden)

    Crenguţa I. Pavel

    2011-10-01

    Full Text Available Royal jelly is a secretion product of the cephalic glands of nurse bees that has been used for centuries for itsextraordinary properties and health effects. This bibliographic study aims to review many of the scientific findingsand research that prove many of the remarkable various actions, effects and some uses of royal jelly. There are takeninto consideration numerous biological properties and effects of royal jelly: antioxidant, neurotrophic, hipoglicemiant, hipocholesterolemiant and hepatoprotective, hypotensive and blood pressure regulatory, antitumor, antibiotic, anti-inflammatory, immunomodulatory and anti-allergic, general tonic and antiaging. Royal jelly is one ofthe most studied bee products, but there still remains much to reveal about its biochemistry and biological activity infuture research for our health and life benefit.

  1. Recurrent neural network based hybrid model for reconstructing gene regulatory network.

    Science.gov (United States)

    Raza, Khalid; Alam, Mansaf

    2016-10-01

    One of the exciting problems in systems biology research is to decipher how genome controls the development of complex biological system. The gene regulatory networks (GRNs) help in the identification of regulatory interactions between genes and offer fruitful information related to functional role of individual gene in a cellular system. Discovering GRNs lead to a wide range of applications, including identification of disease related pathways providing novel tentative drug targets, helps to predict disease response, and also assists in diagnosing various diseases including cancer. Reconstruction of GRNs from available biological data is still an open problem. This paper proposes a recurrent neural network (RNN) based model of GRN, hybridized with generalized extended Kalman filter for weight update in backpropagation through time training algorithm. The RNN is a complex neural network that gives a better settlement between biological closeness and mathematical flexibility to model GRN; and is also able to capture complex, non-linear and dynamic relationships among variables. Gene expression data are inherently noisy and Kalman filter performs well for estimation problem even in noisy data. Hence, we applied non-linear version of Kalman filter, known as generalized extended Kalman filter, for weight update during RNN training. The developed model has been tested on four benchmark networks such as DNA SOS repair network, IRMA network, and two synthetic networks from DREAM Challenge. We performed a comparison of our results with other state-of-the-art techniques which shows superiority of our proposed model. Further, 5% Gaussian noise has been induced in the dataset and result of the proposed model shows negligible effect of noise on results, demonstrating the noise tolerance capability of the model. Copyright © 2016 Elsevier Ltd. All rights reserved.

  2. 76 FR 21932 - Self-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Granting...

    Science.gov (United States)

    2011-04-19

    ... statement therein, as follows: I. Introduction On February 4, 2011, the Financial Industry Regulatory...-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Granting Approval of a... Financial Industry Regulatory Authority, Inc. (``FINRA'') to amend Rule 13806 of the Code of Arbitration...

  3. Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks

    Science.gov (United States)

    Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E.; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A.; Kellis, Manolis

    2012-01-01

    Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein–protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level. PMID:22456606

  4. Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks.

    Science.gov (United States)

    Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A; Kellis, Manolis

    2012-07-01

    Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein-protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level.

  5. Regulatory inspection of nuclear facilities and enforcement by the regulatory body. Safety guide

    International Nuclear Information System (INIS)

    2002-01-01

    The purpose of this Safety Guide is to provide recommendations for regulatory bodies on the inspection of nuclear facilities, regulatory enforcement and related matters. The objective is to provide the regulatory body with a high level of confidence that operators have the processes in place to ensure compliance and that they do comply with legal requirements, including meeting the safety objectives and requirements of the regulatory body. However, in the event of non-compliance, the regulatory body should take appropriate enforcement action. This Safety Guide covers regulatory inspection and enforcement in relation to nuclear facilities such as: enrichment and fuel manufacturing plants; nuclear power plants; other reactors such as research reactors and critical assemblies; spent fuel reprocessing plants; and facilities for radioactive waste management, such as treatment, storage and disposal facilities. This Safety Guide also covers issues relating to the decommissioning of nuclear facilities, the closure of waste disposal facilities and site rehabilitation. Section 2 sets out the objectives of regulatory inspection and enforcement. Section 3 covers the management of regulatory inspections. Section 4 covers the performance of regulatory inspections, including internal guidance, planning and preparation, methods of inspection and reports of inspections. Section 5 deals with regulatory enforcement actions. Section 6 covers the assessment of regulatory inspections and enforcement activities. The Appendix provides further details on inspection areas for nuclear facilities

  6. Bringing nanomedicines to market: regulatory challenges, opportunities, and uncertainties.

    Science.gov (United States)

    Nijhara, Ruchika; Balakrishnan, Krishna

    2006-06-01

    Scientists and entrepreneurs who contemplate developing nanomedicine products face several unique challenges in addition to many of the traditional hurdles of product development. In this review we analyze the major physicochemical, biologic and functional characteristics of several nanomedicine products on the market and explore the question of what made them unique. What made them successful? We also focus on the regulatory challenges faced by nanomedicine product developers. Based on these analyses, we propose the factors that are most likely to contribute to the success of nanomedicine products.

  7. An Integrated Biological Control System At Hanford

    International Nuclear Information System (INIS)

    Johnson, A.R.; Caudill, J.G.; Giddings, R.F.; Rodriguez, J.M.; Roos, R.C.; Wilde, J.W.

    2010-01-01

    In 1999 an integrated biological control system was instituted at the U.S. Department of Energy's Hanford Site. Successes and changes to the program needed to be communicated to a large and diverse mix of organizations and individuals. Efforts at communication are directed toward the following: Hanford Contractors (Liquid or Tank Waste, Solid Waste, Environmental Restoration, Science and Technology, Site Infrastructure), General Hanford Employees, and Hanford Advisory Board (Native American Tribes, Environmental Groups, Local Citizens, Washington State and Oregon State regulatory agencies). Communication was done through direct interface meetings, individual communication, where appropriate, and broadly sharing program reports. The objectives of the communication efforts was to have the program well coordinated with Hanford contractors, and to have the program understood well enough that all stakeholders would have confidence in the work performed by the program to reduce or elimate spread of radioactive contamination by biotic vectors. Communication of successes and changes to an integrated biological control system instituted in 1999 at the Department of Energy's Hanford Site have required regular interfaces with not only a diverse group of Hanford contractors (i.e., those responsible for liquid or tank waste, solid wastes, environmental restoration, science and technology, and site infrastructure), and general Hanford employees, but also with a consortium of designated stake holders organized as the Hanford Advisory Board (i.e., Native American tribes, various environmental groups, local citizens, Washington state and Oregon regulatory agencies, etc.). Direct interface meetings, individual communication where appropriate, and transparency of the biological control program were the methods and outcome of this effort.

  8. AN INTEGRATED BIOLOGICAL CONTROL SYSTEM AT HANFORD

    Energy Technology Data Exchange (ETDEWEB)

    JOHNSON AR; CAUDILL JG; GIDDINGS RF; RODRIGUEZ JM; ROOS RC; WILDE JW

    2010-02-11

    In 1999 an integrated biological control system was instituted at the U.S. Department of Energy's Hanford Site. Successes and changes to the program needed to be communicated to a large and diverse mix of organizations and individuals. Efforts at communication are directed toward the following: Hanford Contractors (Liquid or Tank Waste, Solid Waste, Environmental Restoration, Science and Technology, Site Infrastructure), General Hanford Employees, and Hanford Advisory Board (Native American Tribes, Environmental Groups, Local Citizens, Washington State and Oregon State regulatory agencies). Communication was done through direct interface meetings, individual communication, where appropriate, and broadly sharing program reports. The objectives of the communication efforts was to have the program well coordinated with Hanford contractors, and to have the program understood well enough that all stakeholders would have confidence in the work performed by the program to reduce or elimated spread of radioactive contamination by biotic vectors. Communication of successes and changes to an integrated biological control system instituted in 1999 at the Department of Energy's Hanford Site have required regular interfaces with not only a diverse group of Hanford contractors (i.e., those responsible for liquid or tank waste, solid wastes, environmental restoration, science and technology, and site infrastructure), and general Hanford employees, but also with a consortium of designated stake holders organized as the Hanford Advisory Board (i.e., Native American tribes, various environmental groups, local citizens, Washington state and Oregon regulatory agencies, etc.). Direct interface meetings, individual communication where appropriate, and transparency of the biological control program were the methods and outcome of this effort.

  9. Regulatory measures of BARC Safety Council to control radiation exposure in BARC Facilities

    International Nuclear Information System (INIS)

    Rajdeep; Jolly, V.M.; Jayarajan, K.

    2018-01-01

    Bhabha Atomic Research Centre is involved in multidisciplinary research and developmental activities, related to peaceful use of nuclear energy including societal benefits. BARC facilities at different parts of India include nuclear fuel fabrication facilities, research reactors, nuclear recycle facilities and various Physics, Chemistry and Biological laboratories. BARC Safety Council (BSC) is the regulatory body for BARC facilities and takes regulatory measures for radiation protection. BSC has many safety committees for radiation protection including Operating Plants Safety Review Committee (OPSRC), Committee to Review Applications for Authorization of Safe Disposal of Radioactive Wastes (CRAASDRW) and Design Safety Review Committees (DSRC) in 2 nd tier and Unit Level Safety Committees (ULSCs) in 3 rd tier under OPSRC

  10. Mechanistically Distinct Pathways of Divergent Regulatory DNA Creation Contribute to Evolution of Human-Specific Genomic Regulatory Networks Driving Phenotypic Divergence of Homo sapiens.

    Science.gov (United States)

    Glinsky, Gennadi V

    2016-09-19

    divergent sequences of regulatory DNA: (i) recombination-associated exaptation of the highly conserved ancestral regulatory DNA segments; (ii) human-specific insertions of transposable elements. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

  11. The role of ionizing radiation in biological control of agricultural pests

    International Nuclear Information System (INIS)

    Mansour, M.

    2011-01-01

    Although the commercial biological control industry is growing, it still represents only a small portion of the international market of pest control sales (about 3%). This low ratio is due to several factors including high cost of production of biological control agents and technical and regulatory difficulties that complicate the shipping procedures and create trade barriers. This article summarizes the role of ionizing radiation in supporting the use of biological control agents in insect pest control and concentrates on its role in the production, transport, distribution, and release of parasites and predators and the advantages that ionizing radiation can offer, in comparison with traditional techniques. (author)

  12. Assessing the relevance of ecotoxicological studies for regulatory decision making.

    Science.gov (United States)

    Rudén, Christina; Adams, Julie; Ågerstrand, Marlene; Brock, Theo Cm; Poulsen, Veronique; Schlekat, Christian E; Wheeler, James R; Henry, Tala R

    2017-07-01

    Regulatory policies in many parts of the world recognize either the utility of or the mandate that all available studies be considered in environmental or ecological hazard and risk assessment (ERA) of chemicals, including studies from the peer-reviewed literature. Consequently, a vast array of different studies and data types need to be considered. The first steps in the evaluation process involve determining whether the study is relevant to the ERA and sufficiently reliable. Relevance evaluation is typically performed using existing guidance but involves application of "expert judgment" by risk assessors. In the present paper, we review published guidance for relevance evaluation and, on the basis of the practical experience within the group of authors, we identify additional aspects and further develop already proposed aspects that should be considered when conducting a relevance assessment for ecotoxicological studies. From a regulatory point of view, the overarching key aspect of relevance concerns the ability to directly or indirectly use the study in ERA with the purpose of addressing specific protection goals and ultimately regulatory decision making. Because ERA schemes are based on the appropriate linking of exposure and effect estimates, important features of ecotoxicological studies relate to exposure relevance and biological relevance. Exposure relevance addresses the representativeness of the test substance, environmental exposure media, and exposure regime. Biological relevance deals with the environmental significance of the test organism and the endpoints selected, the ecological realism of the test conditions simulated in the study, as well as a mechanistic link of treatment-related effects for endpoints to the protection goal identified in the ERA. In addition, uncertainties associated with relevance should be considered in the assessment. A systematic and transparent assessment of relevance is needed for regulatory decision making. The relevance

  13. Integrated Approach to Reconstruction of Microbial Regulatory Networks

    Energy Technology Data Exchange (ETDEWEB)

    Rodionov, Dmitry A [Sanford-Burnham Medical Research Institute; Novichkov, Pavel S [Lawrence Berkeley National Laboratory

    2013-11-04

    This project had the goal(s) of development of integrated bioinformatics platform for genome-scale inference and visualization of transcriptional regulatory networks (TRNs) in bacterial genomes. The work was done in Sanford-Burnham Medical Research Institute (SBMRI, P.I. D.A. Rodionov) and Lawrence Berkeley National Laboratory (LBNL, co-P.I. P.S. Novichkov). The developed computational resources include: (1) RegPredict web-platform for TRN inference and regulon reconstruction in microbial genomes, and (2) RegPrecise database for collection, visualization and comparative analysis of transcriptional regulons reconstructed by comparative genomics. These analytical resources were selected as key components in the DOE Systems Biology KnowledgeBase (SBKB). The high-quality data accumulated in RegPrecise will provide essential datasets of reference regulons in diverse microbes to enable automatic reconstruction of draft TRNs in newly sequenced genomes. We outline our progress toward the three aims of this grant proposal, which were: Develop integrated platform for genome-scale regulon reconstruction; Infer regulatory annotations in several groups of bacteria and building of reference collections of microbial regulons; and Develop KnowledgeBase on microbial transcriptional regulation.

  14. From cell biology to immunology: Controlling metastatic progression of cancer via microRNA regulatory networks.

    Science.gov (United States)

    Park, Jae Hyon; Theodoratou, Evropi; Calin, George A; Shin, Jae Il

    2016-01-01

    Recently, the study of microRNAs has expanded our knowledge of the fundamental processes of cancer biology and the underlying mechanisms behind tumor metastasis. Extensive research in the fields of microRNA and its novel mechanisms of actions against various cancers has more recently led to the trial of a first cancer-targeted microRNA drug, MRX34. Yet, these microRNAs are mostly being studied and clinically trialed solely based on the understanding of their cell biologic effects, thus, neglecting the important immunologic effects that are sometimes opposite of the cell biologic effects. Here, we summarize both the cell biologic and immunologic effects of various microRNAs and discuss the importance of considering both effects before using them in clinical settings. We stress the importance of understanding the miRNA's effect on cancer metastasis from a "systems" perspective before developing a miRNA-targeted therapeutic in treating cancer metastasis.

  15. Biosimilars in psoriasis: Clinical practice and regulatory perspectives in Latin America.

    Science.gov (United States)

    de la Cruz, Claudia; de Carvalho, André V E; Dorantes, Gladys L; Londoño Garcia, Angela M; Gonzalez, Cesar; Maskin, Matías; Podoswa, Nancy; Redfern, Jan S; Valenzuela, Fernando; van der Walt, Joelle; Romiti, Ricardo

    2017-01-01

    Latin American countries view biosimilar agents as an effective approach to curtail health-care expenditures while maintaining the safety and efficacy profile of their branded innovator comparators. To understand the complexities of the regulatory landscape and key therapeutic issues for use of biosimilars to treat moderate to severe psoriasis in Latin America, the International Psoriasis Council convened dermatology experts from Argentina, Brazil, Chile, Colombia and Mexico in October 2015 to review the definition, approval, marketing and future of biosimilars in each country and develop a consensus statement. The regulatory framework for marketing approval of biosimilars in Latin America is currently a mosaic of disparate, country-specific, regulatory review processes, rules and standards, with considerable heterogeneity in clarity and specificity. Regulations in Argentina, Brazil, Chile and Mexico have undergone multiple refinements whereas Colombia is finalizing draft guidelines. Verification of the similarity in quality, safety and efficacy of biosimilars to the innovator biologic remains a key challenge for policy makers and regulatory authorities. Other key regulatory challenges include: naming of agents and traceability, pharmacovigilance, extrapolation of indications, and interchangeability and substitution. An urgent need exists for more Latin American countries to establish national psoriasis registries and to integrate their common components into a multinational psoriasis network, thereby enhancing their interpretative power and impact. A Latin American psoriasis network similar to PSONET in Europe would assist health-care providers, pharmaceutical companies, regulators and patients to fully comprehend specific products being prescribed and dispensed and to identify potential regional trends or differences in safety or outcomes. © 2016 Japanese Dermatological Association.

  16. Predictive minimum description length principle approach to inferring gene regulatory networks.

    Science.gov (United States)

    Chaitankar, Vijender; Zhang, Chaoyang; Ghosh, Preetam; Gong, Ping; Perkins, Edward J; Deng, Youping

    2011-01-01

    Reverse engineering of gene regulatory networks using information theory models has received much attention due to its simplicity, low computational cost, and capability of inferring large networks. One of the major problems with information theory models is to determine the threshold that defines the regulatory relationships between genes. The minimum description length (MDL) principle has been implemented to overcome this problem. The description length of the MDL principle is the sum of model length and data encoding length. A user-specified fine tuning parameter is used as control mechanism between model and data encoding, but it is difficult to find the optimal parameter. In this work, we propose a new inference algorithm that incorporates mutual information (MI), conditional mutual information (CMI), and predictive minimum description length (PMDL) principle to infer gene regulatory networks from DNA microarray data. In this algorithm, the information theoretic quantities MI and CMI determine the regulatory relationships between genes and the PMDL principle method attempts to determine the best MI threshold without the need of a user-specified fine tuning parameter. The performance of the proposed algorithm is evaluated using both synthetic time series data sets and a biological time series data set (Saccharomyces cerevisiae). The results show that the proposed algorithm produced fewer false edges and significantly improved the precision when compared to existing MDL algorithm.

  17. The transcriptional regulatory network of Mycobacterium tuberculosis.

    Directory of Open Access Journals (Sweden)

    Joaquín Sanz

    Full Text Available Under the perspectives of network science and systems biology, the characterization of transcriptional regulatory (TR networks beyond the context of model organisms offers a versatile tool whose potential remains yet mainly unexplored. In this work, we present an updated version of the TR network of Mycobacterium tuberculosis (M.tb, which incorporates newly characterized transcriptional regulations coming from 31 recent, different experimental works available in the literature. As a result of the incorporation of these data, the new network doubles the size of previous data collections, incorporating more than a third of the entire genome of the bacterium. We also present an exhaustive topological analysis of the new assembled network, focusing on the statistical characterization of motifs significances and the comparison with other model organisms. The expanded M.tb transcriptional regulatory network, considering its volume and completeness, constitutes an important resource for diverse tasks such as dynamic modeling of gene expression and signaling processes, computational reliability determination or protein function prediction, being the latter of particular relevance, given that the function of only a small percent of the proteins of M.tb is known.

  18. Regulatory guidance document

    International Nuclear Information System (INIS)

    1994-05-01

    The Office of Civilian Radioactive Waste Management (OCRWM) Program Management System Manual requires preparation of the OCRWM Regulatory Guidance Document (RGD) that addresses licensing, environmental compliance, and safety and health compliance. The document provides: regulatory compliance policy; guidance to OCRWM organizational elements to ensure a consistent approach when complying with regulatory requirements; strategies to achieve policy objectives; organizational responsibilities for regulatory compliance; guidance with regard to Program compliance oversight; and guidance on the contents of a project-level Regulatory Compliance Plan. The scope of the RGD includes site suitability evaluation, licensing, environmental compliance, and safety and health compliance, in accordance with the direction provided by Section 4.6.3 of the PMS Manual. Site suitability evaluation and regulatory compliance during site characterization are significant activities, particularly with regard to the YW MSA. OCRWM's evaluation of whether the Yucca Mountain site is suitable for repository development must precede its submittal of a license application to the Nuclear Regulatory Commission (NRC). Accordingly, site suitability evaluation is discussed in Chapter 4, and the general statements of policy regarding site suitability evaluation are discussed in Section 2.1. Although much of the data and analyses may initially be similar, the licensing process is discussed separately in Chapter 5. Environmental compliance is discussed in Chapter 6. Safety and Health compliance is discussed in Chapter 7

  19. Follow-on biologics: data exclusivity and the balance between innovation and competition.

    Science.gov (United States)

    Grabowski, Henry

    2008-06-01

    Legislation to create a regulatory pathway for follow-on biologics is currently being considered by the United States Congress. A critical issue in this respect is the period of data exclusivity for innovator companies before a follow-on competitor can rely in part on data obtained for an original biologic for an abbreviated approval. Given the nature of patents on biologics, the period of data exclusivity is anticipated to have a key role in determining how quickly follow-on competitors emerge, and consequently also on the time available for originator companies to recoup their investment. With this issue in mind, this article discusses factors influencing return on investment on biologic research and development. A break-even analysis for a representative portfolio of biologics provides support for a substantial data exclusivity period.

  20. 75 FR 11166 - Joint Meeting of the Nuclear Regulatory Commission and the Federal Energy Regulatory Commission...

    Science.gov (United States)

    2010-03-10

    ... the Nuclear Regulatory Commission and the Federal Energy Regulatory Commission; Notice of Joint Meeting of the Nuclear Regulatory Commission and the Federal Energy Regulatory Commission March 2, 2010. The Federal Energy Regulatory Commission (FERC) and the Nuclear Regulatory Commission (NRC) will hold...

  1. Facilitating a More Efficient Commercial Review Process for Pediatric Drugs and Biologics

    Directory of Open Access Journals (Sweden)

    Ryan D. Rykhus

    2017-12-01

    Full Text Available Over the past two decades, the biopharmaceutical industry has seen unprecedented expansion and innovation in concert with significant technological advancements. While the industry has experienced marked growth, the regulatory system in the United States still operates at a capacity much lower than the influx of new drug and biologic candidates. As a result, it has become standard for months or even years of waiting for commercial approval by the U.S. Food and Drug Administration. These regulatory delays have generated a system that stifles growth and innovation due to the exorbitant costs associated with awaiting approval from the nation’s sole regulatory agency. The recent re-emergence of diseases that impact pediatric demographics represents one particularly acute reason for developing a regulatory system that facilitates a more efficient commercial review process. Herein, we present a range of initiatives that could represent early steps toward alleviating the delays in approving life-saving therapeutics.

  2. Identifying time-delayed gene regulatory networks via an evolvable hierarchical recurrent neural network.

    Science.gov (United States)

    Kordmahalleh, Mina Moradi; Sefidmazgi, Mohammad Gorji; Harrison, Scott H; Homaifar, Abdollah

    2017-01-01

    The modeling of genetic interactions within a cell is crucial for a basic understanding of physiology and for applied areas such as drug design. Interactions in gene regulatory networks (GRNs) include effects of transcription factors, repressors, small metabolites, and microRNA species. In addition, the effects of regulatory interactions are not always simultaneous, but can occur after a finite time delay, or as a combined outcome of simultaneous and time delayed interactions. Powerful biotechnologies have been rapidly and successfully measuring levels of genetic expression to illuminate different states of biological systems. This has led to an ensuing challenge to improve the identification of specific regulatory mechanisms through regulatory network reconstructions. Solutions to this challenge will ultimately help to spur forward efforts based on the usage of regulatory network reconstructions in systems biology applications. We have developed a hierarchical recurrent neural network (HRNN) that identifies time-delayed gene interactions using time-course data. A customized genetic algorithm (GA) was used to optimize hierarchical connectivity of regulatory genes and a target gene. The proposed design provides a non-fully connected network with the flexibility of using recurrent connections inside the network. These features and the non-linearity of the HRNN facilitate the process of identifying temporal patterns of a GRN. Our HRNN method was implemented with the Python language. It was first evaluated on simulated data representing linear and nonlinear time-delayed gene-gene interaction models across a range of network sizes and variances of noise. We then further demonstrated the capability of our method in reconstructing GRNs of the Saccharomyces cerevisiae synthetic network for in vivo benchmarking of reverse-engineering and modeling approaches (IRMA). We compared the performance of our method to TD-ARACNE, HCC-CLINDE, TSNI and ebdbNet across different network

  3. 75 FR 63878 - Self-Regulatory Organizations; Self-Regulatory Organizations; Notice of Filing and Immediate...

    Science.gov (United States)

    2010-10-18

    ...-Regulatory Organizations; Self-Regulatory Organizations; Notice of Filing and Immediate Effectiveness of...(b)(1). \\2\\ 17 CFR 240.19b-4. I. Self-Regulatory Organization's Statement of the Terms of Substance... Public Reference Room. II. Self-Regulatory Organization's Statement of the Purpose of, and Statutory...

  4. The Logical Properties of Lower and Upper Approximation Operations in Rough Sets%粗集中上下近似运算的逻辑性质

    Institute of Scientific and Technical Information of China (English)

    祝峰; 何华灿

    2000-01-01

    In this paper,we discuss the logical properties of rough sets through topological boolean algebras and closure topological boolean algebras.We get representation theorems of finite topological boolean algebras and closure topological boolean algebras under the upper-lower relation condition,which establish the relationship between topological boolean algebras or closure topological boolean algebras and rough sets in the general sets are similar to the Stone's representation theorem of boolean algebras.

  5. Biosimilars: a regulatory perspective from America.

    Science.gov (United States)

    Kay, Jonathan

    2011-05-12

    Biosimilars are protein products that are sufficiently similar to a biopharmaceutical already approved by a regulatory agency. Several biotechnology companies and generic drug manufacturers in Asia and Europe are developing biosimilars of tumor necrosis factor inhibitors and rituximab. A biosimilar etanercept is already being marketed in Colombia and China. In the US, several natural source products and recombinant proteins have been approved as generic drugs under Section 505(b)(2) of the Food, Drug, and Cosmetic Act. However, because the complexity of large biopharmaceuticals makes it difficult to demonstrate that a biosimilar is structurally identical to an already approved biopharmaceutical, this Act does not apply to biosimilars of large biopharmaceuticals. Section 7002 of the Patient Protection and Affordable Care Act of 2010, which is referred to as the Biologics Price Competition and Innovation Act of 2009, amends Section 351 of the Public Health Service Act to create an abbreviated pathway that permits a biosimilar to be evaluated by comparing it with only a single reference biological product. This paper reviews the processes for approval of biosimilars in the US and the European Union and highlights recent changes in federal regulations governing the approval of biosimilars in the US.

  6. Sustainability, natural and organic cosmetics: consumer, products, efficacy, toxicological and regulatory considerations

    Directory of Open Access Journals (Sweden)

    Bruno Fonseca-Santos

    2015-03-01

    Full Text Available The interest in sustainable products has increased along the years, since the choice of products, packaging and production processes have a great impact on the environment. These products are classified by regulatory agencies in different categories, aggregating advantages to the product and increasing the demand by consumers. However, there is no harmonization in guidelines of these certifying agencies and each cosmetic industry formulates their product and packaging in a more rational way, which causes less damage to the environment. Many cosmetic products have in their formulation natural products that perform a specific biological function, but these products should be evaluated on efficacy and toxicological aspects. The aim of this article is to approach sustainability, natural and organic cosmetics, considering the consumer and the efficacy, toxicological and regulatory aspects.

  7. Evolution of Cis-Regulatory Elements and Regulatory Networks in Duplicated Genes of Arabidopsis.

    Science.gov (United States)

    Arsovski, Andrej A; Pradinuk, Julian; Guo, Xu Qiu; Wang, Sishuo; Adams, Keith L

    2015-12-01

    Plant genomes contain large numbers of duplicated genes that contribute to the evolution of new functions. Following duplication, genes can exhibit divergence in their coding sequence and their expression patterns. Changes in the cis-regulatory element landscape can result in changes in gene expression patterns. High-throughput methods developed recently can identify potential cis-regulatory elements on a genome-wide scale. Here, we use a recent comprehensive data set of DNase I sequencing-identified cis-regulatory binding sites (footprints) at single-base-pair resolution to compare binding sites and network connectivity in duplicated gene pairs in Arabidopsis (Arabidopsis thaliana). We found that duplicated gene pairs vary greatly in their cis-regulatory element architecture, resulting in changes in regulatory network connectivity. Whole-genome duplicates (WGDs) have approximately twice as many footprints in their promoters left by potential regulatory proteins than do tandem duplicates (TDs). The WGDs have a greater average number of footprint differences between paralogs than TDs. The footprints, in turn, result in more regulatory network connections between WGDs and other genes, forming denser, more complex regulatory networks than shown by TDs. When comparing regulatory connections between duplicates, WGDs had more pairs in which the two genes are either partially or fully diverged in their network connections, but fewer genes with no network connections than the TDs. There is evidence of younger TDs and WGDs having fewer unique connections compared with older duplicates. This study provides insights into cis-regulatory element evolution and network divergence in duplicated genes. © 2015 American Society of Plant Biologists. All Rights Reserved.

  8. Risk assessment for federal regulatory decisions on organisms produced through biotechnology

    International Nuclear Information System (INIS)

    Payne, John H.; Medley, Terry L.

    1992-01-01

    This article discusses: 1. Purposes and history of risk assessment: application to biotechnology; 2. Framework in the United States for decisions on organisms produced through biotechnology; 3. Choosing from among potential approaches to assessment: a). exposure assessment does not equate to risk assessment: what are the hazards?; b). Setting risk assessment priorities; c). 'Quantitative' environmental and 'quantitative' ecological risk assessments; d). Ecological risk assessments based on biological and ecological principles. 4. The bases for good regulatory decisions

  9. Risk assessment for federal regulatory decisions on organisms produced through biotechnology

    Energy Technology Data Exchange (ETDEWEB)

    Payne, John H; Medley, Terry L [Biotechnology, Biologics and Environmental Protection Animal and Plant Health Inspection Service, U.S. Department of Agriculture, Hyattsville, MD (United States)

    1992-07-01

    This article discusses: 1. Purposes and history of risk assessment: application to biotechnology; 2. Framework in the United States for decisions on organisms produced through biotechnology; 3. Choosing from among potential approaches to assessment: a). exposure assessment does not equate to risk assessment: what are the hazards?; b). Setting risk assessment priorities; c). 'Quantitative' environmental and 'quantitative' ecological risk assessments; d). Ecological risk assessments based on biological and ecological principles. 4. The bases for good regulatory decisions.

  10. SELANSI: a toolbox for simulation of stochastic gene regulatory networks.

    Science.gov (United States)

    Pájaro, Manuel; Otero-Muras, Irene; Vázquez, Carlos; Alonso, Antonio A

    2018-03-01

    Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding Chemical Master Equation with a partial integral differential equation that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. SELANSI runs under the MATLAB environment, and is available under GPLv3 license at https://sites.google.com/view/selansi. antonio@iim.csic.es. © The Author(s) 2017. Published by Oxford University Press.

  11. Inferring regulatory networks from expression data using tree-based methods.

    Directory of Open Access Journals (Sweden)

    Vân Anh Huynh-Thu

    2010-09-01

    Full Text Available One of the pressing open problems of computational systems biology is the elucidation of the topology of genetic regulatory networks (GRNs using high throughput genomic data, in particular microarray gene expression data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM challenge aims to evaluate the success of GRN inference algorithms on benchmarks of simulated data. In this article, we present GENIE3, a new algorithm for the inference of GRNs that was best performer in the DREAM4 In Silico Multifactorial challenge. GENIE3 decomposes the prediction of a regulatory network between p genes into p different regression problems. In each of the regression problems, the expression pattern of one of the genes (target gene is predicted from the expression patterns of all the other genes (input genes, using tree-based ensemble methods Random Forests or Extra-Trees. The importance of an input gene in the prediction of the target gene expression pattern is taken as an indication of a putative regulatory link. Putative regulatory links are then aggregated over all genes to provide a ranking of interactions from which the whole network is reconstructed. In addition to performing well on the DREAM4 In Silico Multifactorial challenge simulated data, we show that GENIE3 compares favorably with existing algorithms to decipher the genetic regulatory network of Escherichia coli. It doesn't make any assumption about the nature of gene regulation, can deal with combinatorial and non-linear interactions, produces directed GRNs, and is fast and scalable. In conclusion, we propose a new algorithm for GRN inference that performs well on both synthetic and real gene expression data. The algorithm, based on feature selection with tree-based ensemble methods, is simple and generic, making it adaptable to other types of genomic data and interactions.

  12. Inflammation, Self-Regulation, and Health: An Immunologic Model of Self-Regulatory Failure.

    Science.gov (United States)

    Shields, Grant S; Moons, Wesley G; Slavich, George M

    2017-07-01

    Self-regulation is a fundamental human process that refers to multiple complex methods by which individuals pursue goals in the face of distractions. Whereas superior self-regulation predicts better academic achievement, relationship quality, financial and career success, and lifespan health, poor self-regulation increases a person's risk for negative outcomes in each of these domains and can ultimately presage early mortality. Given its centrality to understanding the human condition, a large body of research has examined cognitive, emotional, and behavioral aspects of self-regulation. In contrast, relatively little attention has been paid to specific biologic processes that may underlie self-regulation. We address this latter issue in the present review by examining the growing body of research showing that components of the immune system involved in inflammation can alter neural, cognitive, and motivational processes that lead to impaired self-regulation and poor health. Based on these findings, we propose an integrated, multilevel model that describes how inflammation may cause widespread biobehavioral alterations that promote self-regulatory failure. This immunologic model of self-regulatory failure has implications for understanding how biological and behavioral factors interact to influence self-regulation. The model also suggests new ways of reducing disease risk and enhancing human potential by targeting inflammatory processes that affect self-regulation.

  13. Modeling drug- and chemical- induced hepatotoxicity with systems biology approaches

    Directory of Open Access Journals (Sweden)

    Sudin eBhattacharya

    2012-12-01

    Full Text Available We provide an overview of computational systems biology approaches as applied to the study of chemical- and drug-induced toxicity. The concept of ‘toxicity pathways’ is described in the context of the 2007 US National Academies of Science report, Toxicity testing in the 21st Century: A Vision and A Strategy. Pathway mapping and modeling based on network biology concepts are a key component of the vision laid out in this report for a more biologically-based analysis of dose-response behavior and the safety of chemicals and drugs. We focus on toxicity of the liver (hepatotoxicity – a complex phenotypic response with contributions from a number of different cell types and biological processes. We describe three case studies of complementary multi-scale computational modeling approaches to understand perturbation of toxicity pathways in the human liver as a result of exposure to environmental contaminants and specific drugs. One approach involves development of a spatial, multicellular virtual tissue model of the liver lobule that combines molecular circuits in individual hepatocytes with cell-cell interactions and blood-mediated transport of toxicants through hepatic sinusoids, to enable quantitative, mechanistic prediction of hepatic dose-response for activation of the AhR toxicity pathway. Simultaneously, methods are being developing to extract quantitative maps of intracellular signaling and transcriptional regulatory networks perturbed by environmental contaminants, using a combination of gene expression and genome-wide protein-DNA interaction data. A predictive physiological model (DILIsymTM to understand drug-induced liver injury (DILI, the most common adverse event leading to termination of clinical development programs and regulatory actions on drugs, is also described. The model initially focuses on reactive metabolite-induced DILI in response to administration of acetaminophen, and spans multiple biological scales.

  14. Synthetic biology as it relates to CAM photosynthesis: challenges and opportunities.

    Science.gov (United States)

    DePaoli, Henrique C; Borland, Anne M; Tuskan, Gerald A; Cushman, John C; Yang, Xiaohan

    2014-07-01

    To meet future food and energy security needs, which are amplified by increasing population growth and reduced natural resource availability, metabolic engineering efforts have moved from manipulating single genes/proteins to introducing multiple genes and novel pathways to improve photosynthetic efficiency in a more comprehensive manner. Biochemical carbon-concentrating mechanisms such as crassulacean acid metabolism (CAM), which improves photosynthetic, water-use, and possibly nutrient-use efficiency, represent a strategic target for synthetic biology to engineer more productive C3 crops for a warmer and drier world. One key challenge for introducing multigene traits like CAM onto a background of C3 photosynthesis is to gain a better understanding of the dynamic spatial and temporal regulatory events that underpin photosynthetic metabolism. With the aid of systems and computational biology, vast amounts of experimental data encompassing transcriptomics, proteomics, and metabolomics can be related in a network to create dynamic models. Such models can undergo simulations to discover key regulatory elements in metabolism and suggest strategic substitution or augmentation by synthetic components to improve photosynthetic performance and water-use efficiency in C3 crops. Another key challenge in the application of synthetic biology to photosynthesis research is to develop efficient systems for multigene assembly and stacking. Here, we review recent progress in computational modelling as applied to plant photosynthesis, with attention to the requirements for CAM, and recent advances in synthetic biology tool development. Lastly, we discuss possible options for multigene pathway construction in plants with an emphasis on CAM-into-C3 engineering. © The Author 2014. Published by Oxford University Press on behalf of the Society for Experimental Biology. All rights reserved. For permissions, please email: journals.permissions@oup.com.

  15. The core to regulatory reform

    International Nuclear Information System (INIS)

    Partridge, J.W. Jr.

    1993-01-01

    Federal Energy Regulatory Commission (FERC) Orders 436, 500, and 636, the Clean Air Act Amendments of 1990, Public Utility Holding Company Act reform, and the 1992 Energy Policy Act all can have significant effects on an LDC's operations. Such changes in an LDC's environments must be balanced by changes within the utility, its marketplace, and its state regulatory environment. The question is where to start. For Columbia Gas Distribution Cos., based in Columbus, OH, the new operating foundation begins with each employee. Internal strength is critical in designing initiatives that meet the needs of the marketplace and are well-received by regulators. Employees must understand not only the regulatory environment in which the LDC operates, but also how their work contributes to a positive regulatory relationship. To achieve this, Columbia initiated the COntinuing Regulatory Education program, or CORE, in 1991. CORE is a regulatory-focused, information-initiative program coordinated by Columbia's Regulatory Policy, Planning, and Government Affairs Department. The CORE programs can take many forms, such as emerging issue discussions, dialogues with regulators and key parties, updates on regulatory fillings, regulatory policy meetings, and formal training classes. The speakers and discussion facilitators can range from human resource department trainers to senior officers, from regulatory department staff members to external experts, or from state commissioners to executives from other LDCs. The goals of CORE initiatives are to: Support a professional level of regulatory expertise through employee participation in well-developed regulatory programs presented by credible experts. Encourage a constructive state regulatory environment founded on communication and cooperation. CORE achieves these goals via five program levels: introductory basics, advanced learning, professional expertise, crossfunctional dialogues, and external idea exchanges

  16. 76 FR 66344 - Self-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Approving...

    Science.gov (United States)

    2011-10-26

    ...-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Approving Proposed Rule Change... 31, 2011, Financial Industry Regulatory Authority, Inc. (``FINRA'') (f/k/a National Association of... consolidation process, see Information Notice, March 12, 2008 (Rulebook Consolidation Process). For convenience...

  17. 75 FR 17456 - Self-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Approving...

    Science.gov (United States)

    2010-04-06

    ...-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Order Approving Proposed Rule Change..., Financial Industry Regulatory Authority, Inc. (``FINRA'') filed with the Securities and Exchange Commission... terms. For more information about the rulebook consolidation process, see Information Notice, March 12...

  18. Node fingerprinting: an efficient heuristic for aligning biological networks.

    Science.gov (United States)

    Radu, Alex; Charleston, Michael

    2014-10-01

    With the continuing increase in availability of biological data and improvements to biological models, biological network analysis has become a promising area of research. An emerging technique for the analysis of biological networks is through network alignment. Network alignment has been used to calculate genetic distance, similarities between regulatory structures, and the effect of external forces on gene expression, and to depict conditional activity of expression modules in cancer. Network alignment is algorithmically complex, and therefore we must rely on heuristics, ideally as efficient and accurate as possible. The majority of current techniques for network alignment rely on precomputed information, such as with protein sequence alignment, or on tunable network alignment parameters, which may introduce an increased computational overhead. Our presented algorithm, which we call Node Fingerprinting (NF), is appropriate for performing global pairwise network alignment without precomputation or tuning, can be fully parallelized, and is able to quickly compute an accurate alignment between two biological networks. It has performed as well as or better than existing algorithms on biological and simulated data, and with fewer computational resources. The algorithmic validation performed demonstrates the low computational resource requirements of NF.

  19. 78 FR 62784 - Self-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Notice of...

    Science.gov (United States)

    2013-10-22

    ...-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Notice of Designation of a Longer... 5210 (Publication of Transactions and Quotations) October 4, 2013. I. Introduction On August 15, 2013, Financial Industry Regulatory Authority, Inc. (``FINRA'') filed with the Securities and Exchange Commission...

  20. Training and the personnel accreditation of regulatory functions in the Argentine Republic

    International Nuclear Information System (INIS)

    Menossi, C.A.; Fraire, E.O.; Segado, R.C.

    1998-01-01

    Teaching and the training are indispensable for the development of the human resources in all disciplines and occupations of the man in the world scale. About the applications of the radionuclides in the nuclear industry, in Argentina, during the last years, the efforts have been intensified. The necessity of improving the capacity of answer in radiation protection and nuclear safety demands an focus integrated in the teaching and the training. The radiological protection and the nuclear safety presents elements of the applied physics, the chemistry, the biology, the nuclear technology and other specialized subjects. However, in relation with the development of the human resources, specially those that belong to regulatory bodies and perform inspection functions, have important differences, necessities and specific problems. Some differences and problems emerge of the wide diversity and reach of the radiological and nuclear applications. Nowadays, in the world, the applications of the radiation and radioactive sources are being diversified in the medicine (diagnosis, radiotherapy, nuclear medicine, the industry, the agricultures, and the investigation and teaching), that involve a permanent knowledge and actualization of the personnel of the regulatory bodies. For that exposed this work describe training program for the personnel with regulatory functions (inspectors) of the Nuclear Regulatory Authority in the Argentine Republic. Also, this document includes the description of the basic formation and specialized in each case and it reach. (author)