An implementation of the Gillespie algorithm for RNA kinetics with logarithmic time update

In this paper I outline a fast method called KFOLD for implementing the Gillepie algorithm to stochastically sample the folding kinetics of an RNA molecule at single base-pair resolution. In the same fashion as the KINFOLD algorithm, which also uses the Gillespie algorithm to predict folding kinetics, KFOLD stochastically chooses a new RNA secondary structure state that is accessible from the current state by a single base-pair addition/deletion following the Gillespie procedure. However, unlike KINFOLD, the KFOLD algorithm utilizes the fact that many of the base-pair addition/deletion reactions and their corresponding rates do not change between each step in the algorithm. This allows KFOLD to achieve a substantial speed-up in the time required to compute a prediction of the folding pathway and, for a fixed number of base-pair moves, performs logarithmically with sequence size. This increase in speed opens up the possibility of studying the kinetics of much longer RNA sequences at single base-pair resolution while also allowing for the RNA folding statistics of smaller RNA sequences to be computed much more quickly.     

Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling

Background  

The understanding of regulatory and signaling networks has long been a core objective in Systems Biology. Knowledge about these networks is mainly of qualitative nature, which allows the construction of Boolean models, where the state of a component is either 'off' or 'on'. While often able to capture the essential behavior of a network, these models can never reproduce detailed time courses of concentration levels.     

Musculoskeletal-see-through mirror: Computational modeling and algorithm for whole-body muscle activity visualization in real time

In this paper, we present a system that estimates and visualizes muscle tensions in real time using optical motion capture and electromyography (EMG). The system overlays rendered musculoskeletal human model on top of a live video image of the subject. The subject therefore has an impression that he/she sees the muscles with tension information through the cloth and skin. The main technical challenge lies in real-time estimation of muscle tension. Since existing algorithms using mathematical optimization to distribute joint torques to muscle tensions are too slow for our purpose, we develop a new algorithm that computes a reasonable approximation of muscle tensions based on the internal connections between muscles known as neuronal binding. The algorithm can estimate the tensions of 274 muscles in only 16 ms, and the whole visualization system runs at about 15 fps. The developed system is applied to assisting sport training, and the user case studies show its usefulness. Possible applications include interfaces for assisting rehabilitation.     

连续性空间分布型模型与应用研究

本文对Pearson-Ⅲ分布与指数分布的空间分布型特征进行了探讨,发现它们的精确性高于经典的频次分布。导出Pearson-Ⅲ分布与指数分布的空间分布型判定指标和抽样量公式,并对赤霉病菌源的分布型和抽样量进行分析,最后指出连续性空间分布型模型的优越性。     

DNA algorithm for an unbounded fan-in Boolean circuit

In this paper, we present a new DNA-based evaluation algorithm for a Boolean circuit that employs standard bio-molecular techniques. The algorithm operates on an unbounded fan-in Boolean circuit consisting of AND and OR gates. The whole simulation of our algorithm is proposed in a single test tube in O(1) time complexity and is much easier to implement in the laboratory than previously described models. Furthermore, the algorithm allows for evaluating any number of Boolean circuits in parallel in a single test tube.     

Boolean modeling techniques for protein co-expression networks in systems medicine

Introduction: Application of systems biology/systems medicine approaches is promising for proteomics/biomedical research, but requires selection of an adequate modeling type.

Areas covered: This article reviews the existing Boolean network modeling approaches, which provide in comparison with alternative modeling techniques several advantages for the processing of proteomics data. Application of methods for inference, reduction and validation of protein co-expression networks that are derived from quantitative high-throughput proteomics measurements is presented. It’s also shown how Boolean models can be used to derive system-theoretic characteristics that describe both the dynamical behavior of such networks as a whole and the properties of different cell states (e.g. healthy or diseased cell states). Furthermore, application of methods derived from control theory is proposed in order to simulate the effects of therapeutic interventions on such networks, which is a promising approach for the computer-assisted discovery of biomarkers and drug targets. Finally, the clinical application of Boolean modeling analyses is discussed.

Expert commentary: Boolean modeling of proteomics data is still in its infancy. Progress in this field strongly depends on provision of a repository with public access to relevant reference models. Also required are community supported standards that facilitate input of both proteomics and patient related data (e.g. age, gender, laboratory results, etc.).     

Boolean network analysis of a neurotransmitter signaling pathway

BACKGROUND: A Boolean network is a simple computational model that may provide insight into the overall behavior of genetic networks and is represented by variables with two possible states (on/off), of the individual nodes/genes of the network. In this study, a Boolean network model has been used to simulate a molecular pathway between two neurotransmitter receptor, dopamine and glutamate receptor, systems in order to understand the consequence of using logic gate rules between nodes, which have two possible states (active and inactive). RESULTS: The dynamical properties of this Boolean network model of the biochemical pathway shows that, the pathway is stable and that, deletion/knockout of certain biologically important nodes cause significant perturbation to this network. The analysis clearly shows that in addition to the expected components dopamine and dopamine receptor 2 (DRD2), Ca(2+) ions play a critical role in maintaining stability of the pathway. CONCLUSION: So this method may be useful for the identification of potential genetic targets, whose loss of function in biochemical pathways may be responsible for disease onset. The molecular pathway considered in this study has been implicated with a complex disorder like schizophrenia, which has a complex multifactorial etiology.     

