Increased Cortical-Limbic Anatomical Network Connectivity in Major Depression Revealed by Diffusion Tensor Imaging

Magnetic resonance imaging studies have reported significant functional and structural differences between depressed patients and controls. Little attention has been given, however, to the abnormalities in anatomical connectivity in depressed patients. In the present study, we aim to investigate the alterations in connectivity of whole-brain anatomical networks in those suffering from major depression by using machine learning approaches. Brain anatomical networks were extracted from diffusion magnetic resonance images obtained from both 22 first-episode, treatment-naive adults with major depressive disorder and 26 matched healthy controls. Using machine learning approaches, we differentiated depressed patients from healthy controls based on their whole-brain anatomical connectivity patterns and identified the most discriminating features that represent between-group differences. Classification results showed that 91.7% (patients = 86.4%, controls = 96.2%; permutation test, p<0.0001) of subjects were correctly classified via leave-one-out cross-validation. Moreover, the strengths of all the most discriminating connections were increased in depressed patients relative to the controls, and these connections were primarily located within the cortical-limbic network, especially the frontal-limbic network. These results not only provide initial steps toward the development of neurobiological diagnostic markers for major depressive disorder, but also suggest that abnormal cortical-limbic anatomical networks may contribute to the anatomical basis of emotional dysregulation and cognitive impairments associated with this disease.     

Accurate Path Integration in Continuous Attractor Network Models of Grid Cells

Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal''s position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat''s velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of ∼10–100 meters and ∼1–10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other.     

Modeling vegetation greenness and its climate sensitivity with deep‐learning technology

Climate sensitivity of vegetation has long been explored using statistical or process‐based models. However, great uncertainties still remain due to the methodologies’ deficiency in capturing the complex interactions between climate and vegetation. Here, we developed global gridded climate–vegetation models based on long short‐term memory (LSTM) network, which is a powerful deep‐learning algorithm for long‐time series modeling, to achieve accurate vegetation monitoring and investigate the complex relationship between climate and vegetation. We selected the normalized difference vegetation index (NDVI) that represents vegetation greenness as model outputs. The climate data (monthly temperature and precipitation) were used as inputs. We trained the networks with data from 1982 to 2003, and the data from 2004 to 2015 were used to validate the models. Error analysis and sensitivity analysis were performed to assess the model errors and investigate the sensitivity of global vegetation to climate change. Results show that models based on deep learning are very effective in simulating and predicting the vegetation greenness dynamics. For models training, the root mean square error (RMSE) is <0.01. Model validation also assure the accuracy of our models. Furthermore, sensitivity analysis of models revealed a spatial pattern of global vegetation to climate, which provides us a new way to investigate the climate sensitivity of vegetation. Our study suggests that it is a good way to integrate deep‐learning method to monitor the vegetation change under global change. In the future, we can explore more complex climatic and ecological systems with deep learning and coupling with certain physical process to better understand the nature.     

Inferring qualitative relations in genetic networks and metabolic pathways

MOTIVATION: Inferring genetic network architecture from time series data of gene expression patterns is an important topic in bioinformatics. Although inference algorithms based on the Boolean network were proposed, the Boolean network was not sufficient as a model of a genetic network. RESULTS: First, a Boolean network model with noise is proposed, together with an inference algorithm for it. Next, a qualitative network model is proposed, in which regulation rules are represented as qualitative rules and embedded in the network structure. Algorithms are also presented for inferring qualitative relations from time series data. Then, an algorithm for inferring S-systems (synergistic and saturable systems) from time series data is presented, where S-systems are based on a particular kind of nonlinear differential equation and have been applied to the analysis of various biological systems. Theoretical results are shown for Boolean networks with noises and simple qualitative networks. Computational results are shown for Boolean networks with noises and S-systems, where real data are not used because the proposed models are still conceptual and the quantity and quality of currently available data are not enough for the application of the proposed methods.     

A multistudy analysis reveals that evoked pain intensity representation is distributed across brain systems

