Meny

Du är här

Random Boolean network models and the yeast transcriptional network

Författare:
Publiceringsår: 2003
Språk: Engelska
Sidor: 14796-14799
Publikation/Tidskrift/Serie: Proceedings of the National Academy of Sciences of the United States of America
Volym: 100
Nummer: 25
Dokumenttyp: Artikel
Förlag: National Academy of Sciences of the United States of America

Sammanfattning

The recently measured yeast transcriptional network is analyzed in terms of simplified Boolean network models, with the aim of determining feasible rule structures, given the requirement of stable solutions of the generated Boolean networks. We find that, for ensembles of generated models, those with canalyzing Boolean rules are remarkably stable, whereas those with random Boolean rules are only marginally stable. Furthermore, substantial parts of the generated networks are frozen, in the sense that they reach the same state, regardless of initial state. Thus, our ensemble approach suggests that the yeast network shows highly ordered dynamics.

Disputation

Nyckelord

  • Biology and Life Sciences
  • Physics and Astronomy
  • genetic networks
  • dynamical systems

Ö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