Reverse Engineering of Molecular Networks from a Common Combinatorial Approach

The understanding of molecular cell biology requires insight into the structure and dynamics of networks that are made up of thousands of interacting molecules of DNA, RNA, proteins, metabolites, and other components. One of the central goals of systems biology is the unraveling of the as yet poorly characterized complex web of interactions among these components. This work is made harder by the fact that new species and interactions are continuously discovered in experimental work, necessitating the development of adaptive and fast algorithms for network construction and updating. Thus, the "reverse-engineering" of networks from data has emerged as one of the central concern of systems biology research. A variety of reverse-engineering methods have been developed, based on tools from statistics, machine learning, and other mathematical domains. In order to effectively use these methods, it is essential to develop an understanding of the fundamental characteristics of these algorithms. With that in mind, this chapter is dedicated to the reverse-engineering of biological systems. Specifically, we focus our attention on a particular class of methods for reverse-engineering, namely those that rely algorithmically upon the so-called "hitting-set" problem, which is a classical combinatorial and computer science problem, Each of these methods utilizes a different algorithm in order to obtain an exact or an approximate solution of the hitting set problem. We will explore the ultimate impact that the alternative algorithms have on the inference of published in silico biological networks.

[1]  Kwang-Hyun Cho,et al.  Least-squares methods for identifying biochemical regulatory networks from noisy measurements , 2007, BMC Bioinformatics.

[2]  B. Krupa,et al.  On the number of experiments required to find the causal structure of complex systems. , 2002, Journal of theoretical biology.

[3]  Bartek Wilczynski,et al.  Applying dynamic Bayesian networks to perturbed gene expression data , 2006, BMC Bioinformatics.

[4]  E. Robinson.  Cybernetics, or Control and Communication in the Animal and the Machine , 1963 .

[5]  G Tononi,et al.  Measures of degeneracy and redundancy in biological networks. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Piotr Berman,et al.  Algorithmic Issues in Reverse Engineering of Protein and Gene Networks via the Modular Response Analysis Method , 2007, Annals of the New York Academy of Sciences.

[7]  Abdul Salam Jarrah,et al.  Parameter estimation for Boolean models of biological networks , 2009, Theor. Comput. Sci..

[8]  George Karypis,et al.  A Boolean algorithm for reconstructing the structure of regulatory networks. , 2004, Metabolic engineering.

[9]  R. Laubenbacher,et al.  A computational algebra approach to the reverse engineering of gene regulatory networks. , 2003, Journal of theoretical biology.

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

[11]  Abdul Salam Jarrah,et al.  Reverse-engineering of polynomial dynamical systems , 2007, Adv. Appl. Math..

[12]  Zoubin Ghahramani,et al.  A Bayesian approach to reconstructing genetic regulatory networks with hidden factors , 2005, Bioinform..

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

[14]  Ludwig von Bertalanffy,et al.  General System Theory , 1969 .

[15]  Sean Ekins,et al.  Drug efficacy, safety, and biologics discovery : emerging technologies and tools , 2009 .

[16]  Scott T. Weiss,et al.  A graphical model approach for inferring large-scale networks integrating gene expression and genetic polymorphism , 2009, BMC Systems Biology.

[17]  Gustavo Stolovitzky,et al.  Reconstructing biological networks using conditional correlation analysis , 2005, Bioinform..

[18]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[19]  S Fuhrman,et al.  Reveal, a general reverse engineering algorithm for inference of genetic network architectures. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[20]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[21]  Alberto de la Fuente,et al.  Discovery of meaningful associations in genomic data using partial correlation coefficients , 2004, Bioinform..

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

[23]  Lotfi A. Zadeh,et al.  General System Theory , 1962 .

[24]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[25]  G. Zajicek,et al.  The Wisdom of the Body , 1934, Nature.

[26]  Lorenz Wernisch,et al.  Reconstruction of gene networks using Bayesian learning and manipulation experiments , 2004, Bioinform..

[27]  Eduardo D Sontag,et al.  Network reconstruction based on steady-state data. , 2008, Essays in biochemistry.

[28]  Piotr Berman,et al.  Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks , 2004, Discret. Appl. Math..

[29]  H. Othmer,et al.  The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. , 2003, Journal of theoretical biology.

[30]  Eduardo Sontag,et al.  Inference of signaling and gene regulatory networks by steady-state perturbation experiments: structure and accuracy. , 2005, Journal of theoretical biology.

[31]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[32]  Jean-Loup Faulon,et al.  Boolean dynamics of genetic regulatory networks inferred from microarray time series data , 2007, Bioinform..

[33]  Satoru Miyano,et al.  Estimating gene regulatory networks and protein-protein interactions of Saccharomyces cerevisiae from multiple genome-wide data , 2005, ECCB/JBI.

[34]  Paul P. Wang,et al.  Advances to Bayesian network inference for generating causal networks from observational biological data , 2004, Bioinform..

[35]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[36]  P Mendes,et al.  Biochemistry by numbers: simulation of biochemical pathways with Gepasi 3. , 1997, Trends in biochemical sciences.

[37]  Min Zou,et al.  A new dynamic Bayesian network (DBN) approach for identifying gene regulatory networks from time course microarray data , 2005, Bioinform..

[38]  John E. Hopcroft,et al.  Complexity of Computer Computations , 1974, IFIP Congress.

[39]  Satoru Miyano,et al.  Inferring qualitative relations in genetic networks and metabolic pathways , 2000, Bioinform..

[40]  Mudita Singhal,et al.  COPASI - a COmplex PAthway SImulator , 2006, Bioinform..

[41]  V. Thorsson,et al.  Discovery of regulatory interactions through perturbation: inference and experimental design. , 1999, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[42]  Reinhard Laubenbacher,et al.  Comparison of Reverse‐Engineering Methods Using an in Silico Network , 2007, Annals of the New York Academy of Sciences.

[43]  Claudio Altafini,et al.  Comparing association network algorithms for reverse engineering of large-scale gene regulatory networks: synthetic versus real data , 2007, Bioinform..