Skip to main content
Fig. 2 | BMC Bioinformatics

Fig. 2

From: Game of neutrophils: modeling the balance between apoptosis and necrosis

Fig. 2

Summary of the Cellular Automata Algorithm. The iteration starts by randomly choosing a single activated neutrophil in the lattice. The chosen activated neutrophil then plays the game with all its immediate neighbors by calculating a payoff that is based on the payoff matrix specified in Table 1. The cost of remaining ITMs, on the other hand is calculated depending on the ITMs scheme (local or global) selected. The strategy with the higher payoff wins the game and is therefore chosen for this iteration. The absence of an activated neutrophil in the lattice means the end of the algorithm. The final number of apoptotic and necrotic neutrophils are counted

Back to article page