## Abstract

Boolean models have been used to study biological systems where it is of interest to understand the qualitative behavior of the system or when the precise regulatory mechanisms are unknown. A feature of especial interest of Boolean models are the states where the system is invariant over time, because they correspond to stable patterns of the biological system. Thus, finding steady states or fixed points is an important problem in computational systems biology.Although Boolean networks provide a strong mathematical framework, the analysis by simulation is difficult for models of large size. Thus, it is necessary to develop tools to analyze large Boolean models other than by exhaustive simulation.Here we present an approach based on dimension reduction that allows us to study large Boolean models by systematically removing nodes without changing the number of steady states.

Original language | English |
---|---|

Title of host publication | Algebraic and Discrete Mathematical Methods for Modern Biology |

Pages | 121-139 |

Number of pages | 19 |

ISBN (Electronic) | 9780128012710 |

DOIs | |

State | Published - Mar 25 2015 |

### Bibliographical note

Publisher Copyright:© 2015 Elsevier Inc. All rights reserved.

## Keywords

- Boolean model
- Fixed points
- Model reduction
- Polynomial algebra
- Steady state

## ASJC Scopus subject areas

- General Mathematics