On the origin of distribution patterns of motifs in biological networks

BackgroundInventories of small subgraphs in biological networks have identified commonly-recurring patterns, called motifs. The inference that these motifs have been selected for function rests on the idea that their occurrences are significantly more frequent than random.ResultsOur analysis of several large biological networks suggests, in contrast, that the frequencies of appearance of common subgraphs are similar in natural and corresponding random networks.ConclusionIndeed, certain topological features of biological networks give rise naturally to the common appearance of the motifs. We therefore question whether frequencies of occurrences are reasonable evidence that the structures of motifs have been selected for their functional contribution to the operation of networks.

[1]  S. Mangan,et al.  Article number: 2005.0006 , 2022 .

[2]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

[3]  U Alon,et al.  The incoherent feed-forward loop accelerates the response-time of the gal system of Escherichia coli. , 2006, Journal of molecular biology.

[4]  J. Spencer Ramsey Theory , 1990 .

[5]  U. Alon,et al.  Just-in-time transcription program in metabolic pathways , 2004, Nature Genetics.

[6]  Sebastian M. Cioabùa The NP-completeness of some edge-partitioning problems , 2005 .

[7]  Uri Alon,et al.  Topological generalizations of network motifs. Phys Rev E 70:031909 , 2004 .

[8]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[9]  S. Mangan,et al.  Structure and function of the feed-forward loop network motif , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[10]  S. Mangan,et al.  The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks. , 2003, Journal of molecular biology.

[11]  Arun S Konagurthu,et al.  Single and multiple input modules in regulatory networks , 2008, Proteins.

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

[13]  Nicola J. Rinaldi,et al.  Transcriptional Regulatory Networks in Saccharomyces cerevisiae , 2002, Science.

[14]  R. Milo,et al.  Topological generalizations of network motifs. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Prahlad T. Ram,et al.  Formation of Regulatory Patterns During Signal Propagation in a Mammalian Cellular Network , 2005, Science.

[16]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[17]  M. Gerstein,et al.  Genomic analysis of regulatory network dynamics reveals large topological changes , 2004, Nature.

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

[19]  Ian Holyer,et al.  The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..

[20]  Alexander Schrijver,et al.  Discrete mathematics and optimization , 2004 .

[21]  J. Spencer Probabilistic Methods in Combinatorics , 1974 .

[22]  T. Ideker,et al.  Modeling cellular machinery through biological network comparison , 2006, Nature Biotechnology.

[23]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[24]  Uri Alon,et al.  An Introduction to Systems Biology , 2006 .