Information propagation within the Genetic Network of Saccharomyces cerevisiae

被引:13
作者
Chowdhury, Sharif [1 ]
Lloyd-Price, Jason [1 ]
Smolander, Olli-Pekka [1 ]
Baici, Wayne C. V. [2 ]
Hughes, Timothy R. [2 ]
Yli-Harja, Olli [1 ,3 ]
Chua, Gordon [4 ,5 ]
Ribeiro, Andre S. [1 ]
机构
[1] Tampere Univ Technol, Lab Biosyst Dynam, Computat Syst Biol Res Grp, FIN-33101 Tampere, Finland
[2] Univ Toronto, Banting & Best Dept Med Res, Toronto, ON M5S 3F1, Canada
[3] Inst Syst Biol, Seattle, WA 98103 USA
[4] Univ Calgary, Inst Biocomplex & Informat, Calgary, AB T2N 1N4, Canada
[5] Univ Calgary, Dept Biol Sci, Calgary, AB T2N 1N4, Canada
基金
芬兰科学院;
关键词
REGULATORY NETWORKS; DYNAMICS; EXPRESSION; CELLS; TIME; CRITICALITY; MODELS;
D O I
10.1186/1752-0509-4-143
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: A gene network's capacity to process information, so as to bind past events to future actions, depends on its structure and logic. From previous and new microarray measurements in Saccharomyces cerevisiae following gene deletions and overexpressions, we identify a core gene regulatory network (GRN) of functional interactions between 328 genes and the transfer functions of each gene. Inferred connections are verified by gene enrichment. Results: We find that this core network has a generalized clustering coefficient that is much higher than chance. The inferred Boolean transfer functions have a mean p-bias of 0.41, and thus similar amounts of activation and repression interactions. However, the distribution of p-biases differs significantly from what is expected by chance that, along with the high mean connectivity, is found to cause the core GRN of S. cerevisiae's to have an overall sensitivity similar to critical Boolean networks. In agreement, we find that the amount of information propagated between nodes in finite time series is much higher in the inferred core GRN of S. cerevisiae than what is expected by chance. Conclusions: We suggest that S. cerevisiae is likely to have evolved a core GRN with enhanced information propagation among its genes.
引用
收藏
页数:10
相关论文
共 33 条
[1]  
Airoldi E.M., 2005, ACM SIGKDD Explorations, V7, P13
[2]  
Arkin A, 1998, GENETICS, V149, P1633
[3]   The Information Coded in the Yeast Response Elements Accounts for Most of the Topological Properties of Its Transcriptional Regulation Network [J].
Balcan, Duygu ;
Kabakcioglu, Alkan ;
Mungan, Muhittin ;
Erzan, Ayse .
PLOS ONE, 2007, 2 (06)
[4]   Content-based networks: A pedagogical overview [J].
Balcan, Duygu ;
Erzan, Ayse .
CHAOS, 2007, 17 (02)
[5]   Critical Dynamics in Genetic Regulatory Networks: Examples from Four Kingdoms [J].
Balleza, Enrique ;
Alvarez-Buylla, Elena R. ;
Chaos, Alvaro ;
Kauffman, Stuart ;
Shmulevich, Ilya ;
Aldana, Maximino .
PLOS ONE, 2008, 3 (06)
[6]   Real-time computation at the edge of chaos in recurrent neural networks [J].
Bertschinger, N ;
Natschläger, T .
NEURAL COMPUTATION, 2004, 16 (07) :1413-1436
[7]  
CHI Y, 2001, GENE DEV, V15
[8]   Transcriptional networks: reverse-engineering gene regulation on a global scale [J].
Chua, G ;
Robinson, MD ;
Morris, Q ;
Hughes, TR .
CURRENT OPINION IN MICROBIOLOGY, 2004, 7 (06) :638-646
[9]   Identifying transcription factor functions and targets by phenotypic activation [J].
Chua, Gordon ;
Morris, Quaid D. ;
Sopko, Richelle ;
Robinson, Mark D. ;
Ryan, Owen ;
Chan, Esther T. ;
Frey, Brendan J. ;
Andrews, Brenda J. ;
Boone, Charles ;
Hughes, Timothy R. .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2006, 103 (32) :12045-12050
[10]   UPPER AND LOWER TIME-BOUNDS FOR PARALLEL RANDOM-ACCESS MACHINES WITHOUT SIMULTANEOUS WRITES [J].
COOK, S ;
DWORK, C ;
REISCHUK, R .
SIAM JOURNAL ON COMPUTING, 1986, 15 (01) :87-97