Evidence map›Paper›PMID 26259567›Full record

ArticleBMC systems biology2015

Stochastic simulation of Boolean rxncon models: towards quantitative analysis of large signaling networks.

Tomoya Mori, Max Flöttmann, Marcus Krantz, Tatsuya Akutsu, Edda Klipp

Abstract read
In one paragraph

Article in BMC systems biology, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Attractor detection and enumeration algorithms for Boolean networks.Computational and structural biotechnology journal · 2022
    Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Tomoya MoriBioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan. tmori@kuicr.kyoto-u.ac.jp.
Max FlöttmannTheoretical Biophysics, Humboldt-Universität zu Berlin, Invalidenstr. 42, 10115, Berlin, Germany. max.floettmann@biologie.hu-berlin.de.
Marcus KrantzTheoretical Biophysics, Humboldt-Universität zu Berlin, Invalidenstr. 42, 10115, Berlin, Germany. marcus.krantz@biologie.hu-berlin.de.
Tatsuya AkutsuBioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan. takutsu@kuicr.kyoto-u.ac.jp.
Edda KlippTheoretical Biophysics, Humboldt-Universität zu Berlin, Invalidenstr. 42, 10115, Berlin, Germany. edda.klipp@rz.hu-berlin.de.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundCellular decision-making is governed by molecular networks that are highly complex. An integrative understanding of these networks on a genome wide level is essential to understand cellular health and disease. In most cases however, such an understanding is beyond human comprehension and requires computational modeling. Mathematical modeling of biological networks at the level of biochemical details has hitherto relied on state transition models. These are typically based on enumeration of all relevant model states, and hence become very complex unless severely--and often arbitrarily--reduced. Furthermore, the parameters required for genome wide networks will remain underdetermined for the conceivable future. Alternatively, networks can be simulated by Boolean models, although these typically sacrifice molecular detail as well as distinction between different levels or modes of activity. However, the modeling community still lacks methods that can simulate genome scale networks on the level of biochemical reaction detail in a quantitative or semi quantitative manner.

resultsHere, we present a probabilistic bipartite Boolean modeling method that addresses these issues. The method is based on the reaction-contingency formalism, and enables fast simulation of large networks. We demonstrate its scalability by applying it to the yeast mitogen-activated protein kinase (MAPK) network consisting of 140 proteins and 608 nodes.

conclusionThe probabilistic Boolean model can be generated and parameterized automatically from a rxncon network description, using only two global parameters, and its qualitative behavior is robust against order of magnitude variation in these parameters. Our method can hence be used to simulate the outcome of large signal transduction network reconstruction, with little or no overhead in model creation or parameterization.

Indexed as

Models, BiologicalSignal TransductionFeedback, PhysiologicalMAP Kinase Signaling SystemProbabilitySaccharomyces cerevisiaeStochastic ProcessesSystems Biology

Identifiers

PMID26259567
PMCPMC4531511

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.