Biomedical subjects

Uri Alon

Publications and source records attributed to Uri Alon.

At least 19 recordsLinked to original sources

PubMed2006

Variability and memory of protein levels in human cells.

Protein expression is a stochastic process that leads to phenotypic variation among cells. The cell-cell distribution of protein levels in microorganisms has been well characterized but little is known about such variability in human cells. Here, we studied the variability of protein levels in human cells, as well as the temporal dynamics of this variability, and addressed whether cells with higher than average protein levels eventually have lower than average levels, and if so, over what timescale does this mixing occur. We measured fluctuations over time in the levels of 20 endogenous proteins in living human cells, tagged by the gene for yellow fluorescent protein at their chromosomal loci. We found variability with a standard deviation that ranged, for different proteins, from about 15% to 30% of the mean. Mixing between high and low levels occurred for all proteins, but the mixing time was longer than two cell generations (more than 40 h) for many proteins. We also tagged pairs of proteins with two colours, and found that the levels of proteins in the same biological pathway were far more correlated than those of proteins in different pathways. The persistent memory for protein levels that we found might underlie individuality in cell behaviour and could set a timescale needed for signals to affect fully every member of a cell population.

Bacterial Proteins↗

PubMed2006

The immune-body cytokine network defines a social architecture of cell interactions.

BACKGROUND: Three networks of intercellular communication can be associated with cytokine secretion; one limited to cells of the immune system (immune cells), one limited to parenchymal cells of organs and tissues (body cells), and one involving interactions between immune and body cells (immune-body interface). These cytokine connections determine the inflammatory response to injury and subsequent healing as well as the biologic consequences of the adaptive immune response to antigens. We informatically probed the cytokine database to uncover the underlying network architecture of the three networks. RESULTS: We now report that the three cytokine networks are among the densest of complex networks yet studied, and each features a characteristic profile of specific three-cell motifs. Some legitimate cytokine connections are shunned (anti-motifs). Certain immune cells can be paired by their input-output positions in a cytokine architecture tree of five tiers: macrophages (MPhi) and B cells (BC) comprise the first tier; the second tier is formed by T helper 1 (Th1) and T helper 2 (Th2) cells; the third tier includes dendritic cells (DC), mast cells (MAST), Natural Killer T cells (NK-T) and others; the fourth tier is formed by neutrophils (NEUT) and Natural Killer cells (NK); and the Cytotoxic T cell (CTL) stand alone as a fifth tier. The three-cell cytokine motif architecture of immune system cells places the immune system in a super-family that includes social networks and the World Wide Web. Body cells are less clearly stratified, although cells involved in wound healing and angiogenesis are most highly interconnected with immune cells. CONCLUSION: Cytokine network architecture creates an innate cell-communication platform that organizes the biologic outcome of antigen recognition and inflammation. Informatics sheds new light on immune-body systems organization. REVIEWERS: This article was reviewed by Neil Greenspan, Matthias von Herrath and Anne Cooke.

Journal Article↗

PubMed2006

Coding limits on the number of transcription factors.

BACKGROUND: Transcription factor proteins bind specific DNA sequences to control the expression of genes. They contain DNA binding domains which belong to several super-families, each with a specific mechanism of DNA binding. The total number of transcription factors encoded in a genome increases with the number of genes in the genome. Here, we examined the number of transcription factors from each super-family in diverse organisms. RESULTS: We find that the number of transcription factors from most super-families appears to be bounded. For example, the number of winged helix factors does not generally exceed 300, even in very large genomes. The magnitude of the maximal number of transcription factors from each super-family seems to correlate with the number of DNA bases effectively recognized by the binding mechanism of that super-family. Coding theory predicts that such upper bounds on the number of transcription factors should exist, in order to minimize cross-binding errors between transcription factors. This theory further predicts that factors with similar binding sequences should tend to have similar biological effect, so that errors based on mis-recognition are minimal. We present evidence that transcription factors with similar binding sequences tend to regulate genes with similar biological functions, supporting this prediction. CONCLUSION: The present study suggests limits on the transcription factor repertoire of cells, and suggests coding constraints that might apply more generally to the mapping between binding sites and biological function.

