Evidence map›Paper›PMID 35710639›Full record

ArticleNature communications2022

Influence maximization in Boolean networks.

Thomas Parmer, Luis M Rocha, Filippo Radicchi

Open access · goldAbstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
1.6field-weighted citation impact, top 16% of its field
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

10 citing papers in PubMed, 21 citations in OpenAlex.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. 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

3 authors at 2 institutions in 2 countries.

Thomas ParmerCenter for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN, 47408, USA.ORCID 0000-0002-8332-8268
Luis M RochaConsortium for Social and Biomedical Complexity, Systems Science and Industrial Engineering Department, Thomas J. Watson College of Engineering and Applied Science, Binghamton University (State University of New York), Binghamton, NY, 13902, USA.ORCID 0000-0001-9402-887X
Filippo RadicchiCenter for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN, 47408, USA. filiradi@indiana.edu.ORCID 0000-0002-8352-1287
Indiana University Bloomington · USBinghamton University · US

Funding

Evidence-based Drug-Interaction Discovery: In-Vivo, In-Vitro and ClinicalR01LM011945 · NLM · INDIANA UNIVERSITY INDIANAPOLIS · PI LI, LANG, ROCHA, LUIS M · 2014 to 2017
$1.8M
myAURA: Personalized Web Service for Epilepsy ManagementR01LM012832 · NLM · TRUSTEES OF INDIANA UNIVERSITY · PI BORNER, KATY, MILLER, WENDY RENEE · 2018 to 2021
$1.3M
NLM NIH HHS R01 LM011945NLM NIH HHS R01 LM012832
6 · The paper itself

Abstract

The optimization problem aiming at the identification of minimal sets of nodes able to drive the dynamics of Boolean networks toward desired long-term behaviors is central for some applications, as for example the detection of key therapeutic targets to control pathways in models of biological signaling and regulatory networks. Here, we develop a method to solve such an optimization problem taking inspiration from the well-studied problem of influence maximization for spreading processes in social networks. We validate the method on small gene regulatory networks whose dynamical landscapes are known by means of brute-force analysis. We then systematically study a large collection of gene regulatory networks. We find that for about 65% of the analyzed networks, the minimal driver sets contain less than 20% of their nodes.

Indexed as

AlgorithmsGene Regulatory NetworksSocial Networking

Identifiers

PMID35710639
PMCPMC9203747
OpenAlexW4282966992

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.