↓ Skip to main content

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

Overview of attention for article published in BMC Bioinformatics, November 2015
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
5 X users
facebook
1 Facebook page

Readers on

mendeley
39 Mendeley
citeulike
1 CiteULike
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
High-order dynamic Bayesian Network learning with hidden common causes for causal gene regulatory network
Published in
BMC Bioinformatics, November 2015
DOI 10.1186/s12859-015-0823-6
Pubmed ID
Authors

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

Abstract

Inferring 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. We 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. We 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.

X Demographics

X Demographics

The data shown below were collected from the profiles of 5 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 39 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Japan 1 3%
India 1 3%
China 1 3%
Brazil 1 3%
Unknown 35 90%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 17 44%
Student > Master 6 15%
Student > Doctoral Student 4 10%
Researcher 4 10%
Student > Bachelor 2 5%
Other 3 8%
Unknown 3 8%
Readers by discipline Count As %
Computer Science 14 36%
Agricultural and Biological Sciences 7 18%
Biochemistry, Genetics and Molecular Biology 4 10%
Engineering 2 5%
Economics, Econometrics and Finance 1 3%
Other 8 21%
Unknown 3 8%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 22 June 2016.
All research outputs
#13,959,398
of 22,833,393 outputs
Outputs from BMC Bioinformatics
#4,477
of 7,288 outputs
Outputs of similar age
#195,912
of 386,751 outputs
Outputs of similar age from BMC Bioinformatics
#83
of 131 outputs
Altmetric has tracked 22,833,393 research outputs across all sources so far. This one is in the 37th percentile – i.e., 37% of other outputs scored the same or lower than it.
So far Altmetric has tracked 7,288 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.4. This one is in the 35th percentile – i.e., 35% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 386,751 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 48th percentile – i.e., 48% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 131 others from the same source and published within six weeks on either side of this one. This one is in the 35th percentile – i.e., 35% of its contemporaries scored the same or lower than it.