Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions

DOI10.1098/RSTA.2014.0223zbMATH Open1353.92043OpenAlexW2132305866WikidataQ44896208 ScholiaQ44896208MaRDI QIDQ2955779FDOQ2955779

Authors: Chrystopher L. Nehaniv, Attila Egri-Nagy, P. Dini, Eric Rothstein Morris, Gábor Horváth, Fariba Karimi, Daniel Schreckling, Maria Schilstra, John L. Rhodes 

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2299/16489

Recommendations

• Reaction systems
• Reaction systems: a model of computation inspired by the functioning of the living cell
• Transactions on Computational Systems Biology III
• BIOMICS: a Theory of Interaction Computing
• Reaction systems: a natural computing approach to the functioning of living cells

zbMATH Keywords

regulatory systemsweak controlfinite discrete automatapools of reversibility

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Cellular automata (computational aspects) (68Q80)

Cites Work

• SgpDec: cascade (de)compositions of finite transformation semigroups and permutation groups
• Universal coalgebra: A theory of systems
• BioAmbients: an abstraction for biological compartments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chemical organisation theory
• Title not available (Why is that?)
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• The extended equivalence and equation solvability problems for groups
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• The \(\mathfrak q\)-theory of finite semigroups.
• Algebraic Theory of Automata Networks
• Petri net modelling of biological regulatory networks
• The real numbers as a wreath product
• Title not available (Why is that?)
• Theory of finite simple groups.
• Short polynomial representations for square roots modulo \(p\)
• The arithmetic of polynomial maps over a group and the structure of certain permutational polynomial groups. I
• Realizing complex boolean functions with simple groups
• Unification in primal algebras, their powers and their varieties
• The Near-Ring Generated by the Inner Automorphisms of a Finite Simple Group
• Realization is universal
• Cascade synthesis of finite-state machines
• An assertion concerning functionally complete algebras and NP-completeness
• Title not available (Why is that?)
• On straight words and minimal permutators in finite transformation semigroups

Cited In (4)

• Symmetry principles via interactions and symmetry-violations.
• BIOMICS: a Theory of Interaction Computing
• From relation to emulation and interpretation: computer algebra implementation of the covering lemma for finite transformation semigroups
• Philosophy of Computation

Uses Software

• SgpDec
• BioAmbient Machine

This page was built for publication: Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955779)