Amino Acid Motifs↗

PubMed2006

Optimal gene partition into operons correlates with gene functional order.

Gene arrangement into operons varies between bacterial species. Genes in a given system can be on one operon in some organisms and on several operons in other organisms. Existing theories explain why genes that work together should be on the same operon, since this allows for advantageous lateral gene transfer and accurate stoichiometry. But what causes the frequent separation into multiple operons of co-regulated genes that act together in a pathway? Here we suggest that separation is due to benefits made possible by differential regulation of each operon. We present a simple mathematical model for the optimal distribution of genes into operons based on a balance of the cost of operons and the benefit of regulation that provides 'just-when-needed' temporal order. The analysis predicts that genes are arranged such that genes on the same operon do not skip functional steps in the pathway. This prediction is supported by genomic data from 137 bacterial genomes. Our work suggests that gene arrangement is not only the result of random historical drift, genome re-arrangement and gene transfer, but has elements that are solutions of an evolutionary optimization problem. Thus gene functional order may be inferred by analyzing the operon structure across different genomes.

Bacteria↗

PubMed2006

Oscillations and variability in the p53 system.

Understanding the dynamics and variability of protein circuitry requires accurate measurements in living cells as well as theoretical models. To address this, we employed one of the best-studied protein circuits in human cells, the negative feedback loop between the tumor suppressor p53 and the oncogene Mdm2. We measured the dynamics of fluorescently tagged p53 and Mdm2 over several days in individual living cells. We found that isogenic cells in the same environment behaved in highly variable ways following DNA-damaging gamma irradiation: some cells showed undamped oscillations for at least 3 days (more than 10 peaks). The amplitude of the oscillations was much more variable than the period. Sister cells continued to oscillate in a correlated way after cell division, but lost correlation after about 11 h on average. Other cells showed low-frequency fluctuations that did not resemble oscillations. We also analyzed different families of mathematical models of the system, including a novel checkpoint mechanism. The models point to the possible source of the variability in the oscillations: low-frequency noise in protein production rates, rather than noise in other parameters such as degradation rates. This study provides a view of the extensive variability of the behavior of a protein circuit in living human cells, both from cell to cell and in the same cell over time.

Biological Clocks↗

PubMed2006

A fluctuation method to quantify in vivo fluorescence data.

Quantitative in vivo measurements are essential for developing a predictive understanding of cellular behavior. Here we present a technique that converts observed fluorescence intensities into numbers of molecules. By transiently expressing a fluorescently tagged protein and then following its dilution during growth and division, we observe asymmetric partitioning of fluorescence between daughter cells at each division. Such partition asymmetries are set by the actual numbers of proteins present, and thus provide a means to quantify fluorescence levels. We present a Bayesian algorithm that infers from such data both the fluorescence conversion factor and an estimate of the measurement error. Our algorithm works for arbitrarily sized data sets and handles consistently any missing measurements. We verify the algorithm with extensive simulation and demonstrate its application to experimental data from Escherichia coli. Our technique should provide a quantitative internal calibration to systems biology studies of both synthetic and endogenous cellular networks.

Algorithms↗

PubMed2006

Plasticity of the cis-regulatory input function of a gene.

