Dataset Information

Analytical reduction of combinatorial complexity arising from multiple protein modification sites.

ABSTRACT: Combinatorial complexity is a major obstacle to ordinary differential equation (ODE) modelling of biochemical networks. For example, a protein with 10 sites that can each be unphosphorylated, phosphorylated or bound to adaptor protein requires 3(10) ODEs. This problem is often dealt with by making ad hoc assumptions which have unclear validity and disallow modelling of site-specific dynamics. Such site-specific dynamics, however, are important in many biological systems. We show here that for a common biological situation where adaptors bind modified sites, binding is slow relative to modification/demodification, and binding to one modified site hinders binding to other sites, for a protein with n modification sites and m adaptor proteins the number of ODEs needed to simulate the site-specific dynamics of biologically relevant, lumped bound adaptor states is independent of the number of modification sites and equal to m + 1, giving a significant reduction in system size. These considerations can be relaxed considerably while retaining reasonably accurate descriptions of the true system dynamics. We apply the theory to model, using only 11 ODEs, the dynamics of ligand-induced phosphorylation of nine tyrosines on epidermal growth factor receptor (EGFR) and primary recruitment of six signalling proteins (Grb2, PI3K, PLC?1, SHP2, RasA1 and Shc1). The model quantitatively accounts for experimentally determined site-specific phosphorylation and dephosphorylation rates, differential affinities of binding proteins for the phosphorylated sites and binding protein expression levels. Analysis suggests that local concentration of site-specific phosphatases such as SHP2 in membrane subdomains by a factor of approximately 10(7) is critical for effective site-specific regulation. We further show how our framework can be extended with minimal effort to consider binding cooperativity between Grb2 and c-Cbl, which is important for receptor trafficking. Our theory has potentially broad application to reduce combinatorial complexity and allow practical simulation of a variety ODE models relevant to systems biology and pharmacology applications to allow exploration of key aspects of complexity that control signal flux.

SUBMITTER: Birtwistle MR

PROVIDER: S-EPMC4305424 | biostudies-literature | 2015 Feb

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Analytical reduction of combinatorial complexity arising from multiple protein modification sites.

Birtwistle Marc R MR

Journal of the Royal Society, Interface 20150201 103

Combinatorial complexity is a major obstacle to ordinary differential equation (ODE) modelling of biochemical networks. For example, a protein with 10 sites that can each be unphosphorylated, phosphorylated or bound to adaptor protein requires 3(10) ODEs. This problem is often dealt with by making ad hoc assumptions which have unclear validity and disallow modelling of site-specific dynamics. Such site-specific dynamics, however, are important in many biological systems. We show here that for a ...[more]

PMID: 25519995

Similar Datasets

Project description:BackgroundNumerous immune-mediated diseases have been associated with the class I and II HLA genes located within the major histocompatibility complex (MHC) consisting of highly polymorphic alleles encoded by the HLA-A, -B, -C, -DRB1, -DQB1 and -DPB1 loci. Genotyping for HLA alleles is complex and relatively expensive. Recent studies have demonstrated the feasibility of predicting HLA alleles, using MHC SNPs inside and outside of HLA that are typically included in SNP arrays and are commonly available in genome-wide association studies (GWAS). We have recently described a novel method that is complementary to the previous methods, for accurately predicting HLA alleles using unphased flanking SNPs genotypes. In this manuscript, we address several practical issues relevant to the application of this methodology.ResultsApplying this new methodology to three large independent study cohorts, we have evaluated the performance of the predictive models in ethnically diverse populations. Specifically, we have found that utilizing imputed in addition to genotyped SNPs generally yields comparable if not better performance in prediction accuracies. Our evaluation also supports the idea that predictive models trained on one population are transferable to other populations of the same ethnicity. Further, when the training set includes multi-ethnic populations, the resulting models are reliable and perform well for the same subpopulations across all HLA genes. In contrast, the predictive models built from single ethnic populations have superior performance within the same ethnic population, but are not likely to perform well in other ethnic populations.ConclusionsThe empirical explorations reported here provide further evidence in support of the application of this approach for predicting HLA alleles with GWAS-derived SNP data. Utilizing all available samples, we have built "state of the art" predictive models for HLA-A, -B, -C, -DRB1, -DQB1 and -DPB1. The HLA allele predictive models, along with the program used to carry out the prediction, are available on our website.

Dataset Information

Analytical reduction of combinatorial complexity arising from multiple protein modification sites.

Publications

Analytical reduction of combinatorial complexity arising from multiple protein modification sites.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets