Reverse engineering gene regulatory networks from measurement with missing values

Abstract

BackgroundGene expression time series data are usually in the form of high-dimensional arrays. Unfortunately, the data may sometimes contain missing values: for either the expression values of some genes at some time points or the entire expression values of a single time point or some sets of consecutive time points. This significantly affects the performance of many algorithms for gene expression analysis that take as an input, the complete matrix of gene expression measurement. For instance, previous works have shown that gene regulatory interactions can be estimated from the complete matrix of gene expression measurement. Yet, till date, few algorithms have been proposed for the inference of gene regulatory network from gene expression data with missing values.ResultsWe describe a nonlinear dynamic stochastic model for the evolution of gene expression. The model captures the structural, dynamical, and the nonlinear natures of the underlying biomolecular systems. We present point-based Gaussian approximation (PBGA) filters for joint state and parameter estimation of the system with one-step or two-step missing measurements. The PBGA filters use Gaussian approximation and various quadrature rules, such as the unscented transform (UT), the third-degree cubature rule and the central difference rule for computing the related posteriors. The proposed algorithm is evaluated with satisfying results for synthetic networks, in silico networks released as a part of the DREAM project, and the real biological network, the in vivo reverse engineering and modeling assessment (IRMA) network of yeast Saccharomyces cerevisiae.ConclusionPBGA filters are proposed to elucidate the underlying gene regulatory network (GRN) from time series gene expression data that contain missing values. In our state-space model, we proposed a measurement model that incorporates the effect of the missing data points into the sequential algorithm. This approach produces a better inference of the model parameters and hence, more accurate prediction of the underlying GRN compared to when using the conventional Gaussian approximation (GA) filters ignoring the missing data points.Electronic supplementary materialThe online version of this article (doi:10.1186/s13637-016-0055-8) contains supplementary material, which is available to authorized users.

HSCVFNT: Inference of Time-Delayed Gene Regulatory Network Based on Complex-Valued Flexible Neural Tree Model

“…The second benchmark network is from Saccharomyces cerevisiae (IRMA network). Two gene expression time-series datasets are collected with 21 equally distributed time points by being triggered by glucose within the network [ 46 ]. In the first dataset, glucose medium is switched to galactose (switched on, named on dataset).…”

Energy-Efficient Deployment of Relay Nodes in Wireless Sensor Networks Using Evolutionary Techniques

“…DE, GSA, and ABC have been shown as promising evolutionary tools for finding global optima for a variety of optimization problems with large search space. Many research disciplines, such as cloud manufacturing [24], bioinformatics [25,26,27], electrical dispatch [28], and big data [29,30] have successfully adopted these evolutionary techniques for solving different non-trivial search problems. In general, optimization techniques converge to optimal solution in search space with predefined size, where the size is defined by a number of optimized parameters satisfying some constraints.…”

Characterization of tumor heterogeneity by latent haplotypes: a sequential Monte Carlo approach

“…We consider the following in our state-space framework: (i) the rows of the haplotype binary matrix are considered as the states of the system, exploiting the sequential construction of a binary matrix with an unknown number of columns using the Indian Buffet Process (IBP), (ii) the proportions matrix and other parameters are considered as the parameters of the model, (iii) the observed VAF at each SNV are processed, for all samples at a time. SMC is a very powerful algorithm that belongs to a broad class of recursive filtering techniques ( Ogundijo, Elmas & Wang, 2017 ; Ogundijo & Wang, 2017 ). Instead of processing all the observations at once, observations are processed sequentially, one after the other.…”