Parameters identification of unknown delayed genetic regulatory networks by a switching particle swarm optimization algorithm

The official published version can be found at the link below.This paper presents a novel particle swarm optimization (PSO) algorithm based on Markov chains and competitive penalized method. Such an algorithm is developed to solve global optimization problems with applications in identifying unknown parameters of a class of genetic regulatory networks (GRNs). By using an evolutionary factor, a new switching PSO (SPSO) algorithm is first proposed and analyzed, where the velocity updating equation jumps from one mode to another according to a Markov chain, and acceleration coefficients are dependent on mode switching. Furthermore, a leader competitive penalized multi-learning approach (LCPMLA) is introduced to improve the global search ability and refine the convergent solutions. The LCPMLA can automatically choose search strategy using a learning and penalizing mechanism. The presented SPSO algorithm is compared with some well-known PSO algorithms in the experiments. It is shown that the SPSO algorithm has faster local convergence speed, higher accuracy and algorithm reliability, resulting in better balance between the global and local searching of the algorithm, and thus generating good performance. Finally, we utilize the presented SPSO algorithm to identify not only the unknown parameters but also the coupling topology and time-delay of a class of GRNs.This research was partially supported by the National Natural Science Foundation of PR China (Grant No. 60874113), the Research Fund for the Doctoral Program of Higher Education (Grant No. 200802550007), the Key Creative Project of Shanghai Education Community (Grant No. 09ZZ66), the Key Foundation Project of Shanghai (Grant No. 09JC1400700), the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant No. GR/S27658/01, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, an International Joint Project sponsored by the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Hybrid approach for metabolites production using differential evolution and minimization of metabolic adjustment

Microbial strains can be optimized using metabolic engineering which implements gene knockout techniques. These techniques manipulate potential genes to increase the yield of metabolites through restructuring metabolic networks. Nowadays, several hybrid optimization algorithms have been proposed to optimize the microbial strains. However, the existing algorithms were unable to obtain optimal strains because the nonessential genes are hardly to be diagnosed and need to be removed due to high complexity of metabolic network. Therefore, the main goal of this study is to overcome the limitation of the existing algorithms by proposing a hybrid of Differential Evolution and Minimization of Metabolic Adjustments (DEMOMA). Differential Evolution (DE) is known as population-based stochastic search algorithm with few tuneable parameter control. Minimization of Metabolic Adjustment (MOMA) is one of the constraint based algorithms which act to simulate the cellular metabolism after perturbation (gene knockout) occurred to the metabolic model. The strength of MOMA is the ability to simulate the strains that have undergone mutation precisely compared to Flux Balance Analysis. The data set used for the production of fumaric acid is S. cerevisiae whereas data set for lycopene production is Y. lipolytica metabolic networks model. Experimental results show that the DEMOMA was able to improve the growth rate for the fumaric acid production rate while for the lycopene production, Biomass Product Coupled Yield (BPCY) and production rate were both able to be optimized

A hybrid EKF and switching PSO algorithm for joint state and parameter estimation of lateral flow immunoassay models

This is the post-print version of the Article. The official published can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, a hybrid extended Kalman filter (EKF) and switching particle swarm optimization (SPSO) algorithm is proposed for jointly estimating both the parameters and states of the lateral flow immunoassay model through available short time-series measurement. Our proposed method generalizes the well-known EKF algorithm by imposing physical constraints on the system states. Note that the state constraints are encountered very often in practice that give rise to considerable difficulties in system analysis and design. The main purpose of this paper is to handle the dynamic modeling problem with state constraints by combining the extended Kalman filtering and constrained optimization algorithms via the maximization probability method. More specifically, a recently developed SPSO algorithm is used to cope with the constrained optimization problem by converting it into an unconstrained optimization one through adding a penalty term to the objective function. The proposed algorithm is then employed to simultaneously identify the parameters and states of a lateral flow immunoassay model. It is shown that the proposed algorithm gives much improved performance over the traditional EKF method.This work was supported in part by the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, Natural Science Foundation of China under Grants 61104041, International Science and Technology Cooperation Project of Fujian Province of China under Grant 2009I0016

Inferring robust gene networks from expression data by a sensitivity-based incremental evolution method

<p>Abstract</p> <p>Background</p> <p>Reconstructing gene regulatory networks (GRNs) from expression data is one of the most important challenges in systems biology research. Many computational models and methods have been proposed to automate the process of network reconstruction. Inferring robust networks with desired behaviours remains challenging, however. This problem is related to network dynamics but has yet to be investigated using network modeling.</p> <p>Results</p> <p>We propose an incremental evolution approach for inferring GRNs that takes network robustness into consideration and can deal with a large number of network parameters. Our approach includes a sensitivity analysis procedure to iteratively select the most influential network parameters, and it uses a swarm intelligence procedure to perform parameter optimization. We have conducted a series of experiments to evaluate the external behaviors and internal robustness of the networks inferred by the proposed approach. The results and analyses have verified the effectiveness of our approach.</p> <p>Conclusions</p> <p>Sensitivity analysis is crucial to identifying the most sensitive parameters that govern the network dynamics. It can further be used to derive constraints for network parameters in the network reconstruction process. The experimental results show that the proposed approach can successfully infer robust GRNs with desired system behaviors.</p

Evolution Strategies for Learning Sparse Matrix Representations of Gene Regulatory Networks

Currently, a massive amount of temporal gene expression data is available to researchers, which makes it possible to infer Gene Regulatory Networks (GRNs). Gene regulatory networks are theoretical models to represent excitatory and inhibitory interactions between genes. GRNs are useful in understanding how genes function, and hence they are also useful in pharmaceutical and other applications in biology and medicine. However, despite the importance of GRNs, the process of inferring GRNs from observational data is very difficult. This thesis applies evolutionary algorithms to the problem of GRN inference. We propose a novel evolutionary algorithm: hierarchical evolution strategy (HES) to target the specific difficulties in GRN inference. We propose a sparse matrix representation of GRN to account for sparse connectivity in biological gene interactions. Unlike traditional evolution strategies, we divide our optimization into two concurrent processes: connectivity construction and numerical optimization. In each generation, we first establish connectivity structure of the GRN. Inside the same generation, we apply a secondary ES to find the best numerical values with those fixed connections. We also propose a hybrid crowding method to maintain high population diversity while applying the evolutionary algorithms. High population diversity leads to broader exploration area in the search space, therefore preventing premature convergence. The results obtained show that the proposed HES outperforms other algorithms, and has the potential to scale up to realistic problems with thousands of genes

LatinPSO : An algorithm for simultaneously inferring structure and parameters of ordinary differential equations models

This research is supported by the National Natural Science Foundation of China (Grants Nos.61772227, 61572227), the Science & Technology Development Foundation of Jilin Province (Grants No. 20180201045GX), the Science Foundation of Education Department of Guangdong Province (Grants Nos. 2017KQNCX251, 2018XJCQSQ026) and the Social Science Foundation of Education Department of Jilin Province (Grants No. JJKH20181315SK). WP was supported by the 2015 Scottish Crucible award funded by Royal Society of Edinburgh.Peer reviewedPostprin