David Adalsteinsson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David Adalsteinsson has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Timothy C. Elston
Department of Pharmacology, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599
3 shared publications - David Ross McMillen
Affiliation Department of Chemical and Physical Sciences, University of Toronto, Mississauga, Ontario, Canada
1 shared publication - Ioannis G. Kevrekidis
Department Of Chemical Engineering, PACM and Mathematics, Engineering Quadrangle Princeton University Olden Street 08544 Princeton NJ USA
1 shared publication - James A. Sethian
Department of Mathematics, University of California, Berkeley, USA
1 shared publication - Ken Jacobson
University of North Carolina at Chapel Hill
1 shared publication - L. J. Gray
Oak Ridge Natl Lab, Comp Sci & Math Div, Oak Ridge, TN 37831 USA
1 shared publication
Latest Publications
- 14 January 2012
- Published by Springer Nature
- p. 257-296
Computational and Modeling Strategies for Cell Motility
- 14 January 2012
- Published by Springer Nature
- p. 257-296
Computational and Modeling Strategies for Cell Motility
- Open Access
- 31 January 2010
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 5 (1) , 31-53
A cut-cell method for simulating spatial models of biochemical reaction networks in arbitrary geometries
Cells use signaling networks consisting of multiple interacting proteins to respond to changes in their environment. In many situations, such as chemotaxis, spatial and temporal information must be transmitted through the network. Recent computational studies have emphasized the importance of cellular geometry in signal transduction, but have been limited in their ability to accurately represent complex cell morphologies. We present a finite volume method that addresses this problem. Our method uses Cartesian cut cells and is second order in space and time. We use our method to simulate several models of signaling systems in realistic cell morphologies obtained from live cell images and examine the effects of geometry on signal transduction.
- 31 January 2010
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 5 (1) , 31-53
Open AccessA cut-cell method for simulating spatial models of biochemical reaction networks in arbitrary geometries
Cells use signaling networks consisting of multiple interacting proteins to respond to changes in their environment. In many situations, such as chemotaxis, spatial and temporal information must be transmitted through the network. Recent computational studies have emphasized the importance of cellular geometry in signal transduction, but have been limited in their ability to accurately represent complex cell morphologies. We present a finite volume method that addresses this problem. Our method uses Cartesian cut cells and is second order in space and time. We use our method to simulate several models of signaling systems in realistic cell morphologies obtained from live cell images and examine the effects of geometry on signal transduction.
- Open Access
- 30 September 2005
- Published by European Mathematical Society - EMS - Publishing House GmbH in Interfaces and Free Boundaries, Mathematical Analysis, Computation and Applications
- Vol. 7 (3) , 277-302
A coupled level set-boundary integral method for moving boundary simulations
A numerical method for moving boundary problems based upon level set and boundary integral formulations is presented. The interface velocity is obtained from the boundary integral solution using a Galerkin technique for post-processing function gradients on the interface. We introduce a new level set technique for propagating free boundary values in time, and couple this to a narrow band level set method. Together, they allow us to both update the function values and the location of the interface. The methods are discussed in the context of the well-studied two-dimensional nonlinear potential flow model of breaking waves over a sloping beach. The numerical results show wave breaking and rollup, and the algorithm is verified by means of convergence studies and comparisons with previous techniques.
- 30 September 2005
- Published by European Mathematical Society - EMS - Publishing House GmbH in Interfaces and Free Boundaries, Mathematical Analysis, Computation and Applications
- Vol. 7 (3) , 277-302
Open AccessA coupled level set-boundary integral method for moving boundary simulations
A numerical method for moving boundary problems based upon level set and boundary integral formulations is presented. The interface velocity is obtained from the boundary integral solution using a Galerkin technique for post-processing function gradients on the interface. We introduce a new level set technique for propagating free boundary values in time, and couple this to a narrow band level set method. Together, they allow us to both update the function values and the location of the interface. The methods are discussed in the context of the well-studied two-dimensional nonlinear potential flow model of breaking waves over a sloping beach. The numerical results show wave breaking and rollup, and the algorithm is verified by means of convergence studies and comparisons with previous techniques.
- Open Access
Gene regulatory networks: a coarse-grained, equation-free approach to multiscale computation
We present computer-assisted methods for analyzing stochastic models of gene regulatory networks. The main idea that underlies this equation-free analysis is the design and execution of appropriately-initialized short bursts of stochastic simulations; the results of these are processed to estimate coarse-grained quantities of interest, such as mesoscopic transport coefficients. In particular, using a simple model of a genetic toggle switch, we illustrate the computation of an effective free energy and of a state-dependent effective diffusion coefficient that characterize an unavailable effective Fokker-Planck equation. Additionally we illustrate the linking of equation-free techniques with continuation methods for performing a form of stochastic "bifurcation analysis"; estimation of mean switching times in the case of a bistable switch is also implemented in this equation-free context. The accuracy of our methods is tested by direct comparison with long-time stochastic simulations. This type of equation-free analysis appears to be a promising approach to computing features of the long-time, coarse-grained behavior of certain classes of complex stochastic models of gene regulatory networks, circumventing the need for long Monte Carlo simulations.
Open AccessGene regulatory networks: a coarse-grained, equation-free approach to multiscale computation
We present computer-assisted methods for analyzing stochastic models of gene regulatory networks. The main idea that underlies this equation-free analysis is the design and execution of appropriately-initialized short bursts of stochastic simulations; the results of these are processed to estimate coarse-grained quantities of interest, such as mesoscopic transport coefficients. In particular, using a simple model of a genetic toggle switch, we illustrate the computation of an effective free energy and of a state-dependent effective diffusion coefficient that characterize an unavailable effective Fokker-Planck equation. Additionally we illustrate the linking of equation-free techniques with continuation methods for performing a form of stochastic "bifurcation analysis"; estimation of mean switching times in the case of a bistable switch is also implemented in this equation-free context. The accuracy of our methods is tested by direct comparison with long-time stochastic simulations. This type of equation-free analysis appears to be a promising approach to computing features of the long-time, coarse-grained behavior of certain classes of complex stochastic models of gene regulatory networks, circumventing the need for long Monte Carlo simulations.
- 8 March 2004
- Published by Springer Nature in BMC Bioinformatics
- Vol. 5 (1) , 24
Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks
Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA) molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. We have developed the software package Biochemical Network Stochastic Simulator (BioNetS) for efficiently and accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous) for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solves the appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.
- 8 March 2004
- Published by Springer Nature in BMC Bioinformatics
- Vol. 5 (1) , 24
Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks
Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA) molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. We have developed the software package Biochemical Network Stochastic Simulator (BioNetS) for efficiently and accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous) for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solves the appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.