Inferring gene regulatory networks with hybrid of multi-agent genetic algorithm and random forests based on fuzzy cognitive maps

2018 ◽  
Vol 69 ◽  
pp. 585-598 ◽  
Author(s):  
Luowen Liu ◽  
Jing Liu
2021 ◽  
Author(s):  
Marzieh Emadi ◽  
Farsad Zamani Boroujeni ◽  
jamshid Pirgazi

Abstract Recently with the advancement of high-throughput sequencing, gene regulatory network inference has turned into an interesting subject in bioinformatics and system biology. But there are many challenges in the field such as noisy data, uncertainty, time-series data with numerous gene numbers and low data, time complexity and so on. In recent years, many research works have been conducted to tackle these challenges, resulting in different methods in gene regulatory networks inference. A number of models have been used in modeling of the gene regulatory networks including Boolean networks, Bayesian networks, Markov model, relational networks, state space model, differential equations model, artificial neural networks and so on. In this paper, the fuzzy cognitive maps are used to model gene regulatory networks because of their dynamic nature and learning capabilities for handling non-linearity and inherent uncertainty. Fuzzy cognitive maps belong to the family of recurrent networks and are well-suited for gene regulatory networks. In this research study, the Kalman filtered compressed sensing is used to infer the fuzzy cognitive map for the gene regulatory networks. This approach, using the advantages of compressed sensing and Kalman filters, allows robustness to noise and learning of sparse gene regulatory networks from data with high gene number and low samples. In the proposed method, stream data and previous knowledge can be used in the inference process. Furthermore, compressed sensing finds likely edges and Kalman filter estimates their weights. The proposed approach uses a novel method to decrease the noise of data. The proposed method is compared to CSFCM, LASSOFCM, KFRegular, ABC, RCGA, ICLA, and CMI2NI. The results show that the proposed approach is superior to the other approaches in fuzzy cognitive maps learning. This behavior is related to the stability against noise and offers a proper balance between data error and network structure.


2019 ◽  
Vol 17 (04) ◽  
pp. 1950023 ◽  
Author(s):  
Luowen Liu ◽  
Jing Liu

Inferring gene regulatory networks (GRNs) is vital to understand the complex cellular processes and reveal the regulatory mechanisms among genes. Although various methods have been developed, more accurate algorithms which can control the sparseness of GRNs still need to be developed. In this work, we model GRNs by fuzzy cognitive maps (FCMs), and a node in an FCM means a gene. Then, a new sparse and decomposed particle swarm optimization, termed as SDPSOFCM-GRN, is proposed to train FCMs, which employs the least absolute shrinkage and selection operator (Lasso) to control the network sparseness with a decomposed strategy. In the experiments, the performance of SDPSOFCM-GRN is validated on synthetic data and the well-known benchmark DREAM3 and DREAM4. The results show that SDPSOFCM-GRN can well control the sparseness of GRNs, and infer directed GRNs with high accuracy and efficiency.


Author(s):  
Ramesh Ram ◽  
Madhu Chetty

This chapter presents modelling gene regulatory networks (GRNs) using probabilistic causal model and the guided genetic algorithm. The problem of modelling is explained from both a biological and computational perspective. Further, a comprehensive methodology for developing a GRN model is presented where the application of computation intelligence (CI) techniques can be seen to be significantly important in each phase of modelling. An illustrative example of the causal model for GRN modelling is also included and applied to model the yeast cell cycle dataset. The results obtained are compared for providing biological relevance to the findings which thereby underpins the CI based modelling techniques.


2012 ◽  
Vol 22 (07) ◽  
pp. 1250156 ◽  
Author(s):  
DANIEL AGUILAR-HIDALGO ◽  
ANTONIO CÓRDOBA ZURITA ◽  
Ma CARMEN LEMOS FERNÁNDEZ

Gene regulatory networks set a second order approximation to genetics understanding, where the first order is the knowledge at the single gene activity level. With the increasing number of sequenced genomes, including humans, the time has come to investigate the interactions among myriads of genes that result in complex behaviors. These characteristics are included in the novel discipline of Systems Biology. The composition and unfolding of interactions among genes determine the activity of cells and, when is considered during development, the organogenesis. Hence the interest of building representative networks of gene expression and their time evolution, i.e. the structure as the network dynamics, for certain development processes. The complexity of this kind of problems makes imperative to analyze the problem in the field of network theory and the evolutionary dynamics of complex systems.All this has led us to investigate, in a first step, the evolutionary dynamics in generic networks. Thus, the results can be used in experimental researches in the field of Systems Biology. This research aims to decode the transformation rules governing the evolutionary dynamics in a network. To do this, a genetic algorithm has been implemented in which, starting from initial and ending network states, it is possible to determine the transformation dynamics between these states by using simple acting rules. The network description is the following: (a) The network node values in the initial and ending states can be active or inactive; (b) The network links can act as activators or repressors; (c) A set of rules is established in order to transform the initial state into the ending one; (d) Due to the low connectivity, frequently observed, in gene regulatory networks, each node will hold a maximum of three inputs with no restriction on outputs. The "chromosomes" of the genetic algorithm include two parts, one related to the node links and another related to the transformation rules.The implemented rules are based on certain genetic interactions behavior. The rules and their combinations are compound by logic conditions and set the bases to the network motifs formation, which are the building blocks of the network dynamics.The implemented algorithm is able to find appropriate dynamics in complex networks evolution among different states for several cases.


Sign in / Sign up

Export Citation Format

Share Document