2010
DOI: 10.1049/iet-syb.2010.0015
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: We propose a theoretical formalism, molecular finite automata (MFA), to describe individual proteins as rule-based computing machines. The MFA formalism provides a framework for modeling individual protein behaviors 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 synchronized machine reconfi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 58 publications
1
12
0
Order By: Relevance
“…Lemons et al 65 have recently proposed conventions that allow such graphs to be used to annotate rule-based models. (Incidentally, these conventions are consistent with the related representational formalism of Yang et al 71 .) In Fig.…”
Section: Resultssupporting
confidence: 86%
“…Lemons et al 65 have recently proposed conventions that allow such graphs to be used to annotate rule-based models. (Incidentally, these conventions are consistent with the related representational formalism of Yang et al 71 .) In Fig.…”
Section: Resultssupporting
confidence: 86%
“…Yang et al [8] have proposed a specification formalism based on finite automata . Models specified in their Molecular Finite Automata (MFA) framework can then be used to generate and simulate a system of ODEs or for stochastic simulation using a kinetic Monte Carlo algorithm.…”
Section: The Specification Problemmentioning
confidence: 99%
“…Modeling such multi-state systems poses two problems: the problem of how to describe and specify a multi-state system (the “specification problem”) and the problem of how to use a computer to simulate the progress of the system over time (the “computation problem”). To address the specification problem, modelers have in recent years moved away from explicit specification of all possible states and towards rule-based formalisms that allow for implicit model specification, including the κ-calculus [1] , BioNetGen [2] [5] , the Allosteric Network Compiler [6] , and others [7] , [8] . To tackle the computation problem, they have turned to particle-based methods that have in many cases proved more computationally efficient than population-based methods based on ordinary differential equations , partial differential equations , or the Gillespie stochastic simulation algorithm [9] , [10] .…”
mentioning
confidence: 99%
“…Similarly rule-based formalisms are also being applied to coarse-grain patterns in chemical-kinetic models (Feret et al, 2009; Yang et al, 2010), providing scalable tools to describe complex interactions in cellular systems that begin at the molecular level.…”
Section: Computational Techniques and Advances: Systems Biology Applimentioning
confidence: 99%