• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用网络子图方法剖析分子网络结构。

Dissecting molecular network structures using a network subgraph approach.

作者信息

Huang Chien-Hung, Zaenudin Efendi, Tsai Jeffrey J P, Kurubanjerdjit Nilubon, Dessie Eskezeia Y, Ng Ka-Lok

机构信息

Department of Computer Science and Information Engineering, National Formosa University, Yunlin, Taiwan.

Department of Bioinformatics and Medical Engineering, Asia University, Taichung, Taiwan.

出版信息

PeerJ. 2020 Aug 6;8:e9556. doi: 10.7717/peerj.9556. eCollection 2020.

DOI:10.7717/peerj.9556
PMID:33005483
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7512139/
Abstract

Biological processes are based on molecular networks, which exhibit biological functions through interactions of genetic elements or proteins. This study presents a graph-based method to characterize molecular networks by decomposing the networks into directed multigraphs: network subgraphs. Spectral graph theory, reciprocity and complexity measures were used to quantify the network subgraphs. Graph energy, reciprocity and cyclomatic complexity can optimally specify network subgraphs with some degree of degeneracy. Seventy-one molecular networks were analyzed from three network types: cancer networks, signal transduction networks, and cellular processes. Molecular networks are built from a finite number of subgraph patterns and subgraphs with large graph energies are not present, which implies a graph energy cutoff. In addition, certain subgraph patterns are absent from the three network types. Thus, the Shannon entropy of the subgraph frequency distribution is not maximal. Furthermore, frequently-observed subgraphs are irreducible graphs. These novel findings warrant further investigation and may lead to important applications. Finally, we observed that cancer-related cellular processes are enriched with subgraph-associated driver genes. Our study provides a systematic approach for dissecting biological networks and supports the conclusion that there are organizational principles underlying molecular networks.

摘要

生物过程基于分子网络,这些分子网络通过遗传元件或蛋白质的相互作用展现生物功能。本研究提出了一种基于图的方法,通过将网络分解为有向多重图(即网络子图)来表征分子网络。使用谱图理论、互易性和复杂性度量来量化网络子图。图能量、互易性和圈秩复杂度能够以一定程度的简并性最优地指定网络子图。从癌症网络、信号转导网络和细胞过程这三种网络类型中分析了71个分子网络。分子网络由有限数量的子图模式构建而成,不存在具有大图能量的子图,这意味着存在图能量截止。此外,这三种网络类型中不存在某些子图模式。因此,子图频率分布的香农熵并非最大。此外,频繁观察到的子图是不可约图。这些新发现值得进一步研究,并可能带来重要应用。最后,我们观察到与癌症相关的细胞过程富含与子图相关的驱动基因。我们的研究为剖析生物网络提供了一种系统方法,并支持分子网络存在组织原则这一结论。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/bacd7ec9505f/peerj-08-9556-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/319d362405f4/peerj-08-9556-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/34a3fc6405a3/peerj-08-9556-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/15ff90b23616/peerj-08-9556-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/bacd7ec9505f/peerj-08-9556-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/319d362405f4/peerj-08-9556-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/34a3fc6405a3/peerj-08-9556-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/15ff90b23616/peerj-08-9556-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f108/7512139/bacd7ec9505f/peerj-08-9556-g004.jpg

相似文献

