Higa CH, et al. (2011) Constraint-based analysis of gene interactions using restricted boolean networks and time-series data. BMC Proc 5 Suppl 2():S5
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 experiments performed using HeLa cells. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. CONCLUSIONS: The algorithm proposed can be used as a first step for detection of gene/protein interactions. It is able to infer gene relationships from time-series data of gene expression, and this inference process can be aided by a priori knowledge available.
|Status: Published||Type: Journal Article||PubMed ID: 21554763|
Topics addressed in this paper
Number of different genes curated to this paper: 11
- To find other papers on a gene and topic, click on the colored ball in the appropriate box.
- displays other papers with information about that topic for that gene.
- displays other papers in SGD that are associated with that topic.
The topic is addressed in these papers but does not describe a specific gene or chromosomal feature.
- To go to the Locus page for a gene, click on the gene name.
|Topics||Topics not linked to Genes||Genes linked to topics (#1 - 10 )|
|Topics||Genes linked to topics (#11 )|