The transcription rate of a gene is often controlled by several regulators that bind specific sites in the gene's cis-regulatory region. The combined effect of these regulators is described by a cis-regulatory input function. What determines the form of an input function, and how variable is it with respect to mutations? To address this, we employ the well-characterized lac operon of Escherichia coli, which has an elaborate input function, intermediate between Boolean AND-gate and OR-gate logic. We mapped in detail the input function of 12 variants of the lac promoter, each with different point mutations in the regulator binding sites, by means of accurate expression measurements from living cells. We find that even a few mutations can significantly change the input function, resulting in functions that resemble Pure AND gates, OR gates, or single-input switches. Other types of gates were not found. The variant input functions can be described in a unified manner by a mathematical model. The model also lets us predict which functions cannot be reached by point mutations. The input function that we studied thus appears to be plastic, in the sense that many of the mutations do not ruin the regulation completely but rather result in new ways to integrate the inputs.

Base Sequence↗

PubMed2006

Rules for biological regulation based on error minimization.

The control of gene expression involves complex mechanisms that show large variation in design. For example, genes can be turned on either by the binding of an activator (positive control) or the unbinding of a repressor (negative control). What determines the choice of mode of control for each gene? This study proposes rules for gene regulation based on the assumption that free regulatory sites are exposed to nonspecific binding errors, whereas sites bound to their cognate regulators are protected from errors. Hence, the selected mechanisms keep the sites bound to their designated regulators for most of the time, thus minimizing fitness-reducing errors. This offers an explanation of the empirically demonstrated Savageau demand rule: Genes that are needed often in the natural environment tend to be regulated by activators, and rarely needed genes tend to be regulated by repressors; in both cases, sites are bound for most of the time, and errors are minimized. The fitness advantage of error minimization appears to be readily selectable. The present approach can also generate rules for multi-regulator systems. The error-minimization framework raises several experimentally testable hypotheses. It may also apply to other biological regulation systems, such as those involving protein-protein interactions.

Binding Sites↗

PubMed2006

Dynamic proteomics in individual human cells uncovers widespread cell-cycle dependence of nuclear proteins.

We examined cell cycle-dependent changes in the proteome of human cells by systematically measuring protein dynamics in individual living cells. We used time-lapse microscopy to measure the dynamics of a random subset of 20 nuclear proteins, each tagged with yellow fluorescent protein (YFP) at its endogenous chromosomal location. We synchronized the cells in silico by aligning protein dynamics in each cell between consecutive divisions. We observed widespread (40%) cell-cycle dependence of nuclear protein levels and detected previously unknown cell cycle-dependent localization changes. This approach to dynamic proteomics can aid in discovery and accurate quantification of the extensive regulation of protein concentration and localization in individual living cells.

Bacterial Proteins↗

PubMed2006

A comprehensive library of fluorescent transcriptional reporters for Escherichia coli.

E. coli is widely used for systems biology research; there exists a need, however, for tools that can be used to accurately and comprehensively measure expression dynamics in individual living cells. To address this we present a library of transcriptional fusions of gfp to each of about 2,000 different promoters in E. coli K12, covering the great majority of the promoters in the organism. Each promoter fusion is expressed from a low-copy plasmid. We demonstrate that this library can be used to obtain highly accurate dynamic measurements of promoter activity on a genomic scale, in a glucose-lactose diauxic shift experiment. The library allowed detection of about 80 previously uncharacterized transcription units in E. coli, including putative internal promoters within previously known operons, such as the lac operon. This library can serve as a tool for accurate, high-resolution analysis of transcription networks in living E. coli cells.

Escherichia coli↗

PubMed2005

Spontaneous evolution of modularity and network motifs.

Biological networks have an inherent simplicity: they are modular with a design that can be separated into units that perform almost independently. Furthermore, they show reuse of recurring patterns termed network motifs. Little is known about the evolutionary origin of these properties. Current models of biological evolution typically produce networks that are highly nonmodular and lack understandable motifs. Here, we suggest a possible explanation for the origin of modularity and network motifs in biology. We use standard evolutionary algorithms to evolve networks. A key feature in this study is evolution under an environment (evolutionary goal) that changes in a modular fashion. That is, we repeatedly switch between several goals, each made of a different combination of subgoals. We find that such "modularly varying goals" lead to the spontaneous evolution of modular network structure and network motifs. The resulting networks rapidly evolve to satisfy each of the different goals. Such switching between related goals may represent biological evolution in a changing environment that requires different combinations of a set of basic biological functions. The present study may shed light on the evolutionary forces that promote structural simplicity in biological networks and offers ways to improve the evolutionary design of engineered systems.

