Bio-logic: gene expression and the laws of combinatorial logic.

Artif Life

Biological and Neural Computation Group, Science and Technology Research Institute, University of Hertfordshire, College Lane, Hatfield, Hertfordshire AL10 9AB, United Kingdom.

Published: October 2008

AI Article Synopsis

  • Genetic regulatory networks (GRNs) are essential for the development of fertilized eggs and cellular adaptation, relying on transcription factors (TFs) to regulate gene expression.
  • TFs bind to specific regulatory domains, and their interactions can be independent, competitive, ordered, or joint, affecting their ability to activate or repress gene transcription.
  • The study concludes that only independently binding TFs obey simple combinatorial logic, while other interaction types can simulate Boolean functions but lack the same combinability and decomposition, with competitively binding systems providing more robust control.

Article Abstract

At the heart of the development of fertilized eggs into fully 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.

Download full-text PDF

Source
http://dx.doi.org/10.1162/artl.2008.14.1.121DOI Listing

Publication Analysis

Top Keywords

tfs bind
16
binding tfs
12
tfs
9
binding
9
laws combinatorial
8
combinatorial logic
8
activators repressors
8
independently binding
8
binding site
8
bind
5

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!