Structure Of Gene Regulatory Networks Research Articles

Reconstruction of Gene Regulatory Networks based on Repairing Sparse Low-rank Matrices.

With the growth of high-throughput proteomic data, in particular time series gene expression data from various perturbations, a general question that has arisen is how to organize inherently heterogenous data into meaningful structures. Since biological systems such as breast cancer tumors respond differently to various treatments, little is known about exactly how these gene regulatory networks (GRNs) operate under different stimuli. Challenges due to the lack of knowledge not only occur in modeling the dynamics of a GRN but also cause bias or uncertainties in identifying parameters or inferring the GRN structure. This paper describes a new algorithm which enables us to estimate bias error due to the effect of perturbations and correctly identify the common graph structure among biased inferred graph structures. To do this, we retrieve common dynamics of the GRN subject to various perturbations. We refer to the task as "repairing" inspired by "image repairing" in computer vision. The method can automatically correctly repair the common graph structure across perturbed GRNs, even without precise information about the effect of the perturbations. We evaluate the method on synthetic data sets and demonstrate an application to the DREAM data sets and discuss its implications to experiment design.

A Sparse Reconstruction Approach for Identifying Gene Regulatory Networks Using Steady-State Experiment Data.

MotivationIdentifying gene regulatory networks (GRNs) which consist of a large number of interacting units has become a problem of paramount importance in systems biology. Situations exist extensively in which causal interacting relationships among these units are required to be reconstructed from measured expression data and other a priori information. Though numerous classical methods have been developed to unravel the interactions of GRNs, these methods either have higher computing complexities or have lower estimation accuracies. Note that great similarities exist between identification of genes that directly regulate a specific gene and a sparse vector reconstruction, which often relates to the determination of the number, location and magnitude of nonzero entries of an unknown vector by solving an underdetermined system of linear equations y = Φx. Based on these similarities, we propose a novel framework of sparse reconstruction to identify the structure of a GRN, so as to increase accuracy of causal regulation estimations, as well as to reduce their computational complexity.ResultsIn this paper, a sparse reconstruction framework is proposed on basis of steady-state experiment data to identify GRN structure. Different from traditional methods, this approach is adopted which is well suitable for a large-scale underdetermined problem in inferring a sparse vector. We investigate how to combine the noisy steady-state experiment data and a sparse reconstruction algorithm to identify causal relationships. Efficiency of this method is tested by an artificial linear network, a mitogen-activated protein kinase (MAPK) pathway network and the in silico networks of the DREAM challenges. The performance of the suggested approach is compared with two state-of-the-art algorithms, the widely adopted total least-squares (TLS) method and those available results on the DREAM project. Actual results show that, with a lower computational cost, the proposed method can significantly enhance estimation accuracy and greatly reduce false positive and negative errors. Furthermore, numerical calculations demonstrate that the proposed algorithm may have faster convergence speed and smaller fluctuation than other methods when either estimate error or estimate bias is considered.

Inference of Low and High-Grade Glioma Gene Regulatory Networks Delineates the Role of Rnd3 in Establishing Multiple Hallmarks of Cancer.

Gliomas are a highly heterogeneous group of brain tumours that are refractory to treatment, highly invasive and pro-angiogenic. Glioblastoma patients have an average survival time of less than 15 months. Understanding the molecular basis of different grades of glioma, from well differentiated, low-grade tumours to high-grade tumours, is a key step in defining new therapeutic targets. Here we use a data-driven approach to learn the structure of gene regulatory networks from observational data and use the resulting models to formulate hypothesis on the molecular determinants of glioma stage. Remarkably, integration of available knowledge with functional genomics datasets representing clinical and pre-clinical studies reveals important properties within the regulatory circuits controlling low and high-grade glioma. Our analyses first show that low and high-grade gliomas are characterised by a switch in activity of two subsets of Rho GTPases. The first one is involved in maintaining normal glial cell function, while the second is linked to the establishment of multiple hallmarks of cancer. Next, the development and application of a novel data integration methodology reveals novel functions of RND3 in controlling glioma cell migration, invasion, proliferation, angiogenesis and clinical outcome.

Modeling Gene Networks in Saccharomyces cerevisiae Based on Gene Expression Profiles.

