Algorithms and complexity in biological pattern formation problems

DOI10.1016/j.apal.2005.12.005zbMath1094.92008MaRDI QIDQ2498919

Yanyan Li

Publication date: 16 August 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.12.005

zbMATH Keywords

Turing model; genetic circuit; biological pattern formation problem

Mathematics Subject Classification ID

35K57: Reaction-diffusion equations

92C15: Developmental biology, pattern formation

92D10: Genetics and epigenetics

Related Items

Instability, complexity, and evolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling transcriptional control in gene networks -- methods, recent results, and future directions
• Convergence to cycles as a typical asymptotic behavior in smooth strongly monotone discrete-time dynamical systems
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• 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
• Multilayer feedforward networks are universal approximators
• Approximation and complexity. II: Iterated integration
• Stability and convergence in strongly monotone dynamical systems.
• Statistical mechanics of complex networks
• Convergence for Strongly Order-Preserving Semiflows
• Differential Topology
• Universal approximation bounds for superpositions of a sigmoidal function
• The chemical basis of morphogenesis
• Neural networks and physical systems with emergent collective computational abilities.
• Approximation by superpositions of a sigmoidal function
• Approximation and complexity: Liouvillean-type theorems for linear differential equations on an interval
• Dissipative systems generating any structurally stable chaos.