Analysis of gene interactions using restricted Boolean networks and time-series data

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. We applied the proposed algorithm in a case study of the budding yeast cell cycle network using an artificial dataset. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. We have shown that this analysis can be used as the first step for gene relationships detection with a high flexibility to include biological knowledge. What we envisage with our method is a model that points out which connections should be checked in the wet lab and consequently facilitate some biological experiments. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Higa, C. H. A., Louzada, V. H. P., & Hashimoto, R. F. (2010). Analysis of gene interactions using restricted Boolean networks and time-series data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6053 LNBI, pp. 61–76). https://doi.org/10.1007/978-3-642-13078-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free