Bio-logic: Gene expression and the laws of combinatorial logic

被引:13
作者
Schilstra, Maria J. [1 ]
Nehaniv, Chrystopher L. [2 ]
机构
[1] Univ Hertfordshire, Sci & Technol Res Inst, Biol & Neural Comptat Grp, Hatfield AL10 9AB, Herts, England
[2] Univ Hertfordshire, Sch Comp Sci, Adapt Syst & Algorithms Res Grp, Hatfield AL10 9AB, Herts, England
基金
英国惠康基金;
关键词
transcription regulation; generic regulatory networks; enzyme kinetics; combinatorial logic; non-Boolean continuous logic; modeling;
D O I
10.1162/artl.2008.14.1.121
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
At the heart of the development of fertilized eggs into full, formed organisms and the adaptation of cells to changed conditions are genetic regulatory networks (GRNs). In higher multicellular organisms, signal selection and multiplexing are performed at the cis-regulatory domains of genes, where combinations of transcription factors (TFs) regulate the rates at which the genes are transcribed into mRNA. To be able to act as activators or repressors of gene transcription, TFs must first bind to target sequences on the regulatory domains. Two TFs that act in concert May bind entirely independently of each other, but more often binding of the first one will alter the affinity of the other for its binding site. This article presents a systematic investigation into the effect of TF binding dependences on the predicted regulatory function of this bio-logic. Four extreme scenarios, commonly used to classify enzyme activation and inhibition patterns, for the binding of two TFs were explored: independent (the TFs bind without affecting each other's affinities), competitive (the TFs compete for the same binding site), ordered (the TFs bind in a compulsory order), and joint binding (the TFs either bind as a preformed complex, or binding of one is virtually impossible in the absence of the other). The conclusions are: (1) the laws of combinatorial logic hold only for systems with independently binding TFs; (2) systems formed according to the other scenarios can mimic the Functions of their Boolean logical counterparts, but cannot be combined or decomposed in the same way; and (3) the continuously scaled output of systems consisting of competitively binding activators and repressors can be controlled more robustly than that of single TF or (quasi-)logical multi-TF systems.
引用
收藏
页码:121 / 133
页数:13
相关论文
共 21 条
[1]   QUANTITATIVE MODEL FOR GENE-REGULATION BY LAMBDA-PHAGE REPRESSOR [J].
ACKERS, GK ;
JOHNSON, AD ;
SHEA, MA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA-BIOLOGICAL SCIENCES, 1982, 79 (04) :1129-1133
[2]  
Alon U., 2006, INTRO SYSTEMS BIOL D
[3]  
Arnone MI, 1997, DEVELOPMENT, V124, P1851
[4]   Transcriptional regulation by the numbers: models [J].
Bintu, L ;
Buchler, NE ;
Garcia, HG ;
Gerland, U ;
Hwa, T ;
Kondev, J ;
Phillips, R .
CURRENT OPINION IN GENETICS & DEVELOPMENT, 2005, 15 (02) :116-124
[5]   On schemes of combinatorial transcription logic [J].
Buchler, NE ;
Gerland, U ;
Hwa, T .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (09) :5136-5141
[6]  
Chaouiya C, 2004, LECT NOTES COMPUT SC, V3099, P137
[7]  
Davidson E. H., 2001, Genomic regulatory systems: development and evolution
[8]  
DEJONG H, 2003, GROWTH FORM COMPUTER, P109
[9]   Logic functions of the genomic cis-regulatory code [J].
Istrail, S ;
Davidson, EH .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (14) :4954-4959
[10]  
Kauffman S., 1993, The Origins of Order