Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Random Boolean network models and the yeast transcriptional network

Kauffman, Stuart ; Peterson, Carsten LU ; Samuelsson, Björn LU and Troein, Carl LU orcid (2003) In Proceedings of the National Academy of Sciences 100(25). p.14796-14799
Abstract
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.
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
genetic networks, dynamical systems
in
Proceedings of the National Academy of Sciences
volume
100
issue
25
pages
14796 - 14799
publisher
National Academy of Sciences
external identifiers
  • wos:000187227200036
  • scopus:0345598902
  • pmid:14657375
ISSN
1091-6490
DOI
10.1073/pnas.2036429100
language
English
LU publication?
yes
id
b69667e3-e569-4aed-a73a-b4ba8eb8af2e (old id 292555)
alternative location
http://www.pnas.org/cgi/content/abstract/2036429100v1
date added to LUP
2016-04-01 11:59:34
date last changed
2024-04-23 00:52:33
@article{b69667e3-e569-4aed-a73a-b4ba8eb8af2e,
  abstract     = {{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.}},
  author       = {{Kauffman, Stuart and Peterson, Carsten and Samuelsson, Björn and Troein, Carl}},
  issn         = {{1091-6490}},
  keywords     = {{genetic networks; dynamical systems}},
  language     = {{eng}},
  number       = {{25}},
  pages        = {{14796--14799}},
  publisher    = {{National Academy of Sciences}},
  series       = {{Proceedings of the National Academy of Sciences}},
  title        = {{Random Boolean network models and the yeast transcriptional network}},
  url          = {{http://dx.doi.org/10.1073/pnas.2036429100}},
  doi          = {{10.1073/pnas.2036429100}},
  volume       = {{100}},
  year         = {{2003}},
}