Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks

被引:30
作者
Beber, Moritz Emanuel [2 ]
Fretter, Christoph [1 ]
Jain, Shubham [2 ]
Sonnenschein, Nikolaus [3 ]
Mueller-Hannemann, Matthias [1 ]
Huett, Marc-Thorsten [2 ]
机构
[1] Univ Halle Wittenberg, Inst Informat, Halle, Germany
[2] Jacobs Univ, Sch Sci & Engn, Bremen, Germany
[3] Univ Calif San Diego, Dept Bioengn, La Jolla, CA 92093 USA
关键词
FEEDFORWARD LOOP; REGULAR GRAPHS; ORGANIZATION; MODULARITY; TOPOLOGY; PATTERNS;
D O I
10.1098/rsif.2012.0490
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Few-node subgraphs are the smallest collective units in a network that can be investigated. They are beyond the scale of individual nodes but more local than, for example, communities. When statistically over-or under-represented, they are called network motifs. Network motifs have been interpreted as building blocks that shape the dynamic behaviour of networks. It is this promise of potentially explaining emergent properties of complex systems with relatively simple structures that led to an interest in network motifs in an ever-growing number of studies and across disciplines. Here, we discuss artefacts in the analysis of network motifs arising from discrepancies between the network under investigation and the pool of random graphs serving as a null model. Our aim was to provide a clear and accessible catalogue of such incongruities and their effect on the motif signature. As a case study, we explore the metabolic network of Escherichia coli and show that only by excluding ever more artefacts from the motif signature a strong and plausible correlation with the essentiality profile of metabolic reactions emerges.
引用
收藏
页码:3426 / 3435
页数:10
相关论文
共 67 条
[1]   Scale-free networks in cell biology [J].
Albert, R .
JOURNAL OF CELL SCIENCE, 2005, 118 (21) :4947-4957
[2]   Network motifs: theory and experimental approaches [J].
Alon, Uri .
NATURE REVIEWS GENETICS, 2007, 8 (06) :450-461
[3]  
Artzy-Randrup Yael, 2004, Science, V305, P1107
[4]   On the motif distribution in random block-hierarchical networks [J].
Avetisov, V. A. ;
Nechaev, S. K. ;
Shkarin, A. B. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2010, 389 (24) :5895-5902
[5]   Deterministic scale-free networks [J].
Barabási, AL ;
Ravasz, E ;
Vicsek, T .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2001, 299 (3-4) :559-564
[6]   Evolutionary significance of metabolic network properties [J].
Basler, Georg ;
Grimbs, Sergio ;
Ebenhoeh, Oliver ;
Selbig, Joachim ;
Nikoloski, Zoran .
JOURNAL OF THE ROYAL SOCIETY INTERFACE, 2012, 9 (71) :1168-1176
[7]   Mass-balanced randomization of metabolic networks [J].
Basler, Georg ;
Ebenhoeh, Oliver ;
Selbig, Joachim ;
Nikoloski, Zoran .
BIOINFORMATICS, 2011, 27 (10) :1397-1403
[8]   A subquadratic triad census algorithm for large sparse networks with small maximum degree [J].
Batagelj, V ;
Mrvar, A .
SOCIAL NETWORKS, 2001, 23 (03) :237-243
[9]   A Sequential Algorithm for Generating Random Graphs [J].
Bayati, Mohsen ;
Kim, Jeong Han ;
Saberi, Amin .
ALGORITHMICA, 2010, 58 (04) :860-910
[10]  
Berger A, 2010, LECT NOTES COMPUT SC, V6410, P220