By Topic

A Universal Minimum Description Length-Based Algorithm for Inferring the Structure of Genetic 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
$33 $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

3 Author(s)
John Dougherty ; Institute of Signal Processing, Tampere University of Technology, P.O. Box 553, FI-33101 Tampere, Finland. john.dougherty@tut.fi ; Ioan Tabus ; Jaakko Astola

The Boolean network paradigm is a simple and effective way to interpret genomic systems, but discovering the structure of these networks is a difficult task. In this paper, we model genetic time series data as multivariate Boolean regression and employ the minimum description length principle to find significant relationships among the genes. The description length is based upon a universal normalized maximum likelihood model, and we use an analogue of Kolmogorov's structure function to reduce computation time. The performance of the proposed method is demonstrated on random synthetic networks.

Published in:

2007 IEEE International Workshop on Genomic Signal Processing and Statistics

Date of Conference:

10-12 June 2007