In this paper, we present an efficient tree-based formulation for exact stochastic simulation algorithm (SSA) to improve the search for the next reaction firing. There are two implementations considered: one based on a complete binary tree and one based on the Huffman tree, an optimal tree for data compression.

Tree-Based Search for stochastic simulation algorithm

Zunino, Roberto
2012-01-01

Abstract

In this paper, we present an efficient tree-based formulation for exact stochastic simulation algorithm (SSA) to improve the search for the next reaction firing. There are two implementations considered: one based on a complete binary tree and one based on the Huffman tree, an optimal tree for data compression.
2012
Proceedings of the 27th Annual ACM Symposium on Applied Computing
New York, USA
ACM
9781450308571
V. H., Thanh; Zunino, Roberto
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/89040
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 18
  • ???jsp.display-item.citation.isi??? ND
social impact