Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.

DOI10.1016/j.crma.2003.10.021zbMath1050.92003OpenAlexW1999331299MaRDI QIDQ1420170

Sergey Vakulenko, Dima Yu. Grigoriev

Publication date: 28 January 2004

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2003.10.021

Mathematics Subject Classification ID

Dynamical systems in biology (37N25) Circuits, networks (94C99) Developmental biology, pattern formation (92C15)

Related Items (4)

Complexity of gene circuits, Pfaffian functions and the morphogenesis problem. ⋮ Patterning by genetic networks ⋮ Algorithms and complexity in biological pattern formation problems ⋮ Instability, complexity, and evolution

Cites Work

• Unnamed Item
• Complexity lower bounds for computation trees with elementary transcendental function gates
• Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
• Mathematical models for biological pattern formation
• Universal approximation bounds for superpositions of a sigmoidal function
• The chemical basis of morphogenesis
• Neural networks and physical systems with emergent collective computational abilities.
• Dissipative systems generating any structurally stable chaos.

This page was built for publication: Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.