Evidence map›Paper›PMID 34471107›Full record

ArticleNature communications2021

The basis of easy controllability in Boolean networks.

Enrico Borriello, Bryan C Daniels

Abstract read
In one paragraph

Article in Nature communications, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing 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

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Modularity of biological systems: a link between structure and function.bioRxiv : the preprint server for biology · 2023
    Article
  7. Review
  8. Phenotype control techniques for Boolean gene regulatory networks.bioRxiv : the preprint server for biology · 2023
    Article
  9. The nonlinearity of regulation in biological networks.NPJ systems biology and applications · 2023
    Article
  10. Influence maximization in Boolean networks.Nature communications · 2022
    Article
  11. Article
  12. Article
  13. 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

2 authors.

Enrico BorrielloSchool of Complex Adaptive Systems, Arizona State University, Tempe, AZ, USA. enrico.borriello@asu.edu.ORCID 0000-0001-6176-4897
Bryan C DanielsSchool of Complex Adaptive Systems, Arizona State University, Tempe, AZ, USA. bryan.daniels.1@asu.edu.ORCID 0000-0002-5870-1059

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the effectiveness of external control in selecting a desired final state when that state is among the original attractors of the dynamics. Analyzing 49 existing biological network models, we find strong numerical evidence that the average number of nodes that must be forced scales logarithmically with the number of original attractors. This suggests that biological networks may be typically easy to control even when the number of interacting components is large. We provide a theoretical explanation of the scaling by separating controlling nodes into three types: those that act as inputs, those that distinguish among attractors, and any remaining nodes. We further identify characteristics of dynamics that can invalidate this scaling, and speculate about how this relates more broadly to non-biological systems.

Indexed as

Models, BiologicalModels, GeneticAlgorithms

Identifiers

PMID34471107
PMCPMC8410781

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.