• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

IncGraph:用于拓扑优化的增量图元计数。

IncGraph: Incremental graphlet counting for topology optimisation.

机构信息

Data Mining and Modelling for Biomedicine group, VIB Center for Inflammation Research, Ghent, Belgium.

Center for Medical Genetics, Ghent University Hospital, Ghent, Belgium.

出版信息

PLoS One. 2018 Apr 26;13(4):e0195997. doi: 10.1371/journal.pone.0195997. eCollection 2018.

DOI:10.1371/journal.pone.0195997
PMID:29698494
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5919487/
Abstract

MOTIVATION

Graphlets are small network patterns that can be counted in order to characterise the structure of a network (topology). As part of a topology optimisation process, one could use graphlet counts to iteratively modify a network and keep track of the graphlet counts, in order to achieve certain topological properties. Up until now, however, graphlets were not suited as a metric for performing topology optimisation; when millions of minor changes are made to the network structure it becomes computationally intractable to recalculate all the graphlet counts for each of the edge modifications.

RESULTS

IncGraph is a method for calculating the differences in graphlet counts with respect to the network in its previous state, which is much more efficient than calculating the graphlet occurrences from scratch at every edge modification made. In comparison to static counting approaches, our findings show IncGraph reduces the execution time by several orders of magnitude. The usefulness of this approach was demonstrated by developing a graphlet-based metric to optimise gene regulatory networks. IncGraph is able to quickly quantify the topological impact of small changes to a network, which opens novel research opportunities to study changes in topologies in evolving or online networks, or develop graphlet-based criteria for topology optimisation.

AVAILABILITY

IncGraph is freely available as an open-source R package on CRAN (incgraph). The development version is also available on GitHub (rcannood/incgraph).

摘要

动机

图元是可以计数的小网络模式,用于描述网络的结构(拓扑结构)。作为拓扑优化过程的一部分,可以使用图元计数来迭代地修改网络并跟踪图元计数,以实现某些拓扑属性。然而,到目前为止,图元不适合作为执行拓扑优化的指标;当对网络结构进行数百万次的微小更改时,重新计算每个边缘修改的所有图元计数在计算上变得难以处理。

结果

IncGraph 是一种计算相对于前一个状态的网络的图元计数差异的方法,与每次进行边缘修改时从头开始计算图元出现的情况相比,效率要高得多。与静态计数方法相比,我们的研究结果表明,IncGraph 将执行时间缩短了几个数量级。通过开发基于图元的指标来优化基因调控网络,证明了这种方法的有用性。IncGraph 能够快速量化网络小变化对拓扑结构的影响,这为研究进化或在线网络中拓扑结构的变化或开发基于图元的拓扑优化标准开辟了新的研究机会。

可用性

IncGraph 可在 CRAN(incgraph)上作为免费的开源 R 包使用。开发版本也可在 GitHub(rcannood/incgraph)上获得。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/7518a67d1f45/pone.0195997.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/7e700ed2b604/pone.0195997.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/1687491853a5/pone.0195997.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/59438356d282/pone.0195997.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/a89f8e2ad898/pone.0195997.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/e2c5163ec97b/pone.0195997.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/7518a67d1f45/pone.0195997.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/7e700ed2b604/pone.0195997.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/1687491853a5/pone.0195997.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/59438356d282/pone.0195997.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/a89f8e2ad898/pone.0195997.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/e2c5163ec97b/pone.0195997.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a031/5919487/7518a67d1f45/pone.0195997.g006.jpg

相似文献

