Skip Navigation


Bioinformatics Advance Access originally published online on January 9, 2009
Bioinformatics 2009 25(4):490-496; doi:10.1093/bioinformatics/btn658
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow All Versions of this Article:
25/4/490    most recent
btn658v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Joshi, A.
Right arrow Articles by Michoel, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Joshi, A.
Right arrow Articles by Michoel, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Module networks revisited: computational assessment and prioritization of model predictions

Anagha Joshi 1,2, Riet De Smet 3, Kathleen Marchal 3,4, Yves Van de Peer 1,2 and Tom Michoel 1,2,*

1Department of Plant Systems Biology, VIB, 2Department of Molecular Genetics, Ghent University, Technologiepark 927, B-9052 Gent, 3CMPG, Department of Microbial and Molecular Systems, KULeuven, Kasteelpark Arenberg 20 and 4ESAT-SCD, KULeuven, Kasteelpark Arenberg 10, B-3001 Leuven, Belgium

*To whom correspondence should be addressed.


   Abstract

Motivation: The solution of high-dimensional inference and prediction problems in computational biology is almost always a compromise between mathematical theory and practical constraints, such as limited computational resources. As time progresses, computational power increases but well-established inference methods often remain locked in their initial suboptimal solution.

Results: We revisit the approach of Segal et al. to infer regulatory modules and their condition-specific regulators from gene expression data. In contrast to their direct optimization-based solution, we use a more representative centroid-like solution extracted from an ensemble of possible statistical models to explain the data. The ensemble method automatically selects a subset of most informative genes and builds a quantitatively better model for them. Genes which cluster together in the majority of models produce functionally more coherent modules. Regulators which are consistently assigned to a module are more often supported by literature, but a single model always contains many regulator assignments not supported by the ensemble. Reliably detecting condition-specific or combinatorial regulation is particularly hard in a single optimum but can be achieved using ensemble averaging.

Availability: All software developed for this study is available from http://bioinformatics.psb.ugent.be/software.

Contact: tom.michoel{at}psb.ugent.be

Supplementary information: Supplementary data and figures are available from http://bioinformatics.psb.ugent.be/supplementary_data/anjos/module_nets_yeast/.

Associate Editor: David Rocke


Received on October 2, 2008; revised on November 24, 2008; accepted on December 19, 2008

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Brief BioinformHome page
W.-P. Lee and W.-S. Tzou
Computational methods for discovering gene networks from expression data
Brief Bioinform, July 1, 2009; 10(4): 408 - 423.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.