Algorithms↗

PubMed2005

Optimality and evolutionary tuning of the expression level of a protein.

Different proteins have different expression levels. It is unclear to what extent these expression levels are optimized to their environment. Evolutionary theories suggest that protein expression levels maximize fitness, but the fitness as a function of protein level has seldom been directly measured. To address this, we studied the lac system of Escherichia coli, which allows the cell to use the sugar lactose for growth. We experimentally measured the growth burden due to production and maintenance of the Lac proteins (cost), as well as the growth advantage (benefit) conferred by the Lac proteins when lactose is present. The fitness function, given by the difference between the benefit and the cost, predicts that for each lactose environment there exists an optimal Lac expression level that maximizes growth rate. We then performed serial dilution evolution experiments at different lactose concentrations. In a few hundred generations, cells evolved to reach the predicted optimal expression levels. Thus, protein expression from the lac operon seems to be a solution of a cost-benefit optimization problem, and can be rapidly tuned by evolution to function optimally in new environments.

Adaptation, Physiological↗

PubMed2005

Precise temporal modulation in the response of the SOS DNA repair network in individual bacteria.

The SOS genetic network is responsible for the repair/bypass of DNA damage in bacterial cells. While the initial stages of the response have been well characterized, less is known about the dynamics of the response after induction and its shutoff. To address this, we followed the response of the SOS network in living individual Escherichia coli cells. The promoter activity (PA) of SOS genes was monitored using fluorescent protein-promoter fusions, with high temporal resolution, after ultraviolet irradiation activation. We find a temporal pattern of discrete activity peaks masked in studies of cell populations. The number of peaks increases, while their amplitude reaches saturation, as the damage level is increased. Peak timing is highly precise from cell to cell and is independent of the stage in the cell cycle at the time of damage. Evidence is presented for the involvement of the umuDC operon in maintaining the pattern of PA and its temporal precision, providing further evidence for the role UmuD cleavage plays in effecting a timed pause during the SOS response, as previously proposed. The modulations in PA we observe share many features in common with the oscillatory behavior recently observed in a mammalian DNA damage response. Our results, which reveal a hitherto unknown modulation of the SOS response, underscore the importance of carrying out dynamic measurements at the level of individual living cells in order to unravel how a natural genetic network operates at the systems level.

Bacterial Proteins↗

PubMed2005

A coherent feed-forward loop with a SUM input function prolongs flagella expression in Escherichia coli.

Complex gene-regulation networks are made of simple recurring gene circuits called network motifs. The functions of several network motifs have recently been studied experimentally, including the coherent feed-forward loop (FFL) with an AND input function that acts as a sign-sensitive delay element. Here, we study the function of the coherent FFL with a sum input function (SUM-FFL). We analyze the dynamics of this motif by means of high-resolution expression measurements in the flagella gene-regulation network, the system that allows Escherichia coli to swim. In this system, the master regulator FlhDC activates a second regulator, FliA, and both activate in an additive fashion the operons that produce the flagella motor. We find that this motif prolongs flagella expression following deactivation of the master regulator, protecting flagella production from transient loss of input signal. Thus, in contrast to the AND-FFL that shows a delay following signal activation, the SUM-FFL shows delays after signal deactivation. The SUM-FFL in this system works as theoretically predicted despite being embedded in at least two additional feedback loops. The present function might be carried out by the SUM-FFL in systems found across organisms.

Arabinose↗

PubMed2005

Gene regulation at the single-cell level.

