Showing papers by "Steven J. Plimpton published in 2013"

Statistical ensemble analysis for simulating extrinsic noise-driven response in NF-κB signaling networks

Abstract: Gene expression profiles and protein dynamics in single cells have a large cell-to-cell variability due to intracellular noise. Intracellular fluctuations originate from two sources: intrinsic noise due to the probabilistic nature of biochemical reactions and extrinsic noise due to randomized interactions of the cell with other cellular systems or its environment. Presently, there is no systematic parameterization and modeling scheme to simulate cellular response at the single cell level in the presence of extrinsic noise. In this paper, we propose a novel statistical ensemble method to simulate the distribution of heterogeneous cellular responses in single cells. We capture the effects of extrinsic noise by randomizing values of the model parameters. In this context, a statistical ensemble is a large number of system replicates, each with randomly sampled model parameters from biologically feasible intervals. We apply this statistical ensemble approach to the well-studied NF-κB signaling system. We predict several characteristic dynamic features of NF-κB response distributions; one of them is the dosage-dependent distribution of the first translocation time of NF-κB. The distributions of heterogeneous cellular responses that our statistical ensemble formulation generates reveal the effect of different cellular conditions, e.g., effects due to wild type versus mutant cells or between different dosages of external stimulants. Distributions generated in the presence of extrinsic noise yield valuable insight into underlying regulatory mechanisms, which are sometimes otherwise hidden.

Developing community codes for materials modeling

Abstract: For this article, we call scientific software a community code if it is freely available, written by a team of developers who welcome user input, and has attracted users beyond the developers. There are obviously many such materials modeling codes. The authors have been part of such efforts for many years in the field of atomistic simulation, specifically for two community codes, the LAMMPS and GULP packages for molecular dynamics and lattice dynamics respectively. Here we highlight lessons we have learned about how to create such codes and the pros and cons of being part of a community effort. Many of our experiences are similar, but we also have some differences of opinion (like modeling vs modelling). Our hope is that readers will find these lessons useful as they design, implement, and distribute their own materials modelling software for others to use.

Maintaining connected components for infinite graph streams

Abstract: We present an algorithm to maintain the connected components of a graph that arrives as an infinite stream of edges. We formalize the algorithm on X-stream, a new parallel theoretical computational model for infinite streams. Connectivity-related queries, including component spanning trees, are supported with some latency, returning the state of the graph at the time of the query. Because an infinite stream may eventually exceed the storage limits of any number of finite-memory processors, we assume an aging command or daemon where "uninteresting" edges are removed when the system nears capacity. Following an aging command the system will block queries until its data structures are repaired, but edges will continue to be accepted from the stream, never dropped. The algorithm will not fail unless a model-specific constant fraction of the aggregate memory across all processors is full. In normal operation, it will not fail unless aggregate memory is completely full.Unlike previous theoretical streaming models designed for finite graphs that assume a single shared memory machine or require arbitrary-size intemediate files, X-stream distributes a graph over a ring network of finite-memory processors. Though the model is synchronous and reminiscent of systolic algorithms, our implementation uses an asynchronous message-passing system. We argue the correctness of our X-stream connected components algorithm, and give preliminary experimental results on synthetic and real graph streams.