Information is coded in the brain at multiple anatomical scales: locally, distributed across regions and networks, and globally. For pain, the scale of representation has not been formally tested, and quantitative comparisons of pain representations across regions and networks are lacking. In this multistudy analysis of 376 participants across 11 studies, we compared multivariate predictive models to investigate the spatial scale and location of evoked heat pain intensity representation. We compared models based on (a) a single most pain-predictive region or resting-state network; (b) pain-associated cortical–subcortical systems developed from prior literature (“multisystem models”); and (c) a model spanning the full brain. We estimated model accuracy using leave-one-study-out cross-validation (CV; 7 studies) and subsequently validated in 4 independent holdout studies. All spatial scales conveyed information about pain intensity, but distributed, multisystem models predicted pain 20% more accurately than any individual region or network and were more generalizable to multimodal pain (thermal, visceral, and mechanical) and specific to pain. Full brain models showed no predictive advantage over multisystem models. These findings show that multiple cortical and subcortical systems are needed to decode pain intensity, especially heat pain, and that representation of pain experience may not be circumscribed by any elementary region or canonical network. Finally, the learner generalization methods we employ provide a blueprint for evaluating the spatial scale of information in other domains.

Is pain represented by a single brain area or network, spanning multiple systems or distributed throughout the brain? fMRI brain decoding in a large multi-study dataset shows that multiple cortical and subcortical systems are needed to decode pain intensity; the approach is novel and can characterize scale of representation across diverse brain processes.     

On the Use of Published Demographic Data for Population-Level Risk Assessment in Birds

As the practice of using population models for wildlife risk assessment has become more common, so has the practice of using surrogate data, typically taken from the published scientific literature, as inputs for demographic models. This practice clearly exposes the user to inferential errors. However, it is likely to continue because demographic data are expensive to gather. We review potential errors associated with the use of previously published demographic data and how those errors propagate into the endpoints of demographic projection models. We suggest methods for inferring bias in model endpoints when multiple and opposing biases are present in the demographic input data. We provide an example using Eastern Meadowlarks (Sturnella magna), a common songbird in Midwestern grasslands and agro-ecosystems. We conclude with a brief review of methods that could improve inference made using published demographic data, including methods from life-history theory, meta-analysis, and Bayesian statistics.     

An empirical Bayes approach to inferring large-scale gene association networks

MOTIVATION: Genetic networks are often described statistically using graphical models (e.g. Bayesian networks). However, inferring the network structure offers a serious challenge in microarray analysis where the sample size is small compared to the number of considered genes. This renders many standard algorithms for graphical models inapplicable, and inferring genetic networks an 'ill-posed' inverse problem. METHODS: We introduce a novel framework for small-sample inference of graphical models from gene expression data. Specifically, we focus on the so-called graphical Gaussian models (GGMs) that are now frequently used to describe gene association networks and to detect conditionally dependent genes. Our new approach is based on (1) improved (regularized) small-sample point estimates of partial correlation, (2) an exact test of edge inclusion with adaptive estimation of the degree of freedom and (3) a heuristic network search based on false discovery rate multiple testing. Steps (2) and (3) correspond to an empirical Bayes estimate of the network topology. RESULTS: Using computer simulations, we investigate the sensitivity (power) and specificity (true negative rate) of the proposed framework to estimate GGMs from microarray data. This shows that it is possible to recover the true network topology with high accuracy even for small-sample datasets. Subsequently, we analyze gene expression data from a breast cancer tumor study and illustrate our approach by inferring a corresponding large-scale gene association network for 3883 genes.     

Bayesian Network Reconstruction Using Systems Genetics Data: Comparison of MCMC Methods

