Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Genetic networks with canalyzing Boolean rules are always stable

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor: 17102-17107
Publikation/Tidskrift/Serie: Proceedings of the National Academy of Sciences of the United States of America
Volym: 101
Nummer: 49
Dokumenttyp: Artikel
Förlag: National Academy of Sciences of the United States of America

Sammanfattning

We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and flat in-degree distributions, we find that the networks are dynamically stable. Furthermore, for architectures with few inputs per node, the dynamics of the networks is close to critical. In addition, the fraction of genes that are active decreases with the number of inputs per node. These results are based upon investigating ensembles of networks using analytical methods. Also, for different in-degree distributions, the numbers of fixed points and cycles are calculated, with results intuitively consistent with stability analysis; fewer inputs per node implies more cycles, and vice versa. There are hints that genetic networks acquire broader degree distributions with evolution, and hence our results indicate that for single cells, the dynamics should become more stable with evolution. However, such an effect is very likely compensated for by multicellular dynamics, because one expects less stability when interactions among cells are included. We verify this by simulations of a simple model for interactions among cells.

Disputation

Nyckelord

  • Physics and Astronomy
  • Biology and Life Sciences

Övriga

Published
Yes
  • ISSN: 0027-8424
  • ISSN: 1091-6490

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen