77 research outputs found

    Chronic Morphine Alters the Presynaptic Protein Profile: Identification of Novel Molecular Targets Using Proteomics and Network Analysis

    Get PDF
    Opiates produce significant and persistent changes in synaptic transmission; knowledge of the proteins involved in these changes may help to understand the molecular mechanisms underlying opiate dependence. Using an integrated quantitative proteomics and systems biology approach, we explored changes in the presynaptic protein profile following a paradigm of chronic morphine administration that leads to the development of dependence. For this, we isolated presynaptic fractions from the striata of rats treated with saline or escalating doses of morphine, and analyzed the proteins in these fractions using differential isotopic labeling. We identified 30 proteins that were significantly altered by morphine and integrated them into a protein-protein interaction (PPI) network representing potential morphine-regulated protein complexes. Graph theory-based analysis of this network revealed clusters of densely connected and functionally related morphine-regulated clusters of proteins. One of the clusters contained molecular chaperones thought to be involved in regulation of neurotransmission. Within this cluster, cysteine-string protein (CSP) and the heat shock protein Hsc70 were downregulated by morphine. Interestingly, Hsp90, a heat shock protein that normally interacts with CSP and Hsc70, was upregulated by morphine. Moreover, treatment with the selective Hsp90 inhibitor, geldanamycin, decreased the somatic signs of naloxone-precipitated morphine withdrawal, suggesting that Hsp90 upregulation at the presynapse plays a role in the expression of morphine dependence. Thus, integration of proteomics, network analysis, and behavioral studies has provided a greater understanding of morphine-induced alterations in synaptic composition, and identified a potential novel therapeutic target for opiate dependence

    Temporal proteomic profiling of postnatal human cortical development.

    Get PDF
    Healthy cortical development depends on precise regulation of transcription and translation. However, the dynamics of how proteins are expressed, function and interact across postnatal human cortical development remain poorly understood. We surveyed the proteomic landscape of 69 dorsolateral prefrontal cortex samples across seven stages of postnatal life and integrated these data with paired transcriptome data. We detected 911 proteins by liquid chromatography-mass spectrometry, and 83 were significantly associated with postnatal age (FDR < 5%). Network analysis identified three modules of co-regulated proteins correlated with age, including two modules with increasing expression involved in gliogenesis and NADH metabolism and one neurogenesis-related module with decreasing expression throughout development. Integration with paired transcriptome data revealed that these age-related protein modules overlapped with RNA modules and displayed collinear developmental trajectories. Importantly, RNA expression profiles that are dynamically regulated throughout cortical development display tighter correlations with their respective translated protein expression compared to those RNA profiles that are not. Moreover, the correspondence between RNA and protein expression significantly decreases as a function of cortical aging, especially for genes involved in myelination and cytoskeleton organization. Finally, we used this data resource to elucidate the functional impact of genetic risk loci for intellectual disability, converging on gliogenesis, myelination and ATP-metabolism modules in the proteome and transcriptome. We share all data in an interactive, searchable companion website. Collectively, our findings reveal dynamic aspects of protein regulation and provide new insights into brain development, maturation, and disease

    Monotonicity, frustration, and ordered response: an analysis of the energy landscape of perturbed large-scale biological networks

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>For large-scale biological networks represented as signed graphs, the index of frustration measures how far a network is from a monotone system, i.e., how incoherently the system responds to perturbations.</p> <p>Results</p> <p>In this paper we find that the frustration is systematically lower in transcriptional networks (modeled at functional level) than in signaling and metabolic networks (modeled at stoichiometric level). A possible interpretation of this result is in terms of energetic cost of an interaction: an erroneous or contradictory transcriptional action costs much more than a signaling/metabolic error, and therefore must be avoided as much as possible. Averaging over all possible perturbations, however, we also find that unlike for transcriptional networks, in the signaling/metabolic networks the probability of finding the system in its least frustrated configuration tends to be high also in correspondence of a moderate energetic regime, meaning that, in spite of the higher frustration, these networks can achieve a globally ordered response to perturbations even for moderate values of the strength of the interactions. Furthermore, an analysis of the energy landscape shows that signaling and metabolic networks lack energetic barriers around their global optima, a property also favouring global order.</p> <p>Conclusion</p> <p>In conclusion, transcriptional and signaling/metabolic networks appear to have systematic differences in both the index of frustration and the transition to global order. These differences are interpretable in terms of the different functions of the various classes of networks.</p

    A Characterization of Scale Invariant Responses in Enzymatic Networks

    Get PDF
    An ubiquitous property of biological sensory systems is adaptation: a step increase in stimulus triggers an initial change in a biochemical or physiological response, followed by a more gradual relaxation toward a basal, pre-stimulus level. Adaptation helps maintain essential variables within acceptable bounds and allows organisms to readjust themselves to an optimum and non-saturating sensitivity range when faced with a prolonged change in their environment. Recently, it was shown theoretically and experimentally that many adapting systems, both at the organism and single-cell level, enjoy a remarkable additional feature: scale invariance, meaning that the initial, transient behavior remains (approximately) the same even when the background signal level is scaled. In this work, we set out to investigate under what conditions a broadly used model of biochemical enzymatic networks will exhibit scale-invariant behavior. An exhaustive computational study led us to discover a new property of surprising simplicity and generality, uniform linearizations with fast output (ULFO), whose validity we show is both necessary and sufficient for scale invariance of enzymatic networks. Based on this study, we go on to develop a mathematical explanation of how ULFO results in scale invariance. Our work provides a surprisingly consistent, simple, and general framework for understanding this phenomenon, and results in concrete experimental predictions

    An Esrrb and nanog cell fate regulatory module controlled by feed forward loop interactions

    Get PDF
    Cell fate decisions during development are governed by multi-factorial regulatory mechanisms including chromatin remodeling, DNA methylation, binding of transcription factors to specific loci, RNA transcription and protein synthesis. However, the mechanisms by which such regulatory 'dimensions' coordinate cell fate decisions are currently poorly understood. Here we quantified the multi-dimensional molecular changes that occur in mouse embryonic stem cells (mESCs) upon depletion of Estrogen related receptor beta (Esrrb), a key pluripotency regulator. Comparative analyses of expression changes subsequent to depletion of Esrrb or Nanog, indicated that a system of interlocked feed-forward loops involving both factors, plays a central part in regulating the timing of mESC fate decisions. Taken together, our meta-analyses support a hierarchical model in which pluripotency is maintained by an Oct4-Sox2 regulatory module, while the timing of differentiation is regulated by a Nanog-Esrrb module

    Computing paths and cycles in biological interaction graphs

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Interaction graphs (signed directed graphs) provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops) and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments.</p> <p>Results</p> <p>We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible) this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops.</p> <p>Conclusion</p> <p>The calculation of shortest positive/negative paths and cycles in interaction graphs is an important method for network analysis in Systems Biology. This contribution draws the attention of the community to this important computational problem and provides a number of new algorithms, partially specifically tailored for biological interaction graphs. All algorithms have been implemented in the <it>CellNetAnalyzer </it>framework which can be downloaded for academic use at <url>http://www.mpi-magdeburg.mpg.de/projects/cna/cna.html</url>.</p

    Recovering Protein-Protein and Domain-Domain Interactions from Aggregation of IP-MS Proteomics of Coregulator Complexes

    Get PDF
    Coregulator proteins (CoRegs) are part of multi-protein complexes that transiently assemble with transcription factors and chromatin modifiers to regulate gene expression. In this study we analyzed data from 3,290 immuno-precipitations (IP) followed by mass spectrometry (MS) applied to human cell lines aimed at identifying CoRegs complexes. Using the semi-quantitative spectral counts, we scored binary protein-protein and domain-domain associations with several equations. Unlike previous applications, our methods scored prey-prey protein-protein interactions regardless of the baits used. We also predicted domain-domain interactions underlying predicted protein-protein interactions. The quality of predicted protein-protein and domain-domain interactions was evaluated using known binary interactions from the literature, whereas one protein-protein interaction, between STRN and CTTNBP2NL, was validated experimentally; and one domain-domain interaction, between the HEAT domain of PPP2R1A and the Pkinase domain of STK25, was validated using molecular docking simulations. The scoring schemes presented here recovered known, and predicted many new, complexes, protein-protein, and domain-domain interactions. The networks that resulted from the predictions are provided as a web-based interactive application at http://maayanlab.net/HT-IP-MS-2-PPI-DDI/
    corecore