Minimal Multiset Grammars for Recurrent Dynamics

详细信息    查看全文

• 关键词：Metabolic computing ; Multiset grammar ; NP ; hardness ; Optimization
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10105
• 期：1
• 页码：177-189
• 丛书名：Membrane Computing
• ISBN：978-3-319-54072-6
• 卷排序：10105

文摘

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.