title: An analysis of the class of gene regulatory functions implied by a biochemical model.
abstract: Understanding the integrated behavior of genetic regulatory networks, in which genes regulate one another's activities via RNA and protein products, is emerging as a dominant problem in systems biology. One widely studied class of models of such networks includes genes whose expression values assume Boolean values (i.e., on or off). Design decisions in the development of Boolean network models of gene regulatory systems include the topology of the network (including the distribution of input- and output-connectivity) and the class of Boolean functions used by each gene (e.g., canalizing functions, post functions, etc.). For example, evidence from simulations suggests that biologically realistic dynamics can be produced by scale-free network topologies with canalizing Boolean functions. This work seeks further insights into the design of Boolean network models through the construction and analysis of a class of models that include more concrete biochemical mechanisms than the usual abstract model, including genes and gene products, dimerization, cis-binding sites, promoters and repressors. In this model, it is assumed that the system consists of N genes, with each gene producing one protein product. Proteins may form complexes such as dimers, trimers, etc. The model also includes cis-binding sites to which proteins may bind to form activators or repressors. Binding affinities are based on structural complementarity between proteins and binding sites, with molecular binding sites modeled by bit-strings. Biochemically plausible gene expression rules are used to derive a Boolean regulatory function for each gene in the system. The result is a network model in which both topological features and Boolean functions arise as emergent properties of the interactions of components at the biochemical level. A highly biased set of Boolean functions is observed in simulations of networks of various sizes, suggesting a new characterization of the subset of Boolean functions that are likely to appear in gene regulatory networks.
authors.affiliation: Bioinformatics and Computational Biology Department, George Mason University, Manassas, VA 20110, USA. jgrefens@gmu.edu
authors.forename: John
authors.initials: J
authors.lastname: Grefenstette
authors.forename: Sohyoung
authors.initials: S
authors.lastname: Kim
authors.forename: Stuart
authors.initials: S
authors.lastname: Kauffman
mesh_terms: D004268:DNA-Binding Proteins / Q000378:metabolism; D005809:Genes, Regulator; D016247:Information Storage and Retrieval; D008954:Models, Biological; D008956:Models, Chemical
chemical_list: D004268:DNA-Binding Proteins