| 翻訳と辞書 |
Graphlets
Graphlets are small connected non-isomorphic ''induced'' subgraphs of a large network.〔Pržulj N, Corneil DG, Jurisica I: Modeling Interactome, Scale-Free or Geometric?, Bioinformatics 2004, 20(18):3508-3515.〕〔Pržulj N, Biological Network Comparison Using Graphlet Degree Distribution, Bioinformatics 2007, 23:e177-e183.〕 Graphlets differ from network motifs, since they must be ''induced'' subgraphs, whereas motifs are ''partial'' subgraphs. An induced subgraph must contain all edges between its nodes that are present in the large network, while a partial subgraph may contain only some of these edges. Moreover, graphlets do not need to be over-represented in the data when compared with randomized networks, while motifs do.〔R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network motifs, simple building blocks of complex networks, ''Science'' 2002, 298(5594): p. 824-7.〕
Graphlets were first introduced by Nataša Pržulj, when they were used as a basis for designing two new highly sensitive measures of network local structural similarities: the relative graphlet frequency distance (RGF-distance)〔 and the graphlet degree distribution agreement (GDD-agreement).〔 Additionally, Pržulj group developed a novel measure of network topological similarity that generalizes the degree of a node in the network to its graphlet degree vector (GDV) or graphlet degree signature.〔Tijana Milenković and Nataša Pržulj, Uncovering Biological Network Function via Graphlet Degree Signatures, Cancer Informatics 2008, 6:257–273.〕
==Graphlet-based network properties==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Graphlets」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|