GlobalMIT: learning globally optimal dynamic bayesian network with the mutual information test criterion

Motivation: Dynamic Bayesian networks (DBN) are widely applied in modeling various biological networks including the gene regulatory network (GRN). Due to the NP-hard nature of learning static Bayesian network structure, most methods for learning DBN also employ either local search such as hill clim...

Full description

Saved in:
Bibliographic Details
Published inBioinformatics Vol. 27; no. 19; pp. 2765 - 2766
Main Authors Vinh, Nguyen Xuan, Chetty, Madhu, Coppel, Ross, Wangikar, Pramod P.
Format Journal Article
LanguageEnglish
Published Oxford Oxford University Press 01.10.2011
Subjects
Online AccessGet full text
ISSN1367-4803
1367-4811
1460-2059
1367-4811
DOI10.1093/bioinformatics/btr457

Cover

More Information
Summary:Motivation: Dynamic Bayesian networks (DBN) are widely applied in modeling various biological networks including the gene regulatory network (GRN). Due to the NP-hard nature of learning static Bayesian network structure, most methods for learning DBN also employ either local search such as hill climbing, or a meta stochastic global optimization framework such as genetic algorithm or simulated annealing. Results: This article presents GlobalMIT, a toolbox for learning the globally optimal DBN structure from gene expression data. We propose using a recently introduced information theoretic-based scoring metric named mutual information test (MIT). With MIT, the task of learning the globally optimal DBN is efficiently achieved in polynomial time. Availability: The toolbox, implemented in Matlab and C++, is available at http://code.google.com/p/globalmit. Contact: vinh.nguyen@monash.edu; madhu.chetty@monash.edu Supplementary information: Supplementary data is available at Bioinformatics online.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1367-4803
1367-4811
1460-2059
1367-4811
DOI:10.1093/bioinformatics/btr457