The quantitative relation between transcription factor concentrations and the rate of protein production from downstream genes is central to the function of genetic networks. Here we show that this relation, which we call the gene regulation function (GRF), fluctuates dynamically in individual living cells, thereby limiting the accuracy with which transcriptional genetic circuits can transfer signals. Using fluorescent reporter genes and fusion proteins, we characterized the bacteriophage lambda promoter P(R) in Escherichia coli. A novel technique based on binomial errors in protein partitioning enabled calibration of in vivo biochemical parameters in molecular units. We found that protein production rates fluctuate over a time scale of about one cell cycle, while intrinsic noise decays rapidly. Thus, biochemical parameters, noise, and slowly varying cellular states together determine the effective single-cell GRF. These results can form a basis for quantitative modeling of natural gene circuits and for design of synthetic ones.

Bacterial Proteins↗

PubMed2005

Subgraphs and network motifs in geometric networks.

Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in abstract spaces such as multivariate biological or economic data sets and models of social networks. These networks often display network motifs: subgraphs that recur in the network much more often than in randomized networks. To understand the origin of the network motifs in these networks, it is important to study the subgraphs and network motifs that arise solely from geometric constraints. To address this, we analyze geometric network models, in which nodes are arranged on a lattice and edges are formed with a probability that decays with the distance between nodes. We present analytical solutions for the numbers of all three- and four-node subgraphs, in both directed and nondirected geometric networks. We also analyze geometric networks with arbitrary degree sequences and models with a bias for directed edges in one direction. Scaling rules for scaling of subgraph numbers with system size, lattice dimension, and interaction range are given. Several invariant measures are found, such as the ratio of feedback and feed-forward loops, which do not depend on system size, dimension, or connectivity function. We find that network motifs in many real-world networks, including social networks and neuronal networks, are not captured solely by these geometric models. This is in line with recent evidence that biological network motifs were selected as basic circuit elements with defined information-processing functions.

Journal Article↗

PubMed2005

Coarse-graining and self-dissimilarity of complex networks.

Can complex engineered and biological networks be coarse-grained into smaller and more understandable versions in which each node represents an entire pattern in the original network? To address this, we define coarse-graining units as connectivity patterns which can serve as the nodes of a coarse-grained network and present algorithms to detect them. We use this approach to systematically reverse-engineer electronic circuits, forming understandable high-level maps from incomprehensible transistor wiring: first, a coarse-grained version in which each node is a gate made of several transistors is established. Then the coarse-grained network is itself coarse-grained, resulting in a high-level blueprint in which each node is a circuit module made of many gates. We apply our approach also to a mammalian protein signal-transduction network, to find a simplified coarse-grained network with three main signaling channels that resemble multi-layered perceptrons made of cross-interacting MAP-kinase cascades. We find that both biological and electronic networks are "self-dissimilar," with different network motifs at each level. The present approach may be used to simplify a variety of directed and nondirected, natural and designed networks.

Algorithms↗

PubMed2005

Environmental selection of the feed-forward loop circuit in gene-regulation networks.

Gene-regulation networks contain recurring elementary circuits termed network motifs. It is of interest to understand under which environmental conditions each motif might be selected. To address this, we study one of the most significant network motifs, a three-gene circuit called the coherent feed-forward loop (FFL). The FFL has been demonstrated theoretically and experimentally to perform a basic information-processing function: it shows a delay following ON steps of an input inducer, but not after OFF steps. Here, we ask under what environmental conditions might the FFL be selected over simpler gene circuits, based on this function. We employ a theoretical cost-benefit analysis for the selection of gene circuits in a given environment. We find conditions that the environment must satisfy in order for the FFL to be selected over simpler circuits: the FFL is selected in environments where the distribution of the input pulse duration is sufficiently broad and contains both long and short pulses. Optimal values of the biochemical parameters of the FFL circuit are determined as a function of the environment such that the delay in the FFL blocks deleterious short pulses of induction. This approach can be generally used to study the evolutionary selection of other network motifs.

Amino Acid Motifs↗