Identification of stable genetic networks using convex programming

Gene regulatory networks capture interactions between genes and other cell substances, resulting in various models for the fundamental biological process of transcription and translation. The expression levels of the genes are typically measured in mRNA concentrations in micro-array experiments. In a so called genetic perturbation experiment, small perturbations are applied to equilibrium states and the resulting changes in expression activity are measured. This paper develops a novel algorithm that identifies a sparse stable genetic network that explains noisy genetic perturbation experiments obtained at equilibrium. Our identification algorithm can also incorporate a variety of possible prior knowledge of the network structure, which can be either qualitative, specifying positive, negative or no interactions between genes, or quantitative, specifying a range of interaction strength. Our method is based on a convex programming relaxation for handling the sparsity constraint, and therefore is applicable to the identification of genome-scale genetic networks.

[1]  E. Davidson,et al.  The hardwiring of development: organization and function of genomic regulatory systems. , 1997, Development.

[2]  Stephen P. Boyd,et al.  Low-Authority Controller Design by Means of Convex Optimization , 1999 .

[3]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[4]  Araceli M. Huerta,et al.  From specific gene regulation to genomic networks: a global analysis of transcriptional regulation in Escherichia coli. , 1998, BioEssays : news and reviews in molecular, cellular and developmental biology.

[5]  Stephen P. Boyd,et al.  Low-authority controller design via convex optimization , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[6]  D. di Bernardo,et al.  How to infer gene networks from expression profiles , 2007, Molecular systems biology.

[7]  Timothy S Gardner,et al.  Reverse-engineering transcription control networks. , 2005, Physics of life reviews.

[8]  Carsten O. Daub,et al.  The mutual information: Detecting and evaluating dependencies between variables , 2002, ECCB.

[9]  D. Botstein,et al.  Cluster analysis and display of genome-wide expression patterns. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[11]  Michal Linial,et al.  Using Bayesian Networks to Analyze Expression Data , 2000, J. Comput. Biol..

[12]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[13]  Diego di Bernardo,et al.  LMI-based Algorithm for the Reconstruction of Biological Networks , 2007, 2007 American Control Conference.

[14]  Eduardo D. Sontag,et al.  Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data , 2004, Bioinform..

[15]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[16]  Antonino Staiano,et al.  A multi-step approach to time series analysis and gene expression clustering , 2006, Bioinform..

[17]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[18]  J. Collins,et al.  Inferring Genetic Networks and Identifying Compound Mode of Action via Expression Profiling , 2003, Science.

[19]  A. Papachristodoulou,et al.  Determining Interconnections in Chemical Reaction Networks , 2007, 2007 American Control Conference.