1
Dissecting molecular network structures using a network subgraph approach.使用网络子图方法剖析分子网络结构。
PeerJ. 2020 Aug 6;8:e9556. doi: 10.7717/peerj.9556. eCollection 2020.
2
Network subgraph-based approach for analyzing and comparing molecular networks.基于网络子图的分析和比较分子网络的方法。
PeerJ. 2022 May 3;10:e13137. doi: 10.7717/peerj.13137. eCollection 2022.
3
Grasping frequent subgraph mining for bioinformatics applications.用于生物信息学应用的频繁子图挖掘
BioData Min. 2018 Sep 3;11:20. doi: 10.1186/s13040-018-0181-9. eCollection 2018.
4
Robust subgraph counting with distribution-free random graph analysis.基于无分布随机图分析的稳健子图计数
Phys Rev E. 2021 Oct;104(4-1):044313. doi: 10.1103/PhysRevE.104.044313.
5
RASMA: a reverse search algorithm for mining maximal frequent subgraphs.RASMA:一种用于挖掘最大频繁子图的反向搜索算法。
BioData Min. 2021 Mar 16;14(1):19. doi: 10.1186/s13040-021-00250-1.
6
Subgraph-Aware Graph Kernel Neural Network for Link Prediction in Biological Networks.用于生物网络中链接预测的子图感知图核神经网络
IEEE J Biomed Health Inform. 2024 Jul;28(7):4373-4381. doi: 10.1109/JBHI.2024.3390092. Epub 2024 Jul 2.
7
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.基于索引的具有一般对称性的子图匹配算法(ISMAGS):利用对称性实现更快的子图枚举。
PLoS One. 2014 May 30;9(5):e97896. doi: 10.1371/journal.pone.0097896. eCollection 2014.
8
Subgraphs in random networks.随机网络中的子图
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Aug;68(2 Pt 2):026127. doi: 10.1103/PhysRevE.68.026127. Epub 2003 Aug 25.
9
Maximal prime subgraph decomposition of Bayesian networks.贝叶斯网络的最大素子图分解
IEEE Trans Syst Man Cybern B Cybern. 2002;32(1):21-31. doi: 10.1109/3477.979956.
10
Detection of Complexes in Biological Networks Through Diversified Dense Subgraph Mining.通过多样化密集子图挖掘检测生物网络中的复合物
J Comput Biol. 2017 Sep;24(9):923-941. doi: 10.1089/cmb.2017.0037. Epub 2017 Jun 1.

引用本文的文献

1
Bioinformatics: From NGS Data to Biological Complexity in Variant Detection and Oncological Clinical Practice.生物信息学:从二代测序数据到变异检测及肿瘤临床实践中的生物复杂性
Biomedicines. 2022 Aug 24;10(9):2074. doi: 10.3390/biomedicines10092074.
2
Network subgraph-based approach for analyzing and comparing molecular networks.基于网络子图的分析和比较分子网络的方法。
PeerJ. 2022 May 3;10:e13137. doi: 10.7717/peerj.13137. eCollection 2022.

本文引用的文献

1
Signaling Complexity Measured by Shannon Entropy and Its Application in Personalized Medicine.基于香农熵的信号复杂性及其在个性化医疗中的应用
Front Genet. 2019 Oct 21;10:930. doi: 10.3389/fgene.2019.00930. eCollection 2019.
2
Understanding the evolutionary trend of intrinsically structural disorders in cancer relevant proteins as probed by Shannon entropy scoring and structure network analysis.理解由香农熵评分和结构网络分析探测到的癌症相关蛋白质中固有结构障碍的进化趋势。
BMC Bioinformatics. 2019 Feb 4;19(Suppl 13):549. doi: 10.1186/s12859-018-2552-0.
3
Endolysosomal Ca Signalling and Cancer Hallmarks: Two-Pore Channels on the Move, TRPML1 Lags Behind!
内溶酶体钙信号与癌症标志:双孔通道在行动,TRPML1 滞后!
Cancers (Basel). 2018 Dec 27;11(1):27. doi: 10.3390/cancers11010027.
4
Genomic functions of developmental pluripotency associated factor 4 (Dppa4) in pluripotent stem cells and cancer.发育多能性相关因子4(Dppa4)在多能干细胞和癌症中的基因组功能
Stem Cell Res. 2018 Aug;31:83-94. doi: 10.1016/j.scr.2018.07.009. Epub 2018 Jul 19.
5
The Regulation of Tumor Cell Invasion and Metastasis by Endoplasmic Reticulum-to-Mitochondrial Ca Transfer.内质网到线粒体的钙转运对肿瘤细胞侵袭和转移的调控
Front Oncol. 2017 Aug 10;7:171. doi: 10.3389/fonc.2017.00171. eCollection 2017.
6
Signal transduction growth factors: the effective governance of transcription and cellular adhesion in cancer invasion.信号转导生长因子:癌症侵袭中转录和细胞黏附的有效调控
Oncotarget. 2017 May 30;8(22):36869-36884. doi: 10.18632/oncotarget.16300.
7
: 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.
8
Evaluating the evaluation of cancer driver genes.评估癌症驱动基因的评估。
Proc Natl Acad Sci U S A. 2016 Dec 13;113(50):14330-14335. doi: 10.1073/pnas.1616440113. Epub 2016 Nov 22.
9
Graphlet characteristics in directed networks.有向网络中的图元特征。
Sci Rep. 2016 Nov 10;6:37057. doi: 10.1038/srep37057.
10
Graphlet-based Characterization of Directed Networks.基于图元的有向网络特征描述
Sci Rep. 2016 Oct 13;6:35098. doi: 10.1038/srep35098.