A stimulus-dependent connectivity analysis of neuronal networks

We present an analysis of interactions among neurons in stimulus-driven networks that is designed to control for effects from unmeasured neurons. This work builds on previous connectivity analyses that assumed connectivity strength to be constant with respect to the stimulus. Since unmeasured neuron activity can modulate with the stimulus, the effective strength of common input connections from such hidden neurons can also modulate with the stimulus. By explicitly accounting for the resulting stimulus-dependence of effective interactions among measured neurons, we are able to remove ambiguity in the classification of causal interactions that resulted from classification errors in the previous analyses. In this way, we can more reliably distinguish causal connections among measured neurons from common input connections that arise from hidden network nodes. The approach is derived in a general mathematical framework that can be applied to other types of networks. We illustrate the effects of stimulus-dependent connectivity estimates with simulations of neurons responding to a visual stimulus. This research was supported by the National Science Foundation grants DMS-0415409 and DMS-0748417.     

A framework for whole-cell mathematical modeling

The default framework for modeling biochemical processes is that of a constant-volume reactor operating under steady-state conditions. This is satisfactory for many applications, but not for modeling growth and division of cells. In this study, a whole-cell modeling framework is developed that assumes expanding volumes and a cell-division cycle. A spherical newborn cell is designed to grow in volume during the growth phase of the cycle. After 80% of the cycle period, the cell begins to divide by constricting about its equator, ultimately affording two spherical cells with total volume equal to twice that of the original. The cell is partitioned into two regions or volumes, namely the cytoplasm (Vcyt) and membrane (Vmem), with molecular components present in each. Both volumes change during the cell cycle; Vcyt changes in response to osmotic pressure changes as nutrients enter the cell from the environment, while Vmem changes in response to this osmotic pressure effect such that membrane thickness remains invariant. The two volumes change at different rates; in most cases, this imposes periodic or oscillatory behavior on all components within the cell. Since the framework itself rather than a particular set of reactions and components is responsible for this behavior, it should be possible to model various biochemical processes within it, affording stable periodic solutions without requiring that the biochemical process itself generates oscillations as an inherent feature. Given that these processes naturally occur in growing and dividing cells, it is reasonable to conclude that the dynamics of component concentrations will be more realistic than when modeled within constant-volume and/or steady-state frameworks. This approach is illustrated using a symbolic whole cell model.     

A continuous optimization approach for inferring parameters in mathematical models of regulatory networks

Background

The advances of systems biology have raised a large number of sophisticated mathematical models for describing the dynamic property of complex biological systems. One of the major steps in developing mathematical models is to estimate unknown parameters of the model based on experimentally measured quantities. However, experimental conditions limit the amount of data that is available for mathematical modelling. The number of unknown parameters in mathematical models may be larger than the number of observation data. The imbalance between the number of experimental data and number of unknown parameters makes reverse-engineering problems particularly challenging.

Results

To address the issue of inadequate experimental data, we propose a continuous optimization approach for making reliable inference of model parameters. This approach first uses a spline interpolation to generate continuous functions of system dynamics as well as the first and second order derivatives of continuous functions. The expanded dataset is the basis to infer unknown model parameters using various continuous optimization criteria, including the error of simulation only, error of both simulation and the first derivative, or error of simulation as well as the first and second derivatives. We use three case studies to demonstrate the accuracy and reliability of the proposed new approach. Compared with the corresponding discrete criteria using experimental data at the measurement time points only, numerical results of the ERK kinase activation module show that the continuous absolute-error criteria using both function and high order derivatives generate estimates with better accuracy. This result is also supported by the second and third case studies for the G1/S transition network and the MAP kinase pathway, respectively. This suggests that the continuous absolute-error criteria lead to more accurate estimates than the corresponding discrete criteria. We also study the robustness property of these three models to examine the reliability of estimates. Simulation results show that the models with estimated parameters using continuous fitness functions have better robustness properties than those using the corresponding discrete fitness functions.

Conclusions

The inference studies and robustness analysis suggest that the proposed continuous optimization criteria are effective and robust for estimating unknown parameters in mathematical models.

Electronic supplementary material

The online version of this article (doi:10.1186/1471-2105-15-256) contains supplementary material, which is available to authorized users.     

基于微阵列数据的基因网络预测方法研究进展

DNA微阵列技术可同时定量测定成千上万个基因在生物样本中的表达水平,从这一技术获得的全基因组范围表达数据为揭示基因间复杂调控关系提供了可能。研究人员试图通过数学和计算方法来构建遗传互作的模型,这些基因调控网络模型有聚类法、布尔网络、贝叶斯网络、微分方程等。文章对网络重建计算方法的研究现状进行了较为全面的综述,比较了不同模型的优缺点,并对该领域进一步的研究趋势进行了展望。     

A statistical framework for genome-wide scanning and testing of imprinted quantitative trait loci

Non-equivalent expression of alleles at a locus results in genomic imprinting. In this article, a statistical framework for genome-wide scanning and testing of imprinted quantitative trait loci (iQTL) underlying complex traits is developed based on experimental crosses of inbred line species in backcross populations. The joint likelihood function is composed of four component likelihood functions with each of them derived from one of four backcross families. The proposed approach models genomic imprinting effect as a probability measure with which one can test the degree of imprinting. Simulation results show that the model is robust for identifying iQTL with various degree of imprinting ranging from no imprinting, partial imprinting to complete imprinting. Under various simulation scenarios, the proposed model shows consistent parameter estimation with reasonable precision and high power in testing iQTL. When a QTL shows Mendelian effect, the proposed model also outperforms traditional Mendelian model. Extension to incorporate maternal effect is also given. The developed model, built within the maximum likelihood framework and implemented with the EM algorithm, provides a quantitative framework for testing and estimating iQTL involved in the genetic control of complex traits.     

