Constraint Minimization for Efficient Modeling of Gene Regulatory Network

  • Authors:
  • Ramesh Ram;Madhu Chetty;Dieter Bulach

  • Affiliations:
  • Gippsland School of IT, Monash University, Churchill, Australia 3842;Gippsland School of IT, Monash University, Churchill, Australia 3842;CSIRO Livestock Industries, Australian Animal Health Laboratory, Geelong, Australia VIC 3220

  • Venue:
  • PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to various complexities, as well as noise and high dimensionality, reconstructing a gene regulatory network (GRN) from a high-throughput microarray data becomes computationally intensive.In our earlier work on causal model approach for GRN reconstruction, we had shown the superiority of Markov blanket (MB) algorithm compared to the algorithm using the existing Y and V causal models. In this paper, we show the MB algorithm can be enhanced further by application of the proposed constraint logic minimization (CLM) technique. We describe a framework for minimizing the constraint logic involved (condition independent tests) by exploiting the Markov blanket learning methods developed for a Bayesian network (BN). The constraint relationships are represented in the form of logic using K-map and with the aid of CLM increase the algorithm efficiency and the accuracy. We show improved results by investigations on both the synthetic as well as the real life yeast cell cycle data sets.