University of Birmingham > Talks@bham > Artificial Intelligence and Natural Computation seminars > Reducing the time complexity of chemical reaction-network simulations to O(N)

## Reducing the time complexity of chemical reaction-network simulations to O(N)Add to your list(s) Download to your calendar using vCal - Prof Ivo F. Sbalzarini and Rajesh Ramaswamy, Institute of Theoretical Computer Science and Swiss Institute of Bioinformatics, ETH Zurich, Switzerland
- Friday 16 October 2009, 16:00-17:00
- UG40, School of Computer Science.
If you have a question about this talk, please contact Per Kristian Lehre. Note unusual time We present an alternative formulation of the exact stochastic simulation algorithm (SSA) for sampling trajectories of the chemical master equation for a well-stirred system of coupled chemical reactions. Our formulation is based on factored-out, partial reaction propensities. This novel exact SSA , called the partial propensity direct method (PDM), is highly efficient and has a computational cost that scales at most linearly with the number of chemical species, irrespective of the degree of coupling of the reaction network. In addition, we propose a sorting variant, SPDM , which is especially efficient for multiscale reaction networks. This talk is part of the Artificial Intelligence and Natural Computation seminars series. ## This talk is included in these lists:- Artificial Intelligence and Natural Computation seminars
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- UG40, School of Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsanalysis Birmingham Popular Maths Lectures Midlands Logic Seminar## Other talksThe tragic destiny of Mileva Marić Einstein TBA Counting cycles in planar graphs Wave turbulence in the Schrödinger-Helmholtz equation Horizontal Mean Curvature Flow and stochastic optimal controls Ultrafast Spectroscopy and Microscopy as probes of Energy Materials |