Synaptic proteome changes in mouse brain regions upon auditory discrimination learning.

Changes in synaptic efficacy underlying learning and memory processes are assumed to be associated with alterations of the protein composition of synapses. Here, we performed a quantitative proteomic screen to monitor changes in the synaptic proteome of four brain areas (auditory cortex, frontal cortex, hippocampus striatum) during auditory learning. Mice were trained in a shuttle box GO/NO-GO paradigm to discriminate between rising and falling frequency modulated tones to avoid mild electric foot shock. Control-treated mice received corresponding numbers of either the tones or the foot shocks. Six hours and 24 h later, the composition of a fraction enriched in synaptic cytomatrix-associated proteins was compared to that obtained from naïve mice by quantitative mass spectrometry. In the synaptic protein fraction obtained from trained mice, the average percentage (±SEM) of downregulated proteins (59.9 ± 0.5%) exceeded that of upregulated proteins (23.5 ± 0.8%) in the brain regions studied. This effect was significantly smaller in foot shock (42.7 ± 0.6% down, 40.7 ± 1.0% up) and tone controls (43.9 ± 1.0% down, 39.7 ± 0.9% up). These data suggest that learning processes initially induce removal and/or degradation of proteins from presynaptic and postsynaptic cytoskeletal matrices before these structures can acquire a new, postlearning organisation. In silico analysis points to a general role of insulin-like signalling in this process.

Integrating signals from the T-cell receptor and the interleukin-2 receptor.

T cells orchestrate the adaptive immune response, making them targets for immunotherapy. Although immunosuppressive therapies prevent disease progression, they also leave patients susceptible to opportunistic infections. To identify novel drug targets, we established a logical model describing T-cell receptor (TCR) signaling. However, to have a model that is able to predict new therapeutic approaches, the current drug targets must be included. Therefore, as a next step we generated the interleukin-2 receptor (IL-2R) signaling network and developed a tool to merge logical models. For IL-2R signaling, we show that STAT activation is independent of both Src- and PI3-kinases, while ERK activation depends upon both kinases and additionally requires novel PKCs. In addition, our merged model correctly predicted TCR-induced STAT activation. The combined network also allows information transfer from one receptor to add detail to another, thereby predicting that LAT mediates JNK activation in IL-2R signaling. In summary, the merged model not only enables us to unravel potential cross-talk, but it also suggests new experimental designs and provides a critical step towards designing strategies to reprogram T cells.

A logical model provides insights into T cell receptor signaling.

Cellular decisions are determined by complex molecular interaction networks. Large-scale signaling networks are currently being reconstructed, but the kinetic parameters and quantitative data that would allow for dynamic modeling are still scarce. Therefore, computational studies based upon the structure of these networks are of great interest. Here, a methodology relying on a logical formalism is applied to the functional analysis of the complex signaling network governing the activation of T cells via the T cell receptor, the CD4/CD8 co-receptors, and the accessory signaling receptor CD28. Our large-scale Boolean model, which comprises 94 nodes and 123 interactions and is based upon well-established qualitative knowledge from primary T cells, reveals important structural features (e.g., feedback loops and network-wide dependencies) and recapitulates the global behavior of this network for an array of published data on T cell activation in wild-type and knock-out conditions. More importantly, the model predicted unexpected signaling events after antibody-mediated perturbation of CD28 and after genetic knockout of the kinase Fyn that were subsequently experimentally validated. Finally, we show that the logical model reveals key elements and potential failure modes in network functioning and provides candidates for missing links. In summary, our large-scale logical model for T cell activation proved to be a promising in silico tool, and it inspires immunologists to ask new questions. We think that it holds valuable potential in foreseeing the effects of drugs and network modifications.

Automatic reconstruction of molecular and genetic networks from discrete time series data.

We apply a mathematical algorithm which processes discrete time series data to generate a complete list of Petri net structures containing the minimal number of nodes required to reproduce the data set. The completeness of the list as guaranteed by a mathematical proof allows to define a minimal set of experiments required to discriminate between alternative network structures. This in principle allows to prove all possible minimal network structures by disproving all alternative candidate structures. The dynamic behaviour of the networks in terms of a switching rule for the transitions of the Petri net is part of the result. In addition to network reconstruction, the algorithm can be used to determine how many yet undetected components at least must be involved in a certain process. The algorithm also reveals all alternative structural modifications of a network that are required to generate a predefined behaviour.

Discrete, qualitative models of interaction networks.

Logical models for cellular signaling networks are recently attracting wide interest: Their ability to integrate qualitative information at different biological levels, from receptor-ligand interactions to gene-regulatory networks, is becoming essential for understanding complex signaling behavior. We present an overview of Boolean modeling paradigms and discuss in detail an approach based on causal logical interactions that yields descriptive and predictive signaling network models. Our approach offers a mathematically well-defined concept, improving the efficiency of analytical tools to meet the demand of large-scale data sets, and can be extended into various directions to include timing information as well as multiple discrete values for components.

SynProt: A Database for Proteins of Detergent-Resistant Synaptic Protein Preparations.

Chemical synapses are highly specialized cell-cell contacts for communication between neurons in the CNS characterized by complex and dynamic protein networks at both synaptic membranes. The cytomatrix at the active zone (CAZ) organizes the apparatus for the regulated release of transmitters from the presynapse. At the postsynaptic side, the postsynaptic density constitutes the machinery for detection, integration, and transduction of the transmitter signal. Both pre- and postsynaptic protein networks represent the molecular substrates for synaptic plasticity. Their function can be altered both by regulating their composition and by post-translational modification of their components. For a comprehensive understanding of synaptic networks the entire ensemble of synaptic proteins has to be considered. To support this, we established a comprehensive database for synaptic junction proteins (SynProt database) primarily based on proteomics data obtained from biochemical preparations of detergent-resistant synaptic junctions. The database currently contains 2,788 non-redundant entries of rat, mouse, and some human proteins, which mainly have been manually extracted from 12 proteomic studies and annotated for synaptic subcellular localization. Each dataset is completed with manually added information including protein classifiers as well as automatically retrieved and updated information from public databases (UniProt and PubMed). We intend that the database will be used to support modeling of synaptic protein networks and rational experimental design.

Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks.

BACKGROUND: Mathematical modeling and analysis have become, for the study of biological and cellular processes, an important complement to experimental research. However, the structural and quantitative knowledge available for such processes is frequently limited, and measurements are often subject to inherent and possibly large uncertainties. This results in competing model hypotheses, whose kinetic parameters may not be experimentally determinable. Discriminating among these alternatives and estimating their kinetic parameters is crucial to improve the understanding of the considered process, and to benefit from the analytical tools at hand. RESULTS: In this work we present a set-based framework that allows to discriminate between competing model hypotheses and to provide guaranteed outer estimates on the model parameters that are consistent with the (possibly sparse and uncertain) experimental measurements. This is obtained by means of exact proofs of model invalidity that exploit the polynomial/rational structure of biochemical reaction networks, and by making use of an efficient strategy to balance solution accuracy and computational effort. CONCLUSIONS: The practicability of our approach is illustrated with two case studies. The first study shows that our approach allows to conclusively rule out wrong model hypotheses. The second study focuses on parameter estimation, and shows that the proposed method allows to evaluate the global influence of measurement sparsity, uncertainty, and prior knowledge on the parameter estimates. This can help in designing further experiments leading to improved parameter estimates.

Logic integer programming models for signaling networks.

We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.