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

被引:29
|
作者
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
相关论文
共 34 条
  • [1] A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
    Zhao, Xiuming
    Yu, Hongtao
    Liu, Shuxin
    Cao, Xiaochun
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 614
  • [2] Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution
    Ott, S
    Hansen, A
    Kim, SY
    Miyano, S
    [J]. BIOINFORMATICS, 2005, 21 (02) : 227 - 238
  • [3] FluxExplorer: A general platform for modeling and analyses of metabolic networks based on stoichiometry
    Luo Ruoyu
    Liao Sha
    Zeng Shaoqun
    Li Yixue
    Luo Qingming
    [J]. CHINESE SCIENCE BULLETIN, 2006, 51 (06): : 689 - 696
  • [4] Application of dynamic expansion tree for finding large network motifs in biological networks
    Patra, Sabyasachi
    Mohapatra, Anjali
    [J]. PEERJ, 2019, 7
  • [5] A Dynamical Network Framework with Application to Stability of Power Networks
    Wang, Dan
    Chen, Wei
    Khong, Sei Zhen
    Liu, Ji
    Basar, Tamer
    Qiu, Li
    [J]. 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [6] A review of statistical models for clustering networks with an application to a PPI network
    Daudin, Jean-Jacques
    [J]. JOURNAL OF THE SFDS, 2011, 152 (02): : 111 - 125
  • [7] A General Framework: Combining Statistical Models and Network Structure for Deep Content Mining
    Zhao, Chengli
    Zhang, Xue
    Yi, Dongyun
    [J]. PROCEEDINGS OF THE 8TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, 2009, : 337 - 341
  • [8] A complex network framework for unbiased statistical analyses of DNA-DNA contact maps
    Kruse, Kai
    Sewitz, Sven
    Babu, M. Madan
    [J]. NUCLEIC ACIDS RESEARCH, 2013, 41 (02) : 701 - 710
  • [9] Robust Network Design for Roadway Networks: Unifying Framework and Application
    Koulakezian, Agop
    Abdelgawad, Hossam
    Tizghadam, Ali
    Abdulhai, Baher
    Leon-Garcia, Alberto
    [J]. IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE, 2015, 7 (02) : 34 - 46
  • [10] A statistical framework for evaluating convolutional neural networks. Application to colon cancer
    Popa, Liliana
    [J]. ANNALS OF THE UNIVERSITY OF CRAIOVA-MATHEMATICS AND COMPUTER SCIENCE SERIES, 2021, 48 (01): : 159 - 166