Abstract

BackgroundGene Regulatory Networks (GRNs) have been previously studied by using Boolean/multi-state logics. While the gene expression values are usually scaled into the range [0, 1], these GRN inference methods apply a threshold to discretize the data, resulting in missing information. Most of studies apply fuzzy logics to infer the logical gene-gene interactions from continuous data. However, all these approaches require an a priori known network structure.ResultsHere, by introducing a new probabilistic logic for continuous data, we propose a novel logic-based approach (called the LogicNet) for the simultaneous reconstruction of the GRN structure and identification of the logics among the regulatory genes, from the continuous gene expression data. In contrast to the previous approaches, the LogicNet does not require an a priori known network structure to infer the logics. The proposed probabilistic logic is superior to the existing fuzzy logics and is more relevant to the biological contexts than the fuzzy logics. The performance of the LogicNet is superior to that of several Mutual Information-based and regression-based tools for reconstructing GRNs.ConclusionsThe LogicNet reconstructs GRNs and logic functions without requiring prior knowledge of the network structure. Moreover, in another application, the LogicNet can be applied for logic function detection from the known regulatory genes-target interactions. We also conclude that computational modeling of the logical interactions among the regulatory genes significantly improves the GRN reconstruction accuracy.

Highlights

  • Gene Regulatory Networks (GRNs) have been previously studied by using Boolean/multi-state logics

  • The LogicNet performance is compared to several state-of-the-art tools, i.e., Principle Component Analysis (PCA)-CMI [3], ARACNe [5], Genie3 [29], Narromi [4], CN [30], and GRNTE [31]

  • The performance is evaluated by using the true positive rate (TPR), false positive rate (FPR), positive predictive value (PPV), accuracy (ACC) and Matthews’s coefficient constant (MCC) defined as follows: TPR 1⁄4 True Positive (TP)=ðTP þ FNÞ

Read more

Summary

Introduction

Gene Regulatory Networks (GRNs) have been previously studied by using Boolean/multi-state logics. Most of studies apply fuzzy logics to infer the logical gene-gene interactions from continuous data. All these approaches require an a priori known network structure. The DREAM (the Dialogue for Reverse Engineering Assessments and Methods) program was initiated to encourage researchers to develop robust computational tools to infer GRNs from gene expression data [1]. The computational tools for the GRN inference can be classified into different categories. Abstract techniques such as the Principle Component Analysis (PCA) and Mutual Information (MI) [2,3,4,5,6,7] between genes are largely data-driven models in which the correlations among gene expression data are modelled. The temporal and spatial dynamics of each interaction can be captured by these models [8,9,10]

Methods
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call