Computational modeling of three-dimensional electrodiffusion in biological systems: application to the node of Ranvier

A computational model is presented for the simulation of three-dimensional electrodiffusion of ions. Finite volume techniques were used to solve the Poisson-Nernst-Planck equation, and a dual Delaunay-Voronoi mesh was constructed to evaluate fluxes of ions, as well as resulting electric potentials. The algorithm has been validated and applied to a generalized node of Ranvier, where numerical results for computed action potentials agree well with cable model predictions for large clusters of voltage-gated ion channels. At smaller channel clusters, however, the three-dimensional electrodiffusion predictions diverge from the cable model predictions and show a broadening of the action potential, indicating a significant effect due to each channel's own local electric field. The node of Ranvier complex is an elaborate organization of membrane-bound aqueous compartments, and the model presented here represents what we believe is a significant first step in simulating electrophysiological events with combined realistic structural and physiological data.     

Use of telemetry in the development and application of biological criteria for habitat hydraulic modeling

Neodiaptomus songkhramensis n. sp. from 86 temporary waters in the vicinity of Song Khram River in northeast Thailand is described and figured. It was found during May and June (rainy season) in Sakon Nakhon, Nakhon Pranom and Udon Thani Provinces. The new species usually co-occurs with 1–5 other diaptomids; the most frequently co-occurring species are Neodiaptomus blachei, Tropodiaptomus oryzanus, Neodiaptomus yangtsekiangensis, Dentodiaptomus javanus and Eodiaptomus phuphanensis.     

A SAT-based algorithm for finding attractors in synchronous Boolean networks

This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.     

Simulation as experiment: a philosophical reassessment for biological modeling

Some scientific modelers suggest that complex simulation models that mimic biological processes should have a limited place in ecological and evolutionary studies. However, complex simulation models can have a role that is different from that of simpler models that are designed to be fit to data. Simulation can be viewed as another kind of experimental system and should be analyzed as such. Here, I argue that current discussions in the philosophy of science and in the physical sciences fields about the use of simulation as an experimental system have important implications for biology, especially complex sciences such as evolution and ecology. Simulation models can be used to mimic complex systems, but unlike nature, can be manipulated in ways that would be impossible, too costly or unethical to do in natural systems. Simulation can add to theory development and testing, can offer hypotheses about the way the world works and can give guidance as to which data are most important to gather experimentally.     

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

ABSTRACT: BACKGROUND: Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs). As a logical model, probabilistic Boolean networks (PBNs) consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n) or O(nN2n) for a sparse matrix. RESULTS: This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN). An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n), where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational complexity of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a 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.     

Template-based intervention in Boolean network models of biological systems

Motivation

A grand challenge in the modeling of biological systems is the identification of key variables which can act as targets for intervention. Boolean networks are among the simplest of models, yet they have been shown to adequately model many of the complex dynamics of biological systems. In our recent work, we utilized a logic minimization approach to identify quality single variable targets for intervention from the state space of a Boolean network. However, as the number of variables in a network increases, the more likely it is that a successful intervention strategy will require multiple variables. Thus, for larger networks, such an approach is required in order to identify more complex intervention strategies while working within the limited view of the network’s state space. Specifically, we address three primary challenges for the large network arena: the first challenge is how to consider many subsets of variables, the second is to design clear methods and measures to identify the best targets for intervention in a systematic way, and the third is to work with an intractable state space through sampling.

Results

We introduce a multiple variable intervention target called a template and show through simulation studies of random networks that these templates are able to identify top intervention targets in increasingly large Boolean networks. We first show that, when other methods show drastic loss in performance, template methods show no significant performance loss between fully explored and partially sampled Boolean state spaces. We also show that, when other methods show a complete inability to produce viable intervention targets in sampled Boolean state spaces, template methods maintain significantly consistent success rates even as state space sizes increase exponentially with larger networks. Finally, we show the utility of the template approach on a real-world Boolean network modeling T-LGL leukemia.

Conclusions

Overall, these results demonstrate how template-based approaches now effectively take over for our previous single variable approaches and produce quality intervention targets in larger networks requiring sampled state spaces.

     

mTOR signaling for biological control and cancer

Mammalian target of rapamycin (mTOR) is a major intersection that connects signals from the extracellular milieu to corresponding changes in intracellular processes. When abnormally regulated, the mTOR signaling pathway is implicated in a wide spectrum of cancers, neurological diseases, and proliferative disorders. Therefore, pharmacological agents that restore the regulatory balance of the mTOR pathway could be beneficial for a great number of diseases. This review summarizes current understanding of mTOR signaling and some unanswered questions in the field. We describe the composition of the mTOR complexes, upstream signals that activate mTOR, and physiological processes that mTOR regulates. We also discuss the role of mTOR and its downstream effectors in cancer, obesity and diabetes, and autism. J. Cell. Physiol. 228: 1658–1664, 2013. © 2013 Wiley Periodicals, Inc.