Edward Wallace
University of Chicago
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Edward Wallace.
Cell | 2015
Edward Wallace; Jamie L. Kear-Scott; Evgeny V. Pilipenko; Michael H. Schwartz; Pawel R. Laskowski; Alexandra E. Rojek; Christopher D. Katanski; Joshua A. Riback; Michael F. Dion; Alexander Franks; Edoardo M. Airoldi; Tao Pan; Bogdan Budnik; D. Allan Drummond
Heat causes protein misfolding and aggregation and, in eukaryotic cells, triggers aggregation of proteins and RNA into stress granules. We have carried out extensive proteomic studies to quantify heat-triggered aggregation and subsequent disaggregation in budding yeast, identifying >170 endogenous proteins aggregating within minutes of heat shock in multiple subcellular compartments. We demonstrate that these aggregated proteins are not misfolded and destined for degradation. Stable-isotope labeling reveals that even severely aggregated endogenous proteins are disaggregated without degradation during recovery from shock, contrasting with the rapid degradation observed for many exogenous thermolabile proteins. Although aggregation likely inactivates many cellular proteins, in the case of a heterotrimeric aminoacyl-tRNA synthetase complex, the aggregated proteins remain active with unaltered fidelity. We propose that most heat-induced aggregation of mature proteins reflects the operation of an adaptive, autoregulatory process of functionally significant aggregate assembly and disassembly that aids cellular adaptation to thermal stress.
PLOS Computational Biology | 2010
Marc Benayoun; Jack D. Cowan; Wim van Drongelen; Edward Wallace
Neuronal avalanches are a form of spontaneous activity widely observed in cortical slices and other types of nervous tissue, both in vivo and in vitro. They are characterized by irregular, isolated population bursts when many neurons fire together, where the number of spikes per burst obeys a power law distribution. We simulate, using the Gillespie algorithm, a model of neuronal avalanches based on stochastic single neurons. The network consists of excitatory and inhibitory neurons, first with all-to-all connectivity and later with random sparse connectivity. Analyzing our model using the system size expansion, we show that the model obeys the standard Wilson-Cowan equations for large network sizes ( neurons). When excitation and inhibition are closely balanced, networks of thousands of neurons exhibit irregular synchronous activity, including the characteristic power law distribution of avalanche size. We show that these avalanches are due to the balanced network having weakly stable functionally feedforward dynamics, which amplifies some small fluctuations into the large population bursts. Balanced networks are thought to underlie a variety of observed network behaviours and have useful computational properties, such as responding quickly to changes in input. Thus, the appearance of avalanches in such functionally feedforward networks indicates that avalanches may be a simple consequence of a widely present network structure, when neuron dynamics are noisy. An important implication is that a network need not be “critical” for the production of avalanches, so experimentally observed power laws in burst size may be a signature of noisy functionally feedforward structure rather than of, for example, self-organized criticality.
PLOS ONE | 2011
Edward Wallace; Marc Benayoun; Wim van Drongelen; Jack D. Cowan
Networks of neurons produce diverse patterns of oscillations, arising from the networks global properties, the propensity of individual neurons to oscillate, or a mixture of the two. Here we describe noisy limit cycles and quasi-cycles, two related mechanisms underlying emergent oscillations in neuronal networks whose individual components, stochastic spiking neurons, do not themselves oscillate. Both mechanisms are shown to produce gamma band oscillations at the population level while individual neurons fire at a rate much lower than the population frequency. Spike trains in a network undergoing noisy limit cycles display a preferred period which is not found in the case of quasi-cycles, due to the even faster decay of phase information in quasi-cycles. These oscillations persist in sparsely connected networks, and variation of the networks connectivity results in variation of the oscillation frequency. A network of such neurons behaves as a stochastic perturbation of the deterministic Wilson-Cowan equations, and the network undergoes noisy limit cycles or quasi-cycles depending on whether these have limit cycles or a weakly stable focus. These mechanisms provide a new perspective on the emergence of rhythmic firing in neural networks, showing the coexistence of population-level oscillations with very irregular individual spike trains in a simple and general framework.
Iet Systems Biology | 2012
Edward Wallace; Daniel T. Gillespie; Kevin R. Sanft; Linda R. Petzold
The linear noise approximation (LNA) is a way of approximating the stochastic time evolution of a well-stirred chemically reacting system. It can be obtained either as the lowest order correction to the deterministic chemical reaction rate equation (RRE) in van Kampens system-size expansion of the chemical master equation (CME), or by linearising the two-term-truncated chemical Kramers-Moyal equation. However, neither of those derivations sheds much light on the validity of the LNA. The problematic character of the system-size expansion of the CME for some chemical systems, the arbitrariness of truncating the chemical Kramers-Moyal equation at two terms, and the sometimes poor agreement of the LNA with the solution of the CME, have all raised concerns about the validity and usefulness of the LNA. Here, the authors argue that these concerns can be resolved by viewing the LNA as an approximation of the chemical Langevin equation (CLE). This view is already implicit in Gardiners derivation of the LNA from the truncated Kramers-Moyal equation, as that equation is mathematically equivalent to the CLE. However, the CLE can be more convincingly derived in a way that does not involve either the truncated Kramers-Moyal equation or the system-size expansion. This derivation shows that the CLE will be valid, at least for a limited span of time, for any system that is sufficiently close to the thermodynamic (large-system) limit. The relatively easy derivation of the LNA from the CLE shows that the LNA shares the CLEs conditions of validity, and it also suggests that what the LNA really gives us is a description of the initial departure of the CLE from the RRE as we back away from the thermodynamic limit to a large but finite system. The authors show that this approach to the LNA simplifies its derivation, clarifies its limitations, and affords an easier path to its solution.
PLOS Biology | 2014
John M. Zaborske; Vanessa L. Bauer DuMont; Edward Wallace; Tao Pan; Charles F. Aquadro; D. Allan Drummond
Use of the nutrient queuine to modify tRNA anticodons can change the accuracy of certain codons during protein synthesis, resulting in evolutionary recoding of fruit fly genomes.
Neural Computation | 2013
Edward Wallace; Hamid Reza Maei; P.E. Latham
The brain is easily able to process and categorize complex time-varying signals. For example, the two sentences, “It is cold in London this time of year” and “It is hot in London this time of year,” have different meanings, even though the words hot and cold appear several seconds before the ends of the two sentences. Any network that can tell these sentences apart must therefore have a long temporal memory. In other words, the current state of the network must depend on events that happened several seconds ago. This is a difficult task, as neurons are dominated by relatively short time constants—tens to hundreds of milliseconds. Nevertheless, it was recently proposed that randomly connected networks could exhibit the long memories necessary for complex temporal processing. This is an attractive idea, both for its simplicity and because little tuning of recurrent synaptic weights is required. However, we show that when connectivity is high, as it is in the mammalian brain, randomly connected networks cannot exhibit temporal memory much longer than the time constants of their constituent neurons.
Molecular Biology and Evolution | 2013
Edward Wallace; Edoardo M. Airoldi; D. Allan Drummond
A key goal in molecular evolution is to extract mechanistic insights from signatures of selection. A case study is codon usage, where despite many recent advances and hypotheses, two longstanding problems remain: the relative contribution of selection and mutation in determining codon frequencies and the relative contribution of translational speed and accuracy to selection. The relevant targets of selection--the rate of translation and of mistranslation of a codon per unit time in the cell--can only be related to mechanistic properties of the translational apparatus if the number of transcripts per cell is known, requiring use of gene expression measurements. Perhaps surprisingly, different gene-expression data sets yield markedly different estimates of selection. We show that this is largely due to measurement noise, notably due to differences between studies rather than instrument error or biological variability. We develop an analytical framework that explicitly models noise in expression in the context of the population-genetic model. Estimates of mutation and selection strength in budding yeast produced by this method are robust to the expression data set used and are substantially higher than estimates using a noise-blind approach. We introduce per-gene selection estimates that correlate well with previous scoring systems, such as the codon adaptation index, while now carrying an evolutionary interpretation. On average, selection for codon usage in budding yeast is weak, yet our estimates show that genes range from virtually unselected to average per-codon selection coefficients above the inverse population size. Our analytical framework may be generally useful for distinguishing biological signals from measurement noise in other applications that depend upon measurements of gene expression.
Proceedings of the National Academy of Sciences of the United States of America | 2012
Thomas Butler; Marc Benayoun; Edward Wallace; Wim van Drongelen; Nigel Goldenfeld; Jack D. Cowan
In the cat or primate primary visual cortex (V1), normal vision corresponds to a state where neural excitation patterns are driven by external visual stimuli. A spectacular failure mode of V1 occurs when such patterns are overwhelmed by spontaneously generated spatially self-organized patterns of neural excitation. These are experienced as geometric visual hallucinations. The problem of identifying the mechanisms by which V1 avoids this failure is made acute by recent advances in the statistical mechanics of pattern formation, which suggest that the hallucinatory state should be very robust. Here, we report how incorporating physiologically realistic long-range connections between inhibitory neurons changes the behavior of a model of V1. We find that the sparsity of long-range inhibition in V1 plays a previously unrecognized but key functional role in preserving the normal vision state. Surprisingly, it also contributes to the observed regularity of geometric visual hallucinations. Our results provide an explanation for the observed sparsity of long-range inhibition in V1—this generic architectural feature is an evolutionary adaptation that tunes V1 to the normal vision state. In addition, it has been shown that exactly the same long-range connections play a key role in the development of orientation preference maps. Thus V1’s most striking long-range features—patchy excitatory connections and sparse inhibitory connections—are strongly constrained by two requirements: the need for the visual state to be robust and the developmental requirements of the orientational preference map.
BMC Bioinformatics | 2017
Oana Carja; Tongji Xing; Edward Wallace; Joshua B. Plotkin; Premal Shah
BackgroundUsing high-throughput sequencing to monitor translation in vivo, ribosome profiling can provide critical insights into the dynamics and regulation of protein synthesis in a cell. Since its introduction in 2009, this technique has played a key role in driving biological discovery, and yet it requires a rigorous computational toolkit for widespread adoption.DescriptionWe have developed a database and a browser-based visualization tool, riboviz, that enables exploration and analysis of riboseq datasets. In implementation, riboviz consists of a comprehensive and flexible computational pipeline that allows the user to analyze private, unpublished datasets, along with a web application for comparison with published yeast datasets. Source code and detailed documentation are freely available from https://github.com/shahpr/RiboViz. The web-application is live at www.riboviz.org.Conclusionsriboviz provides a comprehensive database and analysis and visualization tool to enable comparative analyses of ribosome-profiling datasets. This toolkit will enable both the community of systems biologists who study genome-wide ribosome profiling data and also research groups focused on individual genes to identify patterns of transcriptional and translational regulation across different organisms and conditions.
Journal of Bacteriology | 2014
Edel M. Hyland; Edward Wallace; Andrew W. Murray
Few biological systems permit rigorous testing of how changes in DNA sequence give rise to adaptive phenotypes. In this study, we sought a simplified experimental system with a detailed understanding of the genotype-to-phenotype relationship that could be altered by environmental perturbations. We focused on plasmid fitness, i.e., the ability of plasmids to be stably maintained in a bacterial population, which is dictated by the plasmids replication and segregation machinery. Although plasmid replication depends on host proteins, the type II plasmid partitioning (Par) machinery is entirely plasmid encoded and relies solely on three components: parC, a centromere-like DNA sequence, ParR, a DNA-binding protein that interacts with parC, and ParM, which forms actin-like filaments that push two plasmids away from each other at cell division. Interactions between the Par operons of two related plasmids can cause incompatibility and the reduced transmission of one or both plasmids. We have identified segregation-dependent plasmid incompatibility between the highly divergent Par operons of plasmids pB171 and pCP301. Genetic and biochemical studies revealed that the incompatibility is due to the functional promiscuity of the DNA-binding protein ParRpB171, which interacts with both parC DNA sequences to direct plasmid segregation, indicating that the lack of DNA binding specificity is detrimental to plasmid fitness in this environment. This study therefore successfully utilized plasmid segregation to dissect the molecular interactions between genotype, phenotype, and fitness.