## Modeling Formalism

## Displaying: 3 Found: 31 Total: 31

## Boolean Model

### Description

Boolean models model networks of genes by boolean variables that represent active and inactive states. At each time step, the state of each gene is determined by a logic rule which is a function of the state of its regulators. The state of all genes forms a global state that changes synchronously.

### Formats

## Cellular Automaton

### Description

Cellular automata are discrete dynamic models that consist on a grid of cells with a finite number of states. A cellular automaton has an initial configuration that changes at each time step through a predefined rule that calculates the state of each cell as a function of the state of its neighbors at the previous step.

### Formats

## Constraint-based Model

### Description

The constraint-based modeling procedure does not strive to find a single solution but rather finds a collection of all allowable solutions to the governing equations that can be defined (a solution space). The subsequent application of additional constraints further reduces the solution space and, consequently, reduces the number of allowable solutions that a cell can utilize. Can be analysed using flux balance analysis.