An estimation method for inference of gene regulatory net-work using Bayesian network with uniting of partial problems

Department of Bioinformatic Engineering, Graduate School of Information Science and Technology, Osaka University, Osaka, Japan.
BMC Genomics (Impact Factor: 3.99). 01/2012; 13 Suppl 1(Suppl 1):S12. DOI: 10.1186/1471-2164-13-S1-S12
Source: PubMed


Bayesian networks (BNs) have been widely used to estimate gene regulatory networks. Many BN methods have been developed to estimate networks from microarray data. However, two serious problems reduce the effectiveness of current BN methods. The first problem is that BN-based methods require huge computational time to estimate large-scale networks. The second is that the estimated network cannot have cyclic structures, even if the actual network has such structures.
In this paper, we present a novel BN-based deterministic method with reduced computational time that allows cyclic structures. Our approach generates all the combinational triplets of genes, estimates networks of the triplets by BN, and unites the networks into a single network containing all genes. This method decreases the search space of predicting gene regulatory networks without degrading the solution accuracy compared with the greedy hill climbing (GHC) method. The order of computational time is the cube of number of genes. In addition, the network estimated by our method can include cyclic structures.
We verified the effectiveness of the proposed method for all known gene regulatory networks and their expression profiles. The results demonstrate that this approach can predict regulatory networks with reduced computational time without degrading the solution accuracy compared with the GHC method.

Download full-text


Available from: Shigeto Seno,

Click to see the full-text of:

Article: An estimation method for inference of gene regulatory net-work using Bayesian network with uniting of partial problems

1.85 MB

See full-text
  • Source
    • "On other hand, numerous computational methods for GRN prediction have been recently proposed or applied. These methods include co-expression or relevance network (RNs) [11], graphical Gaussian modelling (GGM) [12], Boolean network [13], [14], differential equations [15], information theory [16], [17], Bayesian network (BN) [18], [19], regression models [20], among many others [21], [22]. However, two key problems still hinder their successful applications in practical GRN inferences. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Building accurate gene regulatory networks (GRNs) from high-throughput gene expression data is a long-standing challenge. However, with the emergence of new algorithms combined with the increase of transcriptomic data availability, it is now reachable. To help biologists to investigate gene regulatory relationships, we developed a web-based computational service to build, analyze and visualize GRNs that govern various biological processes. The web server is preloaded with all available Affymetrix GeneChip-based transcriptomic and annotation data from the three model legume species, i.e., Medicago truncatula, Lotus japonicus and Glycine max. Users can also upload their own transcriptomic and transcription factor datasets from any other species/organisms to analyze their in-house experiments. Users are able to select which experiments, genes and algorithms they will consider to perform their GRN analysis. To achieve this flexibility and improve prediction performance, we have implemented multiple mainstream GRN prediction algorithms including co-expression, Graphical Gaussian Models (GGMs), Context Likelihood of Relatedness (CLR), and parallelized versions of TIGRESS and GENIE3. Besides these existing algorithms, we also proposed a parallel Bayesian network learning algorithm, which can infer causal relationships (i.e., directionality of interaction) and scale up to several thousands of genes. Moreover, this web server also provides tools to allow integrative and comparative analysis between predicted GRNs obtained from different algorithms or experiments, as well as comparisons between legume species. The web site is available at
    PLoS ONE 07/2013; 8(7):e67434. DOI:10.1371/journal.pone.0067434 · 3.23 Impact Factor
  • Source
    • "The linear combination model, the weighted matrix model, the neural network model and differential equations model of processing power to noise is relatively weak. Bayesian network model [7] is a compromise of these methods. Now, Bayesian network model is employed in building the gene regulation network has become bioinformatics research hot spot. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Nowadays, gene chip technology has rapidly produced a wealth of information about gene expression activities. But the time-series expression data present a phenomenon that the number of genes is in thousands and the number of experimental data is only a few dozen. For such cases, it is difficult to learn network structure from such data. And the result is not ideal. So it needs to take measures to expand the capacity of the sample. In this paper, the Block bootstrap re-sampling method is utilized to enlarge the small expression data. At the same time, we apply "K2+T" algorithm to Yeast cell cycle gene expression data. Seeing from the experimental results and comparing with the semi-fixed structure EM learning algorithm, our proposed method is successful in constructing gene networks that capture much more known relationships as well as several unknown relationships which are likely to be novel.
    03/2013; 11(1). DOI:10.12928/telkomnika.v11i1.769
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Techniques in molecular biology have permitted the gathering of an extremely large amount of information relating organisms and their genes. The current challenge is assigning a putative function to thousands of genes that have been detected in different organisms. One of the most informative types of genomic data to achieve a better knowledge of protein function is gene expression data. Based on gene expression data and assuming that genes involved in the same function should have a similar or correlated expression pattern, a function can be attributed to those genes with unknown functions when they appear to be linked in a gene co-expression network (GCN). Several tools for the construction of GCNs have been proposed and applied to plant gene expression data. Here, we review recent methodologies used for plant gene expression data and compare the results, advantages and disadvantages in order to help researchers in their choice of a method for the construction of GCNs.
    Briefings in functional genomics 02/2013; 12(5). DOI:10.1093/bfgp/elt003 · 3.67 Impact Factor
Show more