Abstract
In this paper, we propose a computational method for estimating gene networks by the Boolean network model. The Boolean networks have some practical problems in analyzing DNA microarray gene expression data: One is the choice of threshold value for discretization of gene expression data, since expression data take continuous variables. The other problem is that it is often the case that the optimal gene network is not determined uniquely and it is difficult to choose the optimal one from the candidates by using expression data only. To solve these problems, we use the binding location data produced by Lee et al. [8] together with expression data and illustrate a strategy to decide the optimal threshold and gene network. To show the effectiveness of the proposed method, we analyze Saccharomyces cerevisiae cell cycle gene expression data as a real application.
Original language | English |
---|---|
Pages (from-to) | 349-356 |
Number of pages | 8 |
Journal | Lecture Notes in Computer Science |
Volume | 3482 |
Issue number | III |
DOIs | |
Publication status | Published - 2005 |
Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: May 9 2005 → May 12 2005 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science