Dataset Information

Estimating Attractor Reachability in Asynchronous Logical Models.

ABSTRACT: Logical models are well-suited to capture salient dynamical properties of regulatory networks. For networks controlling cell fate decisions, cell fates are associated with model attractors (stable states or cyclic attractors) whose identification and reachability properties are particularly relevant. While synchronous updates assume unlikely instantaneous or identical rates associated with component changes, the consideration of asynchronous updates is more realistic but, for large models, may hinder the analysis of the resulting non-deterministic concurrent dynamics. This complexity hampers the study of asymptotical behaviors, and most existing approaches suffer from efficiency bottlenecks, being generally unable to handle cyclical attractors and quantify attractor reachability. Here, we propose two algorithms providing probability estimates of attractor reachability in asynchronous dynamics. The first algorithm, named Firefront, exhaustively explores the state space from an initial state, and provides quasi-exact evaluations of the reachability probabilities of model attractors. The algorithm progresses in breadth, propagating the probabilities of each encountered state to its successors. Second, Avatar is an adapted Monte Carlo approach, better suited for models with large and intertwined transient and terminal cycles. Avatar iteratively explores the state space by randomly selecting trajectories and by using these random walks to estimate the likelihood of reaching an attractor. Unlike Monte Carlo simulations, Avatar is equipped to avoid getting trapped in transient cycles and to identify cyclic attractors. Firefront and Avatar are validated and compared to related methods, using as test cases logical models of synthetic and biological networks. Both algorithms are implemented as new functionalities of GINsim 3.0, a well-established software tool for logical modeling, providing executable GUI, Java API, and scripting facilities.

SUBMITTER: Mendes ND

PROVIDER: S-EPMC6137237 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Estimating Attractor Reachability in Asynchronous Logical Models.

Mendes Nuno D ND Henriques Rui R Remy Elisabeth E Carneiro Jorge J Monteiro Pedro T PT Chaouiya Claudine C

Frontiers in physiology 20180907

Logical models are well-suited to capture salient dynamical properties of regulatory networks. For networks controlling cell fate decisions, cell fates are associated with model attractors (stable states or cyclic attractors) whose identification and reachability properties are particularly relevant. While synchronous updates assume unlikely instantaneous or identical rates associated with component changes, the consideration of asynchronous updates is more realistic but, for large models, may h ...[more]

PMID: 30245634

Similar Datasets

Project description:Simulations of electrical activity of networks of morphologically detailed neuron models allow for a better understanding of the brain. State-of-the-art simulations describe the dynamics of ionic currents and biochemical processes within branching topological representations of the neurons. Acceleration of such simulation is possible in the weak scaling limit by modeling neurons as indivisible computation units and increasing the computing power. Strong scaling and simulations close to biological time are difficult, yet required, for the study of synaptic plasticity and other use cases requiring simulation of neurons for long periods of time. Current methods rely on parallel Gaussian Elimination, computing triangulation and substitution of many branches simultaneously. Existing limitations are: (a) high heterogeneity of compute time per neuron leads to high computational load imbalance; and (b) difficulty in providing a computation model that fully utilizes the computing resources on distributed multi-core architectures with Single Instruction Multiple Data (SIMD) capabilities. To address these issues, we present a strategy that extracts flow-dependencies between parameters of the ODEs and the algebraic solver of individual neurons. Based on the resulting map of dependencies, we provide three techniques for memory, communication, and computation reorganization that yield a load-balanced distributed asynchronous execution. The new computation model distributes datasets and balances computational workload across a distributed memory space, exposing a tree-based parallelism of neuron topological structure, an embarrassingly parallel execution model of neuron subtrees, and a SIMD acceleration of subtree state updates. The capabilities of our methods are demonstrated on a prototype implementation developed on the core compute kernel of the NEURON scientific application, built on the HPX runtime system for the ParalleX execution model. Our implementation yields an asynchronous distributed and parallel simulation that accelerates single neuron to medium-sized neural networks. Benchmark results display better strong scaling properties, finer-grained parallelism, and lower time to solution compared to the state of the art, on a wide range of distributed multi-core compute architectures.

Project description:A central debate in the exercise sciences is the cause of the fatigue that develops especially during high intensity exercise of short duration. The most popular theory holds that this form of exercise is limited by a peripherally based, metabolite induced failure of skeletal muscle contractile function, independent of reduced muscle activation by the central nervous system; so-called peripheral fatigue. This theory arose originally from studies undertaken by Nobel Laureate Sir Archibald Vivian Hill and colleagues in Manchester, UK in the 1920s. In turn, their interpretations were crucially influenced by the earlier 1907 findings of Sir Frederick Gowland Hopkins, Nobel Laureate for his discovery of the vitamins, and Walter Morley Fletcher. The original model of Hill and his colleagues proposed that performance during exercise of high intensity was limited by skeletal muscle anaerobiosis that developed as the result of a limiting skeletal muscle blood flow, following the onset of myocardial ischaemia. Such skeletal muscle anaerobiosis ultimately prevented the neutralization of the lactic acid that, Hill believed, initiated muscle contraction. The resulting lactic acid accumulation impaired skeletal muscle relaxation, causing the (involuntary) termination of exercise. The evolutionary progression of this model led to the "catastrophe theory" of Richard Edwards, which posits that exercise terminates when the physiological and biochemical limits of the body are exceeded, causing a catastrophic failure of intracellular homeostasis. This paper addresses six hallmark physiological requirements that must be correct if Hill's cardiovascular/ anaerobic/catastrophic model is the exclusive explanation for the fatigue that develops during maximum exercise to exhaustion. This leads to a review of the evidence supporting other, related "catastrophe" models that have been developed to explain fatigue during exercise of lower intensities and longer durations. It is concluded that there is little published evidence supporting the theory that fatigue occurs only after physiological homeostasis fails according to the prediction of these catastrophe models. Rather, it is proposed that fatigue in any form of exercise may form part of a regulated, anticipatory response co-ordinated in the subconscious brain. The ultimate goal of this regulation is to preserve homeostasis in all physiological systems during exercise, regardless of intensity or duration or the environmental conditions in which it is undertaken.

Dataset Information

Estimating Attractor Reachability in Asynchronous Logical Models.

Publications

Estimating Attractor Reachability in Asynchronous Logical Models.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets