Evidence map›Paper›PMID 28646174›Full record

ArticleScientific reports2017

A GPU-accelerated algorithm for biclustering analysis and detection of condition-dependent coexpression network modules.

Anindya Bhattacharya, Yan Cui

Abstract read
In one paragraph

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

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

9 citing papers in PubMed.

  1. Biclustering data analysis: a comprehensive survey.Briefings in bioinformatics · 2024
    Review
  2. Article
  3. Review
  4. Rank-preserving biclustering algorithm: a case study on miRNA breast cancer.Medical & biological engineering & computing · 2021
    Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. 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.

Anindya BhattacharyaDepartment of Microbiology, Immunology and Biochemistry, Memphis, TN, 38163, USA. anindyamail123@gmail.com.
Yan CuiDepartment of Microbiology, Immunology and Biochemistry, Memphis, TN, 38163, USA. ycui2@uthsc.edu.

Funding

CENTER FOR COMPUTATIONAL MASS-SPECTROMETRYP41RR024851 · NCRR · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI PEVZNER, PAVEL A · 2008 to 2011
$5.2M
NCRR NIH HHS P41 RR024851
6 · The paper itself

Abstract

In the analysis of large-scale gene expression data, it is important to identify groups of genes with common expression patterns under certain conditions. Many biclustering algorithms have been developed to address this problem. However, comprehensive discovery of functionally coherent biclusters from large datasets remains a challenging problem. Here we propose a GPU-accelerated biclustering algorithm, based on searching for the largest Condition-dependent Correlation Subgroups (CCS) for each gene in the gene expression dataset. We compared CCS with thirteen widely used biclustering algorithms. CCS consistently outperformed all the thirteen biclustering algorithms on both synthetic and real gene expression datasets. As a correlation-based biclustering method, CCS can also be used to find condition-dependent coexpression network modules. We implemented the CCS algorithm using C and implemented the parallelized CCS algorithm using CUDA C for GPU computing. The source code of CCS is available from https://github.com/abhatta3/Condition-dependent-Correlation-Subgroups-CCS.

Indexed as

AlgorithmsComputer GraphicsGene Regulatory NetworksAnimalsCluster AnalysisDatabases, GeneticGene Expression RegulationHumansRats

Identifiers

PMID28646174
PMCPMC5482832

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.