Patterning by genetic networks

DOI10.1002/MMA.670MaRDI QIDQ5717678zbMATH OpenOpenAlexFDO

Authors

Publication date 10 January 2006

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0502089

zbMATH Keywords

pattern formation

Mathematics Subject Classification ID

Reaction-diffusion equations (35K57) Neural networks for/in biological studies, artificial life and related topics (92B20) Developmental biology, pattern formation (92C15) Analytic circuit theory (94C05)

Abstract: We consider here the morphogenesis (pattern formation) problem for some genetic network models. First, we show that any given spatio-temporal pattern can be generated by a genetic network involving a sufficiently large number of genes. Moreover, patterning process can be performed by an effective algorithm. We also show that Turing's or Meinhardt's type reaction-diffusion models can be approximated by genetic networks. These results exploit the fundamental fact that the genes form functional units and are organised in blocks (modular principle). Due to this modular organisation, the genes always are capable to construct any new patterns and even any time sequences of new patterns from old patterns. Computer simulations illustrate analytical results.

Recommendations

• Algorithms and complexity in biological pattern formation problems
• Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
• Common pattern formation, modularity and phase transitions in a gene network model of morphogenesis
• Modelling the evolution of genetic regulatory networks
• scientific article; zbMATH DE number 4057336

Cites work

• Chaos in a continuous-time Boolean network
• Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
• Dynamical complexity of the Hopfield networks
• scientific article; zbMATH DE number 3705543 (Why is no real title available?)
• scientific article; zbMATH DE number 42418 (Why is no real title available?)
• scientific article; zbMATH DE number 193048 (Why is no real title available?)
• scientific article; zbMATH DE number 3390021 (Why is no real title available?)
• Introduction to Pattern Recognition
• Mathematical biology. Vol. 2: Spatial models and biomedical applications.

Cited in

(12)

• Instability, complexity, and evolution
• Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
• Inferring pattern generators on networks
• Optimal and stable random pattern formations
• Flexible and robust patterning by centralized gene networks
• scientific article; zbMATH DE number 4057336 (Why is no real title available?)
• scientific article; zbMATH DE number 1944188 (Why is no real title available?)
• The Effects of Gene Recruitment on the Evolvability and Robustness of Pattern-Forming Gene Networks
• scientific article; zbMATH DE number 2214467 (Why is no real title available?)
• Common pattern formation, modularity and phase transitions in a gene network model of morphogenesis
• A multigenerational Turing model reproduces transgressive petal spot phenotypes in hybrid \textit{Mimulus}
• Identifying network topologies that can generate Turing pattern

This page was built for publication: Patterning by genetic networks

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