Detailed and innovative analysis of gene regulatory network structures may reveal novel insights to biological mechanisms. Here we study how gene regulatory network in Saccharomyces cerevisiae can differ under aerobic and anaerobic conditions. To achieve this, we discretized the gene expression profiles and calculated the self-entropy of down- and upregulation of gene expression as well as joint entropy. Based on these quantities the uncertainty coefficient was calculated for each gene triplet, following which, separate gene logic networks were constructed for the aerobic and anaerobic conditions. Four structural parameters such as average degree, average clustering coefficient, average shortest path, and average betweenness were used to compare the structure of the corresponding aerobic and anaerobic logic networks. Five genes were identified to be putative key components of the two energy metabolisms. Furthermore, community analysis using the Newman fast algorithm revealed two significant communities for the aerobic but only one for the anaerobic network. David Gene Functional Classification suggests that, under aerobic conditions, one such community reflects the cell cycle and cell replication, while the other one is linked to the mitochondrial respiratory chain function.

Exact reconstruction of gene regulatory networks using compressive sensing.

BackgroundWe consider the problem of reconstructing a gene regulatory network structure from limited time series gene expression data, without any a priori knowledge of connectivity. We assume that the network is sparse, meaning the connectivity among genes is much less than full connectivity. We develop a method for network reconstruction based on compressive sensing, which takes advantage of the network’s sparseness.ResultsFor the case in which all genes are accessible for measurement, and there is no measurement noise, we show that our method can be used to exactly reconstruct the network. For the more general problem, in which hidden genes exist and all measurements are contaminated by noise, we show that our method leads to reliable reconstruction. In both cases, coherence of the model is used to assess the ability to reconstruct the network and to design new experiments. We demonstrate that it is possible to use the coherence distribution to guide biological experiment design effectively. By collecting a more informative dataset, the proposed method helps reduce the cost of experiments. For each problem, a set of numerical examples is presented.ConclusionsThe method provides a guarantee on how well the inferred graph structure represents the underlying system, reveals deficiencies in the data and model, and suggests experimental directions to remedy the deficiencies.Electronic supplementary materialThe online version of this article (doi:10.1186/s12859-014-0400-4) contains supplementary material, which is available to authorized users.

Structure identification for gene regulatory networks via linearization and robust state estimation

Inferring causal relationships among cellular components is one of the fundamental problems in understanding biological behaviours. The well known extended Kalman filter (EKF) has been proved to be a useful tool in simultaneously estimating both structure and actual gene expression levels of a gene regulatory network (GRN). First-order approximations, however, unavoidably result in modelling errors, but the EKF based method does not take either unmodelled dynamics or parametric uncertainties into account, which makes its estimation performances not very satisfactory. To overcome these problems, a sensitivity penalization based robust state estimator is adopted in this paper for revealing the structure of a GRN. Based on the specific structure of the estimation problem, it has been proved that under some weak conditions, both the EKF based method and the method suggested in this paper provide a consistent estimate, but the suggested method has a faster convergence speed. Compared with both the EKF and the unscented Kalman filter (UKF) based methods, simulation results and real data based estimations consistently show that both convergence speed and parametric estimation accuracy can be appreciably improved. These lead to significant reductions in both false positive errors and false negative errors, and may imply helpfulness of the suggested method in better understanding the structure and dynamics of actual GRNs.

Genes related to differentiation are correlated with the gene regulatory network structure

Many secondary messengers, receptors and transcription factors are related to cell differentiation. Their role in cell differentiation can be affected by their position in the gene regulatory network. Here, we test whether the properties of the gene regulatory network can highlight which genes and proteins are associated with cell differentiation. We use a previously developed purely theoretical algorithm built to detect nodes that can induce a state change in Boolean gene regulatory networks, and show that most genes predicted to participate in differentiation in the theoretical framework are also experimentally known to be associated with such differentiation. These results show that genes related to differentiation are associated with specific features of the genetic regulatory network. The proposed algorithm produces a better classification than simple network measures such as the nodes degree or centrality. Boolean networks were used in many previous theoretical models. Here, we show a direct application of such networks to the detection of genes and subnetworks related to differentiation. The subnetwork emerging from the genes and edges that are predicted to be associated with differentiation are the most active molecular pathways experimentally described to be involved in cell differentiation. http://peptibase.cs.biu.ac.il/homepage/Boolean_network_conversion_code.zip.

MAPC-GibbsOS: an integrated approach for robust identification of gene regulatory networks

BackgroundIdentification of cooperative gene regulatory network is an important topic for biological study especially in cancer research. Traditional approaches suffer from large noise in gene expression data and false positive connections in motif binding data; they also fail to identify the modularized structure of gene regulatory network. Methods that are capable of revealing underlying modularized structure and robust to noise and false positives are needed to be developed.ResultsWe proposed and developed an integrated approach to identify gene regulatory networks, which consists of a novel clustering method (namely motif-guided affinity propagation clustering (mAPC)) and a sampling based method (called Gibbs sampler based on outlier sum statistic (GibbsOS)). mAPC is used in the first step to obtain co-regulated gene modules by clustering genes with a similarity measurement taking into account both gene expression data and binding motif information. This clustering method can reduce the noise effect from microarray data to obtain modularized gene clusters. However, due to many false positives in motif binding data, some genes not regulated by certain transcription factors (TFs) will be falsely clustered with true target genes. To overcome this problem, GibbsOS is applied in the second step to refine each cluster for the identification of true target genes. In order to evaluate the performance of the proposed method, we generated simulation data under different signal-to-noise ratios and false positive ratios to test the method. The experimental results show an improved accuracy in terms of clustering and transcription factor identification. Moreover, an improved performance is demonstrated in target gene identification as compared with GibbsOS. Finally, we applied the proposed method to two breast cancer patient datasets to identify cooperative transcriptional regulatory networks associated with recurrence of breast cancer, as supported by their functional annotations.ConclusionsWe have developed a two-step approach for gene regulatory network identification, featuring an integrated method to identify modularized regulatory structures and refine their target genes subsequently. Simulation studies have shown the robustness of the method against noise in gene expression data and false positives in motif binding data. The proposed method has been applied to two breast cancer gene expression datasets to infer the hidden regulation mechanisms. The experimental results demonstrate the efficacy of the method in identifying key regulatory networks related to the progression and recurrence of breast cancer.

A Kalman-Filter Based Approach to Identification of Time-Varying Gene Regulatory Networks

MotivationConventional identification methods for gene regulatory networks (GRNs) have overwhelmingly adopted static topology models, which remains unchanged over time to represent the underlying molecular interactions of a biological system. However, GRNs are dynamic in response to physiological and environmental changes. Although there is a rich literature in modeling static or temporally invariant networks, how to systematically recover these temporally changing networks remains a major and significant pressing challenge. The purpose of this study is to suggest a two-step strategy that recovers time-varying GRNs.ResultsIt is suggested in this paper to utilize a switching auto-regressive model to describe the dynamics of time-varying GRNs, and a two-step strategy is proposed to recover the structure of time-varying GRNs. In the first step, the change points are detected by a Kalman-filter based method. The observed time series are divided into several segments using these detection results; and each time series segment belonging to two successive demarcating change points is associated with an individual static regulatory network. In the second step, conditional network structure identification methods are used to reconstruct the topology for each time interval. This two-step strategy efficiently decouples the change point detection problem and the topology inference problem. Simulation results show that the proposed strategy can detect the change points precisely and recover each individual topology structure effectively. Moreover, computation results with the developmental data of Drosophila Melanogaster show that the proposed change point detection procedure is also able to work effectively in real world applications and the change point estimation accuracy exceeds other existing approaches, which means the suggested strategy may also be helpful in solving actual GRN reconstruction problem.

An Overview of the Statistical Methods Used for Inferring Gene Regulatory Networks and Protein-Protein Interaction Networks

The large influx of data from high-throughput genomic and proteomic technologies has encouraged the researchers to seek approaches for understanding the structure of gene regulatory networks and proteomic networks. This work reviews some of the most important statistical methods used for modeling of gene regulatory networks (GRNs) and protein-protein interaction (PPI) networks. The paper focuses on the recent advances in the statistical graphical modeling techniques, state-space representation models, and information theoretic methods that were proposed for inferring the topology of GRNs. It appears that the problem of inferring the structure of PPI networks is quite different from that of GRNs. Clustering and probabilistic graphical modeling techniques are of prime importance in the statistical inference of PPI networks, and some of the recent approaches using these techniques are also reviewed in this paper. Performance evaluation criteria for the approaches used for modeling GRNs and PPI networks are also discussed.

Inference of dynamical gene-regulatory networks based on time-resolved multi-stimuli multi-experiment data applying NetGenerator V2.0

BackgroundInference of gene-regulatory networks (GRNs) is important for understanding behaviour and potential treatment of biological systems. Knowledge about GRNs gained from transcriptome analysis can be increased by multiple experiments and/or multiple stimuli. Since GRNs are complex and dynamical, appropriate methods and algorithms are needed for constructing models describing these dynamics. Algorithms based on heuristic approaches reduce the effort in parameter identification and computation time.ResultsThe NetGenerator V2.0 algorithm, a heuristic for network inference, is proposed and described. It automatically generates a system of differential equations modelling structure and dynamics of the network based on time-resolved gene expression data. In contrast to a previous version, the inference considers multi-stimuli multi-experiment data and contains different methods for integrating prior knowledge. The resulting significant changes in the algorithmic procedures are explained in detail. NetGenerator is applied to relevant benchmark examples evaluating the inference for data from experiments with different stimuli. Also, the underlying GRN of chondrogenic differentiation, a real-world multi-stimulus problem, is inferred and analysed.ConclusionsNetGenerator is able to determine the structure and parameters of GRNs and their dynamics. The new features of the algorithm extend the range of possible experimental set-ups, results and biological interpretations. Based upon benchmarks, the algorithm provides good results in terms of specificity, sensitivity, efficiency and model fit.

A Framework for the Establishment of a Cnidarian Gene Regulatory Network for “Endomesoderm” Specification: The Inputs of ß-Catenin/TCF Signaling

Understanding the functional relationship between intracellular factors and extracellular signals is required for reconstructing gene regulatory networks (GRN) involved in complex biological processes. One of the best-studied bilaterian GRNs describes endomesoderm specification and predicts that both mesoderm and endoderm arose from a common GRN early in animal evolution. Compelling molecular, genomic, developmental, and evolutionary evidence supports the hypothesis that the bifunctional gastrodermis of the cnidarian-bilaterian ancestor is derived from the same evolutionary precursor of both endodermal and mesodermal germ layers in all other triploblastic bilaterian animals. We have begun to establish the framework of a provisional cnidarian “endomesodermal” gene regulatory network in the sea anemone, Nematostella vectensis, by using a genome-wide microarray analysis on embryos in which the canonical Wnt/ß-catenin pathway was ectopically targeted for activation by two distinct pharmaceutical agents (lithium chloride and 1-azakenpaullone) to identify potential targets of endomesoderm specification. We characterized 51 endomesodermally expressed transcription factors and signaling molecule genes (including 18 newly identified) with fine-scale temporal (qPCR) and spatial (in situ) analysis to define distinct co-expression domains within the animal plate of the embryo and clustered genes based on their earliest zygotic expression. Finally, we determined the input of the canonical Wnt/ß-catenin pathway into the cnidarian endomesodermal GRN using morpholino and mRNA overexpression experiments to show that NvTcf/canonical Wnt signaling is required to pattern both the future endomesodermal and ectodermal domains prior to gastrulation, and that both BMP and FGF (but not Notch) pathways play important roles in germ layer specification in this animal. We show both evolutionary conserved as well as profound differences in endomesodermal GRN structure compared to bilaterians that may provide fundamental insight into how GRN subcircuits have been adopted, rewired, or co-opted in various animal lineages that give rise to specialized endomesodermal cell types.

TIGRESS: Trustful Inference of Gene REgulation using Stability Selection

BackgroundInferring the structure of gene regulatory networks (GRN) from a collection of gene expression data has many potential applications, from the elucidation of complex biological processes to the identification of potential drug targets. It is however a notoriously difficult problem, for which the many existing methods reach limited accuracy.ResultsIn this paper, we formulate GRN inference as a sparse regression problem and investigate the performance of a popular feature selection method, least angle regression (LARS) combined with stability selection, for that purpose. We introduce a novel, robust and accurate scoring technique for stability selection, which improves the performance of feature selection with LARS. The resulting method, which we call TIGRESS (for Trustful Inference of Gene REgulation with Stability Selection), was ranked among the top GRN inference methods in the DREAM5 gene network inference challenge. In particular, TIGRESS was evaluated to be the best linear regression-based method in the challenge. We investigate in depth the influence of the various parameters of the method, and show that a fine parameter tuning can lead to significant improvements and state-of-the-art performance for GRN inference, in both directed and undirected settings.ConclusionsTIGRESS reaches state-of-the-art performance on benchmark data, including both in silico and in vivo (E. coli and S. cerevisiae) networks. This study confirms the potential of feature selection techniques for GRN inference. Code and data are available on http://cbio.ensmp.fr/tigress. Moreover, TIGRESS can be run online through the GenePattern platform (GP-DREAM, http://dream.broadinstitute.org).