A coarse-grained framework for spiking neuronal networks: between homogeneity and synchrony

Homogeneously structured networks of neurons driven by noise can exhibit a broad range of dynamic behavior. This dynamic behavior can range from homogeneity to synchrony, and often incorporates brief spurts of collaborative activity which we call multiple-firing-events (MFEs). These multiple-firing-events depend on neither structured architecture nor structured input, and are an emergent property of the system. Although these MFEs likely play a major role in the neuronal avalanches observed in culture and in vivo, the mechanisms underlying these MFEs cannot easily be captured using current population-dynamics models. In this work we introduce a coarse-grained framework which illustrates certain dynamics responsible for the generation of MFEs. By using a new kind of ensemble-average, this coarse-grained framework can not only address the nucleation of MFEs, but can also faithfully capture a broad range of dynamic regimes ranging from homogeneity to synchrony.     

A linear model for characterization of synchronization frequencies of neural networks

The synchronization frequency of neural networks and its dynamics have important roles in deciphering the working mechanisms of the brain. It has been widely recognized that the properties of functional network synchronization and its dynamics are jointly determined by network topology, network connection strength, i.e., the connection strength of different edges in the network, and external input signals, among other factors. However, mathematical and computational characterization of the relationships between network synchronization frequency and these three important factors are still lacking. This paper presents a novel computational simulation framework to quantitatively characterize the relationships between neural network synchronization frequency and network attributes and input signals. Specifically, we constructed a series of neural networks including simulated small-world networks, real functional working memory network derived from functional magnetic resonance imaging, and real large-scale structural brain networks derived from diffusion tensor imaging, and performed synchronization simulations on these networks via the Izhikevich neuron spiking model. Our experiments demonstrate that both of the network synchronization strength and synchronization frequency change according to the combination of input signal frequency and network self-synchronization frequency. In particular, our extensive experiments show that the network synchronization frequency can be represented via a linear combination of the network self-synchronization frequency and the input signal frequency. This finding could be attributed to an intrinsically-preserved principle in different types of neural systems, offering novel insights into the working mechanism of neural systems.     

Advances in defining signaling networks for the establishment of neuronal polarity

Neurons are highly polarized cells that have structurally and functionally distinct processes called axons and dendrites. How neurons establish polarity is one of the fundamental questions of neuroscience. In the last decade, significant progress has been made in identifying and understanding the molecular mechanisms responsible for neuronal polarization, primarily through researches conducted on cultured neurons. Advances in phosphoproteomics technologies and molecular tools have enabled comprehensive signal analysis and visualization and manipulation of signaling molecules for analyzing neuronal polarity. Furthermore, advances in gene transfer techniques have revealed the role of extracellular and intracellular signaling molecules in neuronal polarization in vivo. This review discusses the latest insights and techniques for the elucidation of the molecular mechanisms that control neuronal polarity.     

A geographical genetics framework for inferring homing reproductive behavior in fishes

One of the most intriguing patterns of migration and gene flow that affects genetic structure is the reproductive homing behavior of fishes, wherein the adults return to the areas in which they were spawned. Here we reviewed the literature on homing behavior in fish and propose an analytical framework for testing hypotheses regarding this behavior and its effects on the genetic structure of fish in an explicit geographical context, using a geographical genetics toolbox. Although disentangling the many potential causes underlying genetic population structure and unambiguously demonstrating that the homing behavior causes these genetic patterns is difficult, our framework allows the successive testing of homing behavior with increasing levels of complexity based on the following: (1) establishment of population structures among waterheads; (2) patterns of genetic variability throughout the adult migratory pool; (3) analyses of the non-migratory adult pool; and (4) comparisons among successive generations. We expect that the framework presented here will help delineating the appropriate uses of different sampling designs to make inferences regarding homing behavior and illustrate the limits imposed by the interpretation of different types of genetic data. More importantly, we hope this framework enables researchers to understand how a particular dataset can be utilized in a broader context as an ongoing part of a larger research program and thus guide future research by developing better and more integrated sampling designs.     

An autonomic routing framework for sensor networks

Current routing services for sensor networks are often designed for specific applications and network conditions, thus have difficulty in adapting to application and network dynamics. This paper proposes an autonomic framework to promote the adaptivity of routing services in sensor networks. The key idea of this framework is to maintain some feature functions that are decoupled from originally-integrated routing services. This separation enables significant service changes to be done by only tuning these functions. Measures including parameterization are taken to save the energy for changing these functions. Further, this framework includes a monitoring module to support a policy-based collaborative adaptation. This paper shows an example autonomic routing service conforming to this framework. Some of this work was done while the author was at ISI     

Synchronization of chaotic nonlinear continuous neural networks with time-varying delay

In this paper, the synchronization problem for delayed continuous time nonlinear complex neural networks is considered. The delay dependent state feed back synchronization gain matrix is obtained by considering more general case of time-varying delay. Using Lyapunov stability theory, the sufficient synchronization criteria are derived in terms of Linear Matrix Inequalities (LMIs). By decomposing the delay interval into multiple equidistant subintervals, Lyapunov-Krasovskii functionals (LKFs) are constructed on these intervals. Employing these LKFs, new delay dependent synchronization criteria are proposed in terms of LMIs for two cases with and without derivative of time-varying delay. Numerical examples are illustrated to show the effectiveness of the proposed method.