1
IncGraph: Incremental graphlet counting for topology optimisation.IncGraph:用于拓扑优化的增量图元计数。
PLoS One. 2018 Apr 26;13(4):e0195997. doi: 10.1371/journal.pone.0195997. eCollection 2018.
2
Graphlet Laplacians for topology-function and topology-disease relationships.图元拉普拉斯在拓扑-功能和拓扑-疾病关系中的应用。
Bioinformatics. 2019 Dec 15;35(24):5226-5234. doi: 10.1093/bioinformatics/btz455.
3
: a graphlet based method for the comparison of local topology between gene regulatory networks.一种基于图元的基因调控网络局部拓扑比较方法。
PeerJ. 2017 Feb 28;5:e3052. doi: 10.7717/peerj.3052. eCollection 2017.
4
Comparison of tissue/disease specific integrated networks using directed graphlet signatures.使用有向图子签名比较组织/疾病特异性整合网络。
BMC Bioinformatics. 2017 Mar 22;18(Suppl 4):135. doi: 10.1186/s12859-017-1525-z.
5
BLANT-fast graphlet sampling tool.BLANT 快速图元采样工具。
Bioinformatics. 2019 Dec 15;35(24):5363-5364. doi: 10.1093/bioinformatics/btz603.
6
Exploiting graphlet decomposition to explain the structure of complex networks: the GHuST framework.利用图元分解来解释复杂网络的结构:GHuST框架。
Sci Rep. 2020 Jul 30;10(1):12884. doi: 10.1038/s41598-020-69795-1.
7
A combinatorial approach to graphlet counting.图元计数的组合方法。
Bioinformatics. 2014 Feb 15;30(4):559-65. doi: 10.1093/bioinformatics/btt717. Epub 2013 Dec 11.
8
Graphlet eigencentralities capture novel central roles of genes in pathways.图元特征向量中心度捕捉到基因在通路中扮演新的核心角色。
PLoS One. 2022 Jan 25;17(1):e0261676. doi: 10.1371/journal.pone.0261676. eCollection 2022.
9
Proper evaluation of alignment-free network comparison methods.无比对网络比较方法的恰当评估。
Bioinformatics. 2015 Aug 15;31(16):2697-704. doi: 10.1093/bioinformatics/btv170. Epub 2015 Mar 24.
10
Biological network comparison using graphlet degree distribution.使用图let度分布进行生物网络比较。
Bioinformatics. 2007 Jan 15;23(2):e177-83. doi: 10.1093/bioinformatics/btl301.

引用本文的文献

1
Generating random graphs with prescribed graphlet frequency bounds derived from probabilistic networks.生成具有从概率网络导出的规定图元频率界限的随机图。
PLoS One. 2025 Aug 26;20(8):e0328639. doi: 10.1371/journal.pone.0328639. eCollection 2025.
2
Optimising orbit counting of arbitrary order by equation selection.通过方程选择优化任意阶轨道计数。
BMC Bioinformatics. 2019 Jan 15;20(1):27. doi: 10.1186/s12859-018-2483-9.

本文引用的文献

1
Biophysically Motivated Regulatory Network Inference: Progress and Prospects.基于生物物理学的调控网络推断:进展与展望
Hum Hered. 2016;81(2):62-77. doi: 10.1159/000446614. Epub 2017 Jan 12.
2
Netter: re-ranking gene network inference predictions using structural network properties.内特尔:利用结构网络属性重新排列基因网络推理预测结果。
BMC Bioinformatics. 2016 Feb 9;17:76. doi: 10.1186/s12859-016-0913-0.
3
COLOMBOS v3.0: leveraging gene expression compendia for cross-species analyses.COLOMBOS v3.0:利用基因表达综合数据集进行跨物种分析。
Nucleic Acids Res. 2016 Jan 4;44(D1):D620-3. doi: 10.1093/nar/gkv1251. Epub 2015 Nov 19.
4
RegulonDB version 9.0: high-level integration of gene regulation, coexpression, motif clustering and beyond.RegulonDB 9.0版本:基因调控、共表达、基序聚类及其他方面的高级整合。
Nucleic Acids Res. 2016 Jan 4;44(D1):D133-43. doi: 10.1093/nar/gkv1156. Epub 2015 Nov 2.
5
Global Network Alignment in the Context of Aging.衰老背景下的全球网络比对
IEEE/ACM Trans Comput Biol Bioinform. 2015 Jan-Feb;12(1):40-52. doi: 10.1109/TCBB.2014.2326862.
6
Graphlet signature-based scoring method to estimate protein-ligand binding affinity.基于图元签名的评分方法来估计蛋白质-配体结合亲和力。
R Soc Open Sci. 2014 Dec 10;1(4):140306. doi: 10.1098/rsos.140306. eCollection 2014 Dec.
7
De-novo learning of genome-scale regulatory networks in S. cerevisiae.酿酒酵母中基因组规模调控网络的从头学习。
PLoS One. 2014 Sep 12;9(9):e106479. doi: 10.1371/journal.pone.0106479. eCollection 2014.
8
A combinatorial approach to graphlet counting.图元计数的组合方法。
Bioinformatics. 2014 Feb 15;30(4):559-65. doi: 10.1093/bioinformatics/btt717. Epub 2013 Dec 11.
9
Wisdom of crowds for robust gene network inference.群体智慧在稳健基因网络推断中的应用。
Nat Methods. 2012 Jul 15;9(8):796-804. doi: 10.1038/nmeth.2016.
10
A comprehensive assessment of methods for de-novo reverse-engineering of genome-scale regulatory networks.基于从头开始反向工程的基因组规模调控网络方法的综合评估。
Genomics. 2011 Jan;97(1):7-18. doi: 10.1016/j.ygeno.2010.10.003. Epub 2010 Oct 14.