Electronic Communications of the EASST 2009
DOI: 10.14279/tuj.eceasst.18.276.259
|View full text |Cite
|
Sign up to set email alerts
|

Gene Expression with General Purpose Graph Rewriting Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Graph transformation can be viewed as an algebraic approach that creates a new graph from a given one by applying rewriting rules [3]. In computational biology graph transformation has been applied in different contexts: Beck et al showed how graph-rewriting algorithms can be employed to model one aspect of whole-organism morphogenesis [2]; the complexity of RNA tertiary structure motifs was encoded by a graph-grammar [15]; and gene expression was simulated using a general purpose graph rewriting system [14]. Generally speaking, graph rewriting approaches is quite natural to use when modelling systems whose states have a network structure [1].…”
Section: Introductionmentioning
confidence: 99%
“…Graph transformation can be viewed as an algebraic approach that creates a new graph from a given one by applying rewriting rules [3]. In computational biology graph transformation has been applied in different contexts: Beck et al showed how graph-rewriting algorithms can be employed to model one aspect of whole-organism morphogenesis [2]; the complexity of RNA tertiary structure motifs was encoded by a graph-grammar [15]; and gene expression was simulated using a general purpose graph rewriting system [14]. Generally speaking, graph rewriting approaches is quite natural to use when modelling systems whose states have a network structure [1].…”
Section: Introductionmentioning
confidence: 99%