Inferring Gene Networks: Dream or Nightmare?
Part 2: Challenges 4 and 5
We describe several algorithms with winning performance in the Dialogue for Reverse Engineering Assessments and Methods (DREAM2) Reverse Engineering Competition 2007. After the gold standards for the challenges were released, the performance of the algorithms could be thoroughly evaluated under different parameters or alternative ways of solving systems of equations. For the analysis of Challenge 4, the “In-silico” challenges, we employed methods to explicitly deal with perturbation data and time-series data. We show that original methods used to produce winning submissions could easily be altered to substantially improve performance. For Challenge 5, the genome-scale Escherichia coli network, we evaluated a variety of measures of association. These data are troublesome, and no good solutions could be produced, either by us or by any other teams. Our best results were obtained when analyzing subdatasets instead of considering the dataset as a whole.
. 2003. Artificial gene networks for objective comparison of analysis algorithms.
19(Suppl 2): ii122–ii129.
2006. Deciphering Living Networks: Perturbation Strategies for Functional Genomics. Deciphering Living Networks. Free University of Amsterdam.
. 2004. Regulatory strength analysis for inferring gene networks. In
Metabolic Engineering in the Post Genomic Era. B.N. Kholodenko &
H.V. Westerhoff, Eds.: 107–137. Horizon Bioscience.
2001. Modeling large scale biological systems from functional genomic data: parameter estimation. In
Foundations of Systems Biology. H. Kitano, Ed.: 163–186. MIT Press.
. 2003. Inferring genetic networks and identifying compound mode of action via expression profiling.
. 2001. A quantitative method for reverse engineering gene networks from microarray experiments using regulatory strengths.
2nd Int. Conf. Syst. Biol.
. 2002. Linking the genes: inferring quantitative gene networks from microarray data.
. 2006. Unravelling gene networks from noisy under-determined experimental perturbation data.
Syst. Biol. (Stevenage)
1996. Equivalence of regularization and truncated iteration for general ill-posed problems.
Linear Algebra and Its Applications
1989. Linear inverse and ill-posed problems, in
Advances in Electronics and Electron Physics, editor
P.W. Hawkes, vol. 75, 1–120. Academic Press,
. 1995. Regularization methods in image restoration: an application to HST images.
Int. J. Imaging Syst. Technol.
. 1993. Causation, Prediction, and Search. MIT Press,
2008. What are gene regulatory networks?
Computational Methods for Gene Regulatory Networks. S. Das,
W.H. Hsu &
S.M. Welch, Eds. IGI Global.
. 2002. Quantifying gene networks with regulatory strengths.
Mol. Biol. Rep.
. 2007. Large-scale mapping and validation of Escherichia coli transcriptional regulation from a compendium of expression profiles.
. 2008. Many microbe microarrays database: uniformly normalized affymetrix compendia with structured experimental metadata.
Nucleic Acids Res.
. 2003. Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data.
. 2001. Beyond synexpression relationships: local clustering of time-shifted and inverted gene expression profiles identifies new, biologically relevant interactions.
J. Mol. Biol.
. 2003. Reconciling gene expression data with known genome-scale regulatory network structures.
. 2002. The mutual information: detecting and evaluating dependencies between variables.
18(Suppl 2): S231–S240.
. 2004. Estimating mutual information using B-spline functions–an improved similarity measure for analysing gene expression data.
. 2000. CLICK: a clustering algorithm with applications to gene expression analysis.
Proc. Int. Conf. Intell. Syst. Mol. Biol.
. 2005. EXPANDER–an integrative program suite for microarray data analysis.