Evidence map›Paper›PMID 26608050›Full record

ArticleBMC bioinformatics2015

High-order dynamic Bayesian Network learning with hidden common causes for causal gene regulatory network.

Leung-Yau Lo, Man-Leung Wong, Kin-Hong Lee, Kwong-Sak Leung

Abstract read
In one paragraph

Article in BMC bioinformatics, 2015. 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. Analysis of high-resolution 3D intrachromosomal interactions aided by Bayesian network modeling.Proceedings of the National Academy of Sciences of the United States of America · 2017
    Article
  5. New Algorithm and Software (BNOmics) for Inferring and Visualizing Bayesian Networks from Heterogeneous Big Biological and Genetic Data.Journal of computational biology : a journal of computational molecular cell biology · 2017
    Article
  6. 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

4 authors.

Leung-Yau LoDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong. lylo@cse.cuhk.edu.hk.
Man-Leung WongDepartment of Computing and Decision Sciences, Lingnan University, Tuen Mun, Hong Kong. mlwong@ln.edu.hk.
Kin-Hong LeeDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong. leekinhong@hotmail.com.
Kwong-Sak LeungDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong. ksleung@cse.cuhk.edu.hk.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundInferring gene regulatory network (GRN) has been an important topic in Bioinformatics. Many computational methods infer the GRN from high-throughput expression data. Due to the presence of time delays in the regulatory relationships, High-Order Dynamic Bayesian Network (HO-DBN) is a good model of GRN. However, previous GRN inference methods assume causal sufficiency, i.e. no unobserved common cause. This assumption is convenient but unrealistic, because it is possible that relevant factors have not even been conceived of and therefore un-measured. Therefore an inference method that also handles hidden common cause(s) is highly desirable. Also, previous methods for discovering hidden common causes either do not handle multi-step time delays or restrict that the parents of hidden common causes are not observed genes.

resultsWe have developed a discrete HO-DBN learning algorithm that can infer also hidden common cause(s) from discrete time series expression data, with some assumptions on the conditional distribution, but is less restrictive than previous methods. We assume that each hidden variable has only observed variables as children and parents, with at least two children and possibly no parents. We also make the simplifying assumption that children of hidden variable(s) are not linked to each other. Moreover, our proposed algorithm can also utilize multiple short time series (not necessarily of the same length), as long time series are difficult to obtain.

conclusionsWe have performed extensive experiments using synthetic data on GRNs of size up to 100, with up to 10 hidden nodes. Experiment results show that our proposed algorithm can recover the causal GRNs adequately given the incomplete data. Using the limited real expression data and small subnetworks of the YEASTRACT network, we have also demonstrated the potential of our algorithm on real data, though more time series expression data is needed.

Indexed as

AlgorithmsBayes TheoremGene Expression ProfilingGene Regulatory NetworksComputational BiologyGene Expression RegulationHumans

Identifiers

PMID26608050
PMCPMC4659244

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.