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-spec

SUBMITTER: Birtwistle MR 

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

REPOSITORIES: biostudies-literature