Evidence map›Paper›PMID 29219084›Full record

ArticleBMC genomics2017

An improved Bayesian network method for reconstructing gene regulatory network based on candidate auto selection.

Linlin Xing, Maozu Guo, Xiaoyan Liu, Chunyu Wang, Lei Wang, Yin Zhang

Abstract read
In one paragraph

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

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

20 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Review
  5. Review
  6. Article
  7. Phosphoproteomics data-driven signalling network inference: Does it work?Computational and structural biotechnology journal · 2023
    Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Synthetic data generation with probabilistic Bayesian Networks.Mathematical biosciences and engineering : MBE · 2021
    Article
  15. Article
  16. Review
  17. Review
  18. Review
  19. Review
  20. Review
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

6 authors.

Linlin XingSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, China.
Maozu GuoSchool of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture, Beijing, China. guomaozu@bucea.edu.cn.
Xiaoyan LiuSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, China.
Chunyu WangSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, China.
Lei WangInstitute of Health Service and Medical Information, Academy of Military Medical Sciences, Beijing, China.
Yin ZhangInstitute of Health Service and Medical Information, Academy of Military Medical Sciences, Beijing, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundThe reconstruction of gene regulatory network (GRN) from gene expression data can discover regulatory relationships among genes and gain deep insights into the complicated regulation mechanism of life. However, it is still a great challenge in systems biology and bioinformatics. During the past years, numerous computational approaches have been developed for this goal, and Bayesian network (BN) methods draw most of attention among these methods because of its inherent probability characteristics. However, Bayesian network methods are time consuming and cannot handle large-scale networks due to their high computational complexity, while the mutual information-based methods are highly effective but directionless and have a high false-positive rate.

resultsTo solve these problems, we propose a Candidate Auto Selection algorithm (CAS) based on mutual information and breakpoint detection to restrict the search space in order to accelerate the learning process of Bayesian network. First, the proposed CAS algorithm automatically selects the neighbor candidates of each node before searching the best structure of GRN. Then based on CAS algorithm, we propose a globally optimal greedy search method (CAS + G), which focuses on finding the highest rated network structure, and a local learning method (CAS + L), which focuses on faster learning the structure with little loss of quality.

conclusionResults show that the proposed CAS algorithm can effectively reduce the search space of Bayesian networks through identifying the neighbor candidates of each node. In our experiments, the CAS + G method outperforms the state-of-the-art method on simulation data for inferring GRNs, and the CAS + L method is significantly faster than the state-of-the-art method with little loss of accuracy. Hence, the CAS based methods effectively decrease the computational complexity of Bayesian network and are more suitable for GRN inference.

Indexed as

AlgorithmsBayes TheoremGene Regulatory NetworksComputational BiologyGene Expression ProfilingGene Expression RegulationGenetic Association StudiesHumansSystems BiologyBayesian networkBreakpoint detectionCandidate auto selectionGene regulatory networksSearch space reduction

Identifiers

PMID29219084
PMCPMC5773867

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.