Skip Navigation


Bioinformatics Advance Access originally published online on May 7, 2007
Bioinformatics 2007 23(13):1640-1647; doi:10.1093/bioinformatics/btm163
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
23/13/1640    most recent
btm163v1
Right arrow Alert me when this article is cited
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 ISI Web of Science
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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Soranzo, N.
Right arrow Articles by Altafini, C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Soranzo, N.
Right arrow Articles by Altafini, C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Comparing association network algorithms for reverse engineering of large-scale gene regulatory networks: synthetic versus real data

Nicola Soranzo 1, Ginestra Bianconi 2 and Claudio Altafini 1,*

1SISSA-ISAS, International School for Advanced Studies, via Beirut 2-4 and 2Abdus Salam International Center for Theoretical Physics, Strada Costiera 11, 34014 Trieste, Italy

*To whom correspondence should be addressed.


   Abstract

Motivation: Inferring a gene regulatory network exclusively from microarray expression profiles is a difficult but important task. The aim of this work is to compare the predictive power of some of the most popular algorithms in different conditions (like data taken at equilibrium or time courses) and on both synthetic and real microarray data. We are in particular interested in comparing similarity measures both of linear type (like correlations and partial correlations) and of non-linear type (mutual information and conditional mutual information), and in investigating the underdetermined case (less samples than genes).

Results: In our simulations we see that all network inference algorithms obtain better performances from data produced with ‘structural’ perturbations, like gene knockouts at steady state, than with any dynamical perturbation. The predictive power of all algorithms is confirmed on a reverse engineering problem from Escherichia coli gene profiling data: the edges of the ‘physical’ network of transcription factor–binding sites are significantly overrepresented among the highest weighting edges of the graph that we infer directly from the data without any structure supervision. Comparing synthetic and in vivo data on the same network graph allows us to give an indication of how much more complex a real transcriptional regulation program is with respect to an artificial model.

Availability: Software is freely available at the URL http://people.sissa.it/~altafini/papers/SoBiAl07/

Contact: altafini{at}sissa.it

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Limsoon Wong


Received on December 21, 2006; revised on March 23, 2007; accepted on April 23, 2007

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
BioinformaticsHome page
M. Zampieri, N. Soranzo, and C. Altafini
Discerning static and causal interactions in genome-wide reverse engineering problems
Bioinformatics, July 1, 2008; 24(13): 1510 - 1515.
[Abstract] [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.