has characteristic is similar to Gillespie first reaction algorithm Gibson-Bruck next reaction algorithm 2007-11-10 http://identifiers.org/biosimulators/ecell4 http://identifiers.org/biosimulators/vcell http://identifiers.org/doi/10.1021/jp993732q As with the first reaction method [http://identifiers.org/biomodels.kisao/KISAO_0000015], a putative reaction time is calculated for each reaction, and the reaction with the shortest reaction time will be realized. However, the unused calculated reaction times are not wasted. The set of reactions is organized in a priority queue to allow for the efficient search for the fastest reaction. In addition, by using a so-called dependency graph only those reaction times are recalculated in each step, that are dependent on the reaction, which has been realized. Cain Gibson and Bruck algorithm Gibson-Bruck's next reaction algorithm Gillespie-Gibson stochastic simulation algorithm SSA-GB SmartCell dk next reaction method spatial description exact solution accelerated stochastic simulation algorithm