Paper Info
Title
Minimal Multiset Grammars for Recurrent Dynamics.
Abstract
A biochemical network modeled by a multiset grammar may be investigated from a dynamical viewpoint by a linear recurrence system. This interesting connection between computation by a multiset grammar and a (network) recurrent dynamics poses a minimization problem, which turns out to be NP-hard.
Year
DOI
Venue
2016
10.1007/978-3-319-54072-6_12
Lecture Notes in Computer Science
Keywords
Field
DocType
Metabolic computing,Multiset grammar,NP-hardness,Optimization
Minimization problem,Rule-based machine translation,Discrete mathematics,Multiset,Grammar,Mathematics,Computation
Conference
Volume
ISSN
Citations 
10105
0302-9743
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Alessandro Farinelli166774.16
Giuditta Franco213618.34
Romeo Rizzi3895100.75