Computation in gene networks

DOI10.1063/1.1633371zbMath1080.68028OpenAlexW1969956300WikidataQ45186425 ScholiaQ45186425MaRDI QIDQ5705391

Hava T. Siegelmann, Asa Ben-Hur

Publication date: 8 November 2005

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://works.bepress.com/cgi/viewcontent.cgi?article=1013&context=hava_siegelmann

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Genetics and epigenetics (92D10)

Related Items (4)

Dynamic self-assembly in living systems as computation ⋮ The formulation of the control of an expression pattern in a gene network by propositional calculus ⋮ Robust dynamics in minimal hybrid models of genetic networks ⋮ Analysis and design of molecular machines

Cites Work

• Stable oscillations in mathematical models of biological control systems
• Computing with truly asynchronous threshold logic networks
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Queues, stacks, and transcendentality at the transition to chaos
• Generalized one-sided shifts and maps of the interval

This page was built for publication: Computation in gene networks