Rule-based modelling and simulation of biochemical systems with molecular finite automata

IET Syst Biol. 2010 Nov;4(6):453-66. doi: 10.1049/iet-syb.2010.0015.

Abstract

The authors propose a theoretical formalism, molecular finite automata (MFA), to describe individual proteins as rule-based computing machines. The MFA formalism provides a framework for modelling individual protein behaviours and systems-level dynamics via construction of programmable and executable machines. Models specified within this formalism explicitly represent the context-sensitive dynamics of individual proteins driven by external inputs and represent protein-protein interactions as synchronised machine reconfigurations. Both deterministic and stochastic simulations can be applied to quantitatively compute the dynamics of MFA models. They apply the MFA formalism to model and simulate a simple example of a signal-transduction system that involves an MAP kinase cascade and a scaffold protein.

Publication types

  • Research Support, N.I.H., Extramural
  • Research Support, Non-U.S. Gov't
  • Research Support, U.S. Gov't, Non-P.H.S.

MeSH terms

  • Algorithms
  • Computational Biology / methods*
  • Computer Simulation
  • MAP Kinase Signaling System
  • Models, Biological*
  • Models, Chemical*
  • Models, Molecular
  • Monte Carlo Method
  • Proteins / chemistry*
  • Proteins / metabolism*
  • Stochastic Processes

Substances

  • Proteins