Reconstructing biological networks using high-throughput technologies has the potential to produce condition-specific interactomes. But are these reconstructed networks a reliable source of biological interactions? Do some network inference methods offer dramatically improved performance on certain types of networks? To facilitate the use of network inference methods in systems biology, we report a large-scale simulation study comparing the ability of Markov chain Monte Carlo (MCMC) samplers to reverse engineer Bayesian networks. The MCMC samplers we investigated included foundational and state-of-the-art Metropolis–Hastings and Gibbs sampling approaches, as well as novel samplers we have designed. To enable a comprehensive comparison, we simulated gene expression and genetics data from known network structures under a range of biologically plausible scenarios. We examine the overall quality of network inference via different methods, as well as how their performance is affected by network characteristics. Our simulations reveal that network size, edge density, and strength of gene-to-gene signaling are major parameters that differentiate the performance of various samplers. Specifically, more recent samplers including our novel methods outperform traditional samplers for highly interconnected large networks with strong gene-to-gene signaling. Our newly developed samplers show comparable or superior performance to the top existing methods. Moreover, this performance gain is strongest in networks with biologically oriented topology, which indicates that our novel samplers are suitable for inferring biological networks. The performance of MCMC samplers in this simulation framework can guide the choice of methods for network reconstruction using systems genetics data.     

Gene Regulatory Network Inferences Using a Maximum-Relevance and Maximum-Significance Strategy

Recovering gene regulatory networks from expression data is a challenging problem in systems biology that provides valuable information on the regulatory mechanisms of cells. A number of algorithms based on computational models are currently used to recover network topology. However, most of these algorithms have limitations. For example, many models tend to be complicated because of the “large p, small n” problem. In this paper, we propose a novel regulatory network inference method called the maximum-relevance and maximum-significance network (MRMSn) method, which converts the problem of recovering networks into a problem of how to select the regulator genes for each gene. To solve the latter problem, we present an algorithm that is based on information theory and selects the regulator genes for a specific gene by maximizing the relevance and significance. A first-order incremental search algorithm is used to search for regulator genes. Eventually, a strict constraint is adopted to adjust all of the regulatory relationships according to the obtained regulator genes and thus obtain the complete network structure. We performed our method on five different datasets and compared our method to five state-of-the-art methods for network inference based on information theory. The results confirm the effectiveness of our method.     

Inferring Gene Regulatory Networks by Singular Value Decomposition and Gravitation Field Algorithm

Reconstruction of gene regulatory networks (GRNs) is of utmost interest and has become a challenge computational problem in system biology. However, every existing inference algorithm from gene expression profiles has its own advantages and disadvantages. In particular, the effectiveness and efficiency of every previous algorithm is not high enough. In this work, we proposed a novel inference algorithm from gene expression data based on differential equation model. In this algorithm, two methods were included for inferring GRNs. Before reconstructing GRNs, singular value decomposition method was used to decompose gene expression data, determine the algorithm solution space, and get all candidate solutions of GRNs. In these generated family of candidate solutions, gravitation field algorithm was modified to infer GRNs, used to optimize the criteria of differential equation model, and search the best network structure result. The proposed algorithm is validated on both the simulated scale-free network and real benchmark gene regulatory network in networks database. Both the Bayesian method and the traditional differential equation model were also used to infer GRNs, and the results were used to compare with the proposed algorithm in our work. And genetic algorithm and simulated annealing were also used to evaluate gravitation field algorithm. The cross-validation results confirmed the effectiveness of our algorithm, which outperforms significantly other previous algorithms.     

Efficiency and cost of economical brain functional networks

Brain anatomical networks are sparse, complex, and have economical small-world properties. We investigated the efficiency and cost of human brain functional networks measured using functional magnetic resonance imaging (fMRI) in a factorial design: two groups of healthy old (N = 11; mean age = 66.5 years) and healthy young (N = 15; mean age = 24.7 years) volunteers were each scanned twice in a no-task or “resting” state following placebo or a single dose of a dopamine receptor antagonist (sulpiride 400 mg). Functional connectivity between 90 cortical and subcortical regions was estimated by wavelet correlation analysis, in the frequency interval 0.06–0.11 Hz, and thresholded to construct undirected graphs. These brain functional networks were small-world and economical in the sense of providing high global and local efficiency of parallel information processing for low connection cost. Efficiency was reduced disproportionately to cost in older people, and the detrimental effects of age on efficiency were localised to frontal and temporal cortical and subcortical regions. Dopamine antagonism also impaired global and local efficiency of the network, but this effect was differentially localised and did not interact with the effect of age. Brain functional networks have economical small-world properties—supporting efficient parallel information transfer at relatively low cost—which are differently impaired by normal aging and pharmacological blockade of dopamine transmission.     

On the influence of prior information evaluated by fully Bayesian criteria in a personalized whole-brain model of epilepsy spread

Individualized anatomical information has been used as prior knowledge in Bayesian inference paradigms of whole-brain network models. However, the actual sensitivity to such personalized information in priors is still unknown. In this study, we introduce the use of fully Bayesian information criteria and leave-one-out cross-validation technique on the subject-specific information to assess different epileptogenicity hypotheses regarding the location of pathological brain areas based on a priori knowledge from dynamical system properties. The Bayesian Virtual Epileptic Patient (BVEP) model, which relies on the fusion of structural data of individuals, a generative model of epileptiform discharges, and a self-tuning Monte Carlo sampling algorithm, is used to infer the spatial map of epileptogenicity across different brain areas. Our results indicate that measuring the out-of-sample prediction accuracy of the BVEP model with informative priors enables reliable and efficient evaluation of potential hypotheses regarding the degree of epileptogenicity across different brain regions. In contrast, while using uninformative priors, the information criteria are unable to provide strong evidence about the epileptogenicity of brain areas. We also show that the fully Bayesian criteria correctly assess different hypotheses about both structural and functional components of whole-brain models that differ across individuals. The fully Bayesian information-theory based approach used in this study suggests a patient-specific strategy for epileptogenicity hypothesis testing in generative brain network models of epilepsy to improve surgical outcomes.     

Impact of Different Training Modalities on Anthropometric and Metabolic Characteristics in Overweight/Obese Subjects: A Systematic Review and Network Meta-Analysis

Background

The aim of this systematic review of randomized controlled trials was to compare the effects of aerobic training (AET), resistance training (RT), and combined aerobic and resistance training (CT) on anthropometric parameters, blood lipids, and cardiorespiratory fitness in overweight and obese subjects.

Methods

Electronic searches for randomized controlled trials were performed in MEDLINE, EMBASE and the Cochrane Trial Register. Inclusion criteria were: Body Mass Index: ≥25 kg/m², 19+ years of age, supervised exercise training, and a minimum intervention period of 8 weeks. Anthropometric outcomes, blood lipids, and cardiorespiratory fitness parameters were included. Pooled effects were calculated by inverse-variance random effect pairwise meta-analyses and Bayesian random effects network meta-analyses.

Findings

15 trials enrolling 741 participants were included in the meta-analysis. Compared to RT, AET resulted in a significantly more pronounced reduction of body weight [mean differences (MD): -1.15 kg, p = 0.04], waist circumference [MD: -1.10 cm, p = 0.004], and fat mass [MD: -1.15 kg, p = 0.001] respectively. RT was more effective than AET in improving lean body mass [MD: 1.26 kg, p<0.00001]. When comparing CT with RT, MD in change of body weight [MD: -2.03 kg, p<0.0001], waist circumference [MD: -1.57 cm, p = 0.0002], and fat mass [MD: -1.88 kg, p<0.00001] were all in favor of CT. Results from the network meta-analyses confirmed these findings.

Conclusion

Evidence from both pairwise and network meta-analyses suggests that CT is the most efficacious means to reduce anthropometric outcomes and should be recommended in the prevention and treatment of overweight, and obesity whenever possible.     

Metabolic network discovery through reverse engineering of metabolome data