Revealing miRNA Regulation and miRNA Target Prediction Using Constraint-Based Learning

The past decades have witnessed advances in genomic technology; and this has allowed laboratories to generate vast amount of biological data, including microarray gene expression data. Effective analysis of the data helps in better understanding the mechanisms behind the complex behavior of the cell. Actually, a huge body of research focuses on the role of gene regulatory networks (GRNs) in controlling the cell. However, studying the heterogeneous interactions between mRNA and miRNA has received less attention. Fortunately, revealing the targets of miRNAs started to gain some consideration from the research community. Further, integrating mRNA gene expression and miRNA expression data is receiving more attention; the target is to understand the role of miRNA in regulating mRNA in different cell contexts; this could lead to predicting miRNA targets and constructing miRNA-mRNA interaction networks. On the other hand, we have already demonstrated the power of constraint-based learning as a promising technique to learn the structure of GRN , which are homogeneous in the sense that they contain one type of nodes, namely, genes. In this study, we extend our previous work to show how constraint-based learning can be effectively applied to tackle a more challenging problem, namely, to learn the structure of heterogeneous networks, like mRNA-miRNA network. In other words, to build the whole picture of the heterogeneous interactions, we used constraint-based learning algorithms which usually perform well on sparse graphs to predict the interactions within heterogeneous networks, namely, miRNA-mRNA interactions. We are able to achieve this by extending our PCPDPr algorithm, which works on homogeneous networks. The extended version named htrPCPDPr is capable of handling networks connecting two heterogeneous sets of nodes into a bipartite graph. This way, we propose a new learning mechanism to predict miRNA targets from expression profiles of both mRNA and miRNA, in addition to sequence-based prior knowledge about the interactions. The method has been applied to different set of genes related to the Alzheimer disease; the results reported in this paper demonstrate the novelty, applicability, and effectiveness of the proposed approach.

Transcriptional Network Structure Assessment Via the Data Processing Inequality

Whole genome transcriptional regulation involves an enormous number of physicochemical processes re- sponsible for phenotypic variability and organismal function. The actual mechanisms of regulation are only partially under- stood. In this sense, an extremely important conundrum is related with the probabilistic inference of gene regulatory net- works. A plethora of different methods and algorithms exists. Many of these algorithms are inspired in statistical mechanics and rely on information theoretical grounds. However, an important shortcoming of most of these methods, when it comes to deconvolute the actual, functional structure of gene regulatory networks lies in the presence of indirect interactions. We present a proposal to discover and assess for such indirect interactions within the framework of information theory by means of the data processing inequality. We also present some actual examples of the applicability of the method in several instances in the field of functional genomics.

Evolution and Analysis of Genetic Networks for Stable Cellular Growth and Regeneration

A computational model is presented that simulates stable growth of cellular structures that are in some cases capable of regeneration. In the model, cellular growth is governed by a gene regulatory network. By evolving the parameters and structure of the genetic network using a modified evolution strategy, a dynamically stable state can be achieved in the developmental process, where cell proliferation and cell apoptosis reach an equilibrium. The results of evolution with different setups in fitness evaluation during the development are compared with respect to their regeneration capability as well as their gene regulatory network structure. Network motifs responsible for stable growth and regeneration that emerged from the evolution are also analyzed. We expect that our findings can help to gain a better understanding of the process of growth and regeneration inspired by biological systems, in order to solve complex engineering problems, such as the design of self-healing materials.

Inferring Gene Regulatory Networks via Nonlinear State-Space Models and Exploiting Sparsity

This paper considers the problem of learning the structure of gene regulatory networks from gene expression time series data. A more realistic scenario when the state space model representing a gene network evolves nonlinearly is considered while a linear model is assumed for the microarray data. To capture the nonlinearity, a particle filter-based state estimation algorithm is considered instead of the contemporary linear approximation-based approaches. The parameters characterizing the regulatory relations among various genes are estimated online using a Kalman filter. Since a particular gene interacts with a few other genes only, the parameter vector is expected to be sparse. The state estimates delivered by the particle filter and the observed microarray data are then subjected to a LASSO-based least squares regression operation which yields a parsimonious and efficient description of the regulatory network by setting the irrelevant coefficients to zero. The performance of the aforementioned algorithm is compared with the extended Kalman filter (EKF) and Unscented Kalman Filter (UKF) employing the Mean Square Error (MSE) as the fidelity criterion in recovering the parameters of gene regulatory networks from synthetic data and real biological data. Extensive computer simulations illustrate that the proposed particle filter-based network inference algorithm outperforms EKF and UKF, and therefore, it can serve as a natural framework for modeling gene regulatory networks with nonlinear and sparse structure.

