Evidence map›Paper›PMID 33568049›Full record

ArticleBMC bioinformatics2021

Ranking cancer drivers via betweenness-based outlier detection and random walks.

Cesim Erten, Aissa Houdjedj, Hilal Kazan

Open access · goldAbstract read
In one paragraph

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

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

4 citing papers in PubMed, 13 citations in OpenAlex.

  1. Article
  2. Article
  3. Review
  4. 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 1 institution in 1 country.

Cesim ErtenDepartment of Computer Engineering, Antalya Bilim University, Antalya, Turkey.
Aissa HoudjedjElectrical and Computer Engineering Graduate Program, Antalya Bilim University, Antalya, Turkey.
Hilal KazanDepartment of Computer Engineering, Antalya Bilim University, Antalya, Turkey. hilal.kazan@antalya.edu.tr.ORCID http://orcid.org/0000-0003-2461-4579
Antalya Bilim University · TR

Funding

Türkiye Bilimsel ve Teknolojik Arastirma Kurumu 117E879
6 · The paper itself

Abstract

backgroundRecent cancer genomic studies have generated detailed molecular data on a large number of cancer patients. A key remaining problem in cancer genomics is the identification of driver genes.

resultsWe propose BetweenNet, a computational approach that integrates genomic data with a protein-protein interaction network to identify cancer driver genes. BetweenNet utilizes a measure based on betweenness centrality on patient specific networks to identify the so-called outlier genes that correspond to dysregulated genes for each patient. Setting up the relationship between the mutated genes and the outliers through a bipartite graph, it employs a random-walk process on the graph, which provides the final prioritization of the mutated genes. We compare BetweenNet against state-of-the art cancer gene prioritization methods on lung, breast, and pan-cancer datasets.

conclusionsOur evaluations show that BetweenNet is better at recovering known cancer genes based on multiple reference databases. Additionally, we show that the GO terms and the reference pathways enriched in BetweenNet ranked genes and those that are enriched in known cancer genes overlap significantly when compared to the overlaps achieved by the rankings of the alternative methods.

Indexed as

GenomicsNeoplasmsOncogenesProtein Interaction MapsGene Regulatory NetworksHumansBetweenness centralityBipartite graphDriver gene prioritizationNetwork diffusion

Identifiers

PMID33568049
PMCPMC7877041
OpenAlexW3127041735

What Socratic 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 Socratic graph.