Cart (Loading....) | Create Account
Close category search window

Dynamic algorithm for inferring qualitative models of gene regulatory networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng Yun ; Nanyang Technol. Univ., Singapore ; Kwoh Chee Keong

It is still an open problem to identify functional relations with o(N · nk) time for any domain, where N is the number of learning instances, n is the number of genes (or variables) in the gene regulatory network (GRN) models and k is the indegree of the genes. To solve the problem, we introduce a novel algorithm, DFL (discrete function learning), for reconstructing qualitative models of GRNs from gene expression data in this paper. We analyze the complexity of O(k · N · n2) on the average and its data requirements. We also perform experiments on both synthetic and Cho et al. yeast cell cycle gene expression data to validate the efficiency and prediction performance of the DFL algorithm. The experiments of synthetic Boolean networks show that the DFL algorithm is more efficient than current algorithms without loss of prediction performances. The results of yeast cell cycle gene expression data show that the DFL algorithm can identify biologically significant models with reasonable accuracy, sensitivity and high precision with respect to the literature evidences. We further introduce a method called ε function to deal with noises in data sets. The experimental results show that the ε function method is a good supplement to the DFL algorithm.

Published in:

Computational Systems Bioinformatics Conference, 2004. CSB 2004. Proceedings. 2004 IEEE

Date of Conference:

16-19 Aug. 2004

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.