Reverse engineering of high-throughput omics data to infer underlying biological networks is one of the challenges in systems biology. However, applications in the field of metabolomics are rather limited. We have focused on a systematic analysis of metabolic network inference from in silico metabolome data based on statistical similarity measures. Three different data types based on biological/environmental variability around steady state were analyzed to compare the relative information content of the data types for inferring the network. Comparing the inference power of different similarity scores indicated the clear superiority of conditioning or pruning based scores as they have the ability to eliminate indirect interactions. We also show that a mathematical measure based on the Fisher information matrix gives clues on the information quality of different data types to better represent the underlying metabolic network topology. Results on several datasets of increasing complexity consistently show that metabolic variations observed at steady state, the simplest experimental analysis, are already informative to reveal the connectivity of the underlying metabolic network with a low false-positive rate when proper similarity-score approaches are employed. For experimental situations this implies that a single organism under slightly varying conditions may already generate more than enough information to rightly infer networks. Detailed examination of the strengths of interactions of the underlying metabolic networks demonstrates that the edges that cannot be captured by similarity scores mainly belong to metabolites connected with weak interaction strength.     

Resting-State Temporal Synchronization Networks Emerge from Connectivity Topology and Heterogeneity

Spatial patterns of coherent activity across different brain areas have been identified during the resting-state fluctuations of the brain. However, recent studies indicate that resting-state activity is not stationary, but shows complex temporal dynamics. We were interested in the spatiotemporal dynamics of the phase interactions among resting-state fMRI BOLD signals from human subjects. We found that the global phase synchrony of the BOLD signals evolves on a characteristic ultra-slow (<0.01Hz) time scale, and that its temporal variations reflect the transient formation and dissolution of multiple communities of synchronized brain regions. Synchronized communities reoccurred intermittently in time and across scanning sessions. We found that the synchronization communities relate to previously defined functional networks known to be engaged in sensory-motor or cognitive function, called resting-state networks (RSNs), including the default mode network, the somato-motor network, the visual network, the auditory network, the cognitive control networks, the self-referential network, and combinations of these and other RSNs. We studied the mechanism originating the observed spatiotemporal synchronization dynamics by using a network model of phase oscillators connected through the brain’s anatomical connectivity estimated using diffusion imaging human data. The model consistently approximates the temporal and spatial synchronization patterns of the empirical data, and reveals that multiple clusters that transiently synchronize and desynchronize emerge from the complex topology of anatomical connections, provided that oscillators are heterogeneous.     

Neural network input representations that produce accurate consensus sequences from DNA fragment assemblies.

MOTIVATION: Given inputs extracted from an aligned column of DNA bases and the underlying Perkin Elmer Applied Biosystems (ABI) fluorescent traces, our goal is to train a neural network to determine correctly the consensus base for the column. Choosing an appropriate network input representation is critical to success in this task. We empirically compare five representations; one uses only base calls and the others include trace information. RESULTS: We attained the most accurate results from networks that incorporate trace information into their input representations. Based on estimates derived from using 10-fold cross-validation, the best network topology produces consensus accuracies ranging from 99.26% to >99.98% for coverages from two to six aligned sequences. With a coverage of six, it makes only three errors in 20 000 consensus calls. In contrast, the network that only uses base calls in its input representation has over double that error rate: eight errors in 20 000 consensus calls. CONTACT: allex@cs.wisc.edu     

Met Kinetic Signature Derived from the Response to HGF/SF in a Cellular Model Predicts Breast Cancer Patient Survival

To determine the signaling pathways leading from Met activation to metastasis and poor prognosis, we measured the kinetic gene alterations in breast cancer cell lines in response to HGF/SF. Using a network inference tool we analyzed the putative protein-protein interaction pathways leading from Met to these genes and studied their specificity to Met and prognostic potential. We identified a Met kinetic signature consisting of 131 genes. The signature correlates with Met activation and with response to anti-Met therapy (p<0.005) in in-vitro models. It also identifies breast cancer patients who are at high risk to develop an aggressive disease in six large published breast cancer patient cohorts (p<0.01, N>1000). Moreover, we have identified novel putative Met pathways, which correlate with Met activity and patient prognosis. This signature may facilitate personalized therapy by identifying patients who will respond to anti-Met therapy. Moreover, this novel approach may be applied for other tyrosine kinases and other malignancies.