Constraint-based analysis of gene interactions using restricted boolean networks and time-series data.

ABSTRACT:

Background

A popular model for gene regulatory networks is the Boolean network model. In this paper, we propose an algorithm to perform an analysis of gene regulatory interactions using the Boolean network model and time-series data. Actually, the Boolean network is restricted in the sense that only a subset of all possible Boolean functions are considered. We explore some mathematical properties of the restricted Boolean networks in order to avoid the full search approach. The problem is modeled as a Constraint Satisfaction Problem (CSP) and CSP techniques are used to solve it.

Results

We applied the proposed algorithm in two data sets. First, we used an artificial dataset obtained from a model for the budding yeast cell cycle. The second data set is derived from experiment

SUBMITTER: Higa CH 

PROVIDER: S-EPMC3090763 | biostudies-literature | 2011 May

REPOSITORIES: biostudies-literature