Evidence map›Paper›PMID 28759592›Full record

ArticlePLoS computational biology2017

PCSF: An R-package for network-based interpretation of high-throughput data.

Murodzhon Akhmedov, Amanda Kedaigle, Renan Escalante Chong, Roberto Montemanni, Francesco Bertoni, Ernest Fraenkel, Ivo Kwee

Abstract read
In one paragraph

Article in PLoS computational biology, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 36 papers.

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

36 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Harnessing network pharmacology in drug discovery: an integrated approach.Naunyn-Schmiedeberg's archives of pharmacology · 2025
    Review
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

7 authors.

Murodzhon AkhmedovDalle Molle Institute for Artificial Intelligence Research (USI/SUPSI), Manno, Switzerland.
Amanda KedaigleDepartment of Biological Engineering, MIT, Cambridge, Massachusetts, United States of America.ORCID http://orcid.org/0000-0001-6156-5046
Renan Escalante ChongDepartment of Biological Engineering, MIT, Cambridge, Massachusetts, United States of America.ORCID http://orcid.org/0000-0001-6913-4910
Roberto MontemanniDalle Molle Institute for Artificial Intelligence Research (USI/SUPSI), Manno, Switzerland.ORCID http://orcid.org/0000-0002-0229-0465
Francesco BertoniInstitute of Oncology Research (IOR), Bellinzona, Switzerland.ORCID http://orcid.org/0000-0001-5637-8983
Ernest FraenkelDepartment of Biological Engineering, MIT, Cambridge, Massachusetts, United States of America.ORCID http://orcid.org/0000-0001-9249-8181
Ivo KweeDalle Molle Institute for Artificial Intelligence Research (USI/SUPSI), Manno, Switzerland.ORCID http://orcid.org/0000-0002-2751-4218

Funding

Neuron and Glial Cellular Signatures from Normal and Diseased iPS Cells-SupplementU54NS091046 · NINDS · UNIVERSITY OF CALIFORNIA-IRVINE · PI FINKBEINER, STEVEN M, FRAENKEL, ERNEST · 2014 to 2020
$11.7M
Graduate Training in Computational and Systems BiologyT32GM087237 · NIGMS · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BURGE, CHRISTOPHER B · 2009 to 2023
$4.6M
Embryonal Brain Tumor NetworksU01CA184898 · NCI · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI FRAENKEL, ERNEST, MESIROV, JILL P. · 2014 to 2019
$3.6M
NCI NIH HHS U01 CA184898NIGMS NIH HHS T32 GM087237NINDS NIH HHS U54 NS091046
6 · The paper itself

Abstract

With the recent technological developments a vast amount of high-throughput data has been profiled to understand the mechanism of complex diseases. The current bioinformatics challenge is to interpret the data and underlying biology, where efficient algorithms for analyzing heterogeneous high-throughput data using biological networks are becoming increasingly valuable. In this paper, we propose a software package based on the Prize-collecting Steiner Forest graph optimization approach. The PCSF package performs fast and user-friendly network analysis of high-throughput data by mapping the data onto a biological networks such as protein-protein interaction, gene-gene interaction or any other correlation or coexpression based networks. Using the interaction networks as a template, it determines high-confidence subnetworks relevant to the data, which potentially leads to predictions of functional units. It also interactively visualizes the resulting subnetwork with functional enrichment analysis.

Indexed as

Databases, FactualSoftwareComputational BiologyHigh-Throughput Screening Assays

Identifiers

PMID28759592
PMCPMC5552342

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.