Evidence map›Paper›PMID 34238960›Full record

ArticleScientific reports2021

Identification of anticancer drug target genes using an outside competitive dynamics model on cancer signaling networks.

Tien-Dzung Tran, Duc-Tinh Pham

Abstract read
In one paragraph

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

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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. 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.

Tien-Dzung TranComplex Systems and Bioinformatics Lab, Faculty of Information and Communication Technology, Hanoi University of Industry, Bac Tu Liem District, 298 Cau Dien street, Hanoi, Vietnam. trantd@haui.edu.vn.
Duc-Tinh PhamComplex Systems and Bioinformatics Lab, Faculty of Information and Communication Technology, Hanoi University of Industry, Bac Tu Liem District, 298 Cau Dien street, Hanoi, Vietnam.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Each cancer type has its own molecular signaling network. Analyzing the dynamics of molecular signaling networks can provide useful information for identifying drug target genes. In the present study, we consider an on-network dynamics model-the outside competitive dynamics model-wherein an inside leader and an opponent competitor outside the system have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. If any normal agent links to the external competitor, the state of each normal agent will converge to a stable value, indicating support to the leader against the impact of the competitor. We determined the total support of normal agents to each leader in various networks and observed that the total support correlates with hierarchical closeness, which identifies biomarker genes in a cancer signaling network. Of note, by experimenting on 17 cancer signaling networks from the KEGG database, we observed that 82% of the genes among the top 3 agents with the highest total support are anticancer drug target genes. This result outperforms those of four previous prediction methods of common cancer drug targets. Our study indicates that driver agents with high support from the other agents against the impact of the external opponent agent are most likely to be anticancer drug target genes.

Indexed as

Drug Delivery SystemsGene Regulatory NetworksModels, BiologicalAntineoplastic AgentsHumansNeoplasmsSignal TransductionAntineoplastic Agents

Identifiers

PMID34238960
PMCPMC8266823

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.