Methods for Random Modularization of Biological Networks

Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global topology and organization one can learn nontrivial, systemic properties of organisms. In studies of biological network organization empirical networks are typically compared to random network models, and features are identified as important if they are statistically "unusual," i.e. occur surprisingly often or seldom. Naturally, more representative random models result in better feature identification. Since biological networks exhibit a modular structure (mostly pertaining to their hierarchical functional organization), random network models need be modular similarly. In this work we consider the problem of generating random network models that incorporate network modularity. Theoretically, the problem is equivalent to generating random decompositions of a graph into a given number of connected components. Here we describe two methods we have developed to do that and illustrate their utility on pertinent systems biology problems of feature scaling

[1]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[2]  A. Barabasi,et al.  Functional and topological characterization of protein interaction networks , 2004, Proteomics.

[3]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[4]  R. Jackson Genomic regulatory systems , 2001 .

[5]  Kim B. Clark,et al.  Design Rules: The Power of Modularity Volume 1 , 1999 .

[6]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[7]  Petter Holme,et al.  Subnetwork hierarchies of biochemical pathways , 2002, Bioinform..

[8]  J. Hopfield,et al.  From molecular to modular cell biology , 1999, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Igor Jurisica,et al.  Modeling interactome: scale-free or geometric? , 2004, Bioinform..

[11]  Susumu Goto,et al.  The KEGG databases at GenomeNet , 2002, Nucleic Acids Res..

[12]  Shunichi Toida,et al.  A decomposition of a graph into dense subgraphs , 1985 .

[13]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[14]  D. Lauffenburger Cell signaling pathways as control modules: complexity for simplicity? , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Lan V. Zhang,et al.  Evidence for dynamically organized modularity in the yeast protein–protein interaction network , 2004, Nature.

[16]  Michel Habib,et al.  Bimodular Decomposition of Bipartite Graphs , 2004, WG.