Patterning by genetic networks and modular principle
| dc.creator | Genieys, S. | |
| dc.creator | Vakulenko, S. | |
| dc.date | 2005-02-04 | |
| dc.date.accessioned | 2026-07-07T05:16:42Z | |
| dc.date.available | 2026-07-07T05:16:42Z | |
| dc.description | 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. | |
| dc.description | 31 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/math/0502089 | |
| dc.identifier | http://arxiv.org/abs/math/0502089 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/74083 | |
| dc.subject | Dynamical Systems | |
| dc.title | Patterning by genetic networks and modular principle | |
| dc.type | text |