Evidence map›Paper›PMID 36733402›Full record

ArticleNAR genomics and bioinformatics2023

ARBic: an all-round biclustering algorithm for analyzing gene expression data.

Xiangyu Liu, Ting Yu, Xiaoyu Zhao, Chaoyi Long, Renmin Han, Zhengchang Su, Guojun Li

Abstract read
In one paragraph

Article in NAR genomics and bioinformatics, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

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

6 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. RUBic: rapid unsupervised biclustering.BMC bioinformatics · 2023
    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.

Xiangyu LiuResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.
Ting YuResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.ORCID https://orcid.org/0000-0002-0073-9644
Xiaoyu ZhaoResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.
Chaoyi LongResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.
Renmin HanResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.ORCID https://orcid.org/0000-0003-4761-6526
Zhengchang SuDepartment of Bioinformatics and Genomics, The University of North Carolina at Charlotte, Charlotte, NC 28223, USA.ORCID https://orcid.org/0000-0001-9878-5480
Guojun LiResearch Center for Mathematics and Interdisciplinary Sciences, Shandong University, Jinan 250100, China.ORCID https://orcid.org/0000-0003-1581-5897

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Identifying significant biclusters of genes with specific expression patterns is an effective approach to reveal functionally correlated genes in gene expression data. However, none of existing algorithms can simultaneously identify both broader and narrower biclusters due to their failure of balancing between effectiveness and efficiency. We introduced ARBic, an algorithm which is capable of accurately identifying any significant biclusters of any shape, including broader, narrower and square, in any large scale gene expression dataset. ARBic was designed by integrating column-based and row-based strategies into a single biclustering procedure. The column-based strategy borrowed from RecBic, a recently published biclustering tool, extracts narrower biclusters, while the row-based strategy that iteratively finds the longest path in a specific directed graph, extracts broader ones. Being tested and compared to other seven salient biclustering algorithms on simulated datasets, ARBic achieves at least an average of 29% higher recovery, relevance and[Formula: see text] scores than the best existing tool. In addition, ARBic substantially outperforms all tools on real datasets and is more robust to noises, bicluster shapes and dataset types.

Identifiers

PMID36733402
PMCPMC9887595

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.