TU Darmstadt / ULB / TUbiblio

Network inference by combining biologically motivated regulatory constraints with penalized regression.

Parisi, F. and Koeppl, H. and Naef, F. (2009):
Network inference by combining biologically motivated regulatory constraints with penalized regression.
In: Annals of the New York Academy of Sciences, pp. 114-124, 1158, [Online-Edition: http://onlinelibrary.wiley.com/doi/10.1111/j.1749-6632.2008....],
[Article]

Abstract

Reconstructing biomolecular networks from time series mRNA or protein abundance measurements is a central challenge in computational systems biology. The regulatory processes behind cellular responses are coupled and nonlinear, leading to rich dynamical behavior. One class of reconstruction algorithms uses regression and penalized regression to impose sparseness on the solution, as requested biologically. Motivated by the five-gene challenge in the Dialogue for Reverse Engineering Assessments and Methods 2 (DREAM2) contest, we extend and test penalized regression schemes both on data from simulations and real qPCR measurements. The methods showing best performance are the Adaptive Ridge (AR) regression and a new extension thereof, in which we impose a biological constraint to the reconstructed network. Specifically, we request from the solutions that the outgoing links have the same regulatory sign, which is a reasonable approximation for most prokaryotic transcriptional networks. In other words, a given regulator must be either an activator or a repressor but not both. The constraints can be implemented with quadratic programming, and we show that this improves the reconstruction performance significantly. While linear models are not sufficiently general to encompass most complex behaviors, they offer powerful tools for network reconstruction, particularly for systems operating near a steady state. In particular, the optimization problems are well behaved and methodologies allow finding global optima efficiently. Adding constraints reflecting biological circuit designs is one of the most important aspects of network inference. We propose one such constraint, namely the consistency in the signs of outgoing links, which will facilitate the inference of transcriptional regulatory networks.

Item Type: Article
Erschienen: 2009
Creators: Parisi, F. and Koeppl, H. and Naef, F.
Title: Network inference by combining biologically motivated regulatory constraints with penalized regression.
Language: German
Abstract:

Reconstructing biomolecular networks from time series mRNA or protein abundance measurements is a central challenge in computational systems biology. The regulatory processes behind cellular responses are coupled and nonlinear, leading to rich dynamical behavior. One class of reconstruction algorithms uses regression and penalized regression to impose sparseness on the solution, as requested biologically. Motivated by the five-gene challenge in the Dialogue for Reverse Engineering Assessments and Methods 2 (DREAM2) contest, we extend and test penalized regression schemes both on data from simulations and real qPCR measurements. The methods showing best performance are the Adaptive Ridge (AR) regression and a new extension thereof, in which we impose a biological constraint to the reconstructed network. Specifically, we request from the solutions that the outgoing links have the same regulatory sign, which is a reasonable approximation for most prokaryotic transcriptional networks. In other words, a given regulator must be either an activator or a repressor but not both. The constraints can be implemented with quadratic programming, and we show that this improves the reconstruction performance significantly. While linear models are not sufficiently general to encompass most complex behaviors, they offer powerful tools for network reconstruction, particularly for systems operating near a steady state. In particular, the optimization problems are well behaved and methodologies allow finding global optima efficiently. Adding constraints reflecting biological circuit designs is one of the most important aspects of network inference. We propose one such constraint, namely the consistency in the signs of outgoing links, which will facilitate the inference of transcriptional regulatory networks.

Journal or Publication Title: Annals of the New York Academy of Sciences
Volume: 1158
Uncontrolled Keywords: Algorithms,Biological,Computational Biology,Computational Biology: methods,Computer Simulation,Gene Regulatory Networks,Models,Regression Analysis,Reproducibility of Results,Systems Biology
Divisions: 18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications > Bioinspired Communication Systems
18 Department of Electrical Engineering and Information Technology
18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications
Date Deposited: 04 Apr 2014 11:40
Official URL: http://onlinelibrary.wiley.com/doi/10.1111/j.1749-6632.2008....
Export:

Optionen (nur für Redakteure)

View Item View Item