Abstract
BackgroundA 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.ResultsWe 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.ConclusionsThe 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.
Highlights
A popular model for gene regulatory networks is the Boolean network model
In order to analyze the gene interactions, we have generated several gene connections in consistent networks by using Constraint Satisfaction Problem (CSP) solver techniques which in turn utilized constraints sets built from three algorithms provided by this work
We have applied our methodology to an artificial dataset that had been generated by a Boolean network that models the budding yeast cell cycle [35], and to an experimental dataset of HeLa cells [36]
Summary
A popular model for gene regulatory networks is the Boolean network model. One of the goals of Systems Biology is to study the various cellular mechanisms and components In many cases these mechanisms are complex, where some of the interactions between the proteins are still unknown. To represent these interactions it is common to use gene regulatory networks (GRN). The simplest discrete model was introduced by Kauffman [1] and its known as Boolean network. Later, this model was modified to express uncertainty giving rise to the probabilistic Boolean network [2,3]. Friedman introduced Bayesian networks[4] as a probabilistic tool for the identification of regulatory data and showed that they can reproduce
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