A workflow for genome-wide mapping of archaeal transcription factors with ChIP-seq

Deciphering the structure of gene regulatory networks across the tree of life remains one of the major challenges in postgenomic biology. We present a novel ChIP-seq workflow for the archaea using the model organism Halobacterium salinarum sp. NRC-1 and demonstrate its application for mapping the genome-wide binding sites of natively expressed transcription factors. This end-to-end pipeline is the first protocol for ChIP-seq in archaea, with methods and tools for each stage from gene tagging to data analysis and biological discovery. Genome-wide binding sites for transcription factors with many binding sites (TfbD) are identified with sensitivity, while retaining specificity in the identification the smaller regulons (bacteriorhodopsin-activator protein). Chromosomal tagging of target proteins with a compact epitope facilitates a standardized and cost-effective workflow that is compatible with high-throughput immunoprecipitation of natively expressed transcription factors. The Pique package, an open-source bioinformatics method, is presented for identification of binding events. Relative to ChIP-Chip and qPCR, this workflow offers a robust catalog of protein–DNA binding events with improved spatial resolution and significantly decreased cost. While this study focuses on the application of ChIP-seq in H. salinarum sp. NRC-1, our workflow can also be adapted for use in other archaea and bacteria with basic genetic tools.

DoGeNetS: using optimisation to discriminate regulatory network topologies based on gene expression data

Gene regulatory networks (GRNs) determine the dynamics of gene expression. Interest often focuses on the topological structure of a GRN while numerical parameters (e.g. decay rates) are unknown and less important. For larger GRNs, inference of structure from gene expression data is prohibitively difficult. Models are often proposed based on integrative interpretation of multiple sources of information. We have developed DoGeNetS (Discrimination of Gene Network Structures), a method to directly assess candidate models of GRN structure against a target gene expression data set. The transsys language serves to model GRN structures. Numeric parameters are optimised to approximate the target data. Multiple restarts of optimisation yield score sets that provide a basis to statistically discriminate candidate models according to their potential to explain the target data. We demonstrate discrimination power of the DoGeNetS method by relating structural divergence to divergence between gene expression data sets. Known models are used to generate target expression data, and a set of candidate models with a defined structural divergence to the true model is produced. Structural divergence and divergence of expression profiles after optimisation are strongly correlated. We further show that discrimination is possible at noise levels exceeding those typical of contemporary microarray data. DoGeNetS is capable of discriminating the best GRN structure from among a small number of candidates. p values indicate whether differences in divergence of expression are significant. Although this study uses single gene knockouts, the DoGeNetS method can be adapted to simulate a virtually unlimited range of experimental conditions. [Includes supplementary material].

Learning the structure of gene regulatory networks from time series gene expression data

BackgroundDynamic Bayesian Network (DBN) is an approach widely used for reconstruction of gene regulatory networks from time-series microarray data. Its performance in network reconstruction depends on a structure learning algorithm. REVEAL (REVerse Engineering ALgorithm) is one of the algorithms implemented for learning DBN structure and used to reconstruct gene regulatory networks (GRN). However, the two-stage temporal Bayes network (2TBN) structure of DBN that specifies correlation between time slices cannot be obtained by score metrics used in REVEAL.MethodsIn this paper, we study a more sophisticated score function for DBN first proposed by Nir Friedman for stationary DBNs structure learning of both initial and transition networks but has not yet been used for reconstruction of GRNs. We implemented Friedman's Bayesian Information Criterion (BIC) score function, modified K2 algorithm to learn Dynamic Bayesian Network structure with the score function and tested the performance of the algorithm for GRN reconstruction with synthetic time series gene expression data generated by GeneNetWeaver and real yeast benchmark experiment data.ResultsWe implemented an algorithm for DBN structure learning with Friedman's score function, tested it on reconstruction of both synthetic networks and real yeast networks and compared it with REVEAL in the absence or presence of preprocessed network generated by Zou&Conzen's algorithm. By introducing a stationary correlation between two consecutive time slices, Friedman's score function showed a higher precision and recall than the naive REVEAL algorithm.ConclusionsFriedman's score metrics for DBN can be used to reconstruct transition networks and has a great potential to improve the accuracy of gene regulatory network structure prediction with time series gene expression datasets.