基于网络子图的方法:分子网络分析的无对齐技术

IF 2.4 3区 生物学 Q3 BIOCHEMICAL RESEARCH METHODS
Efendi Zaenudin, Ezra B. Wijaya, Venugopala Reddy Mekala, Ka-Lok Ng
{"title":"基于网络子图的方法:分子网络分析的无对齐技术","authors":"Efendi Zaenudin, Ezra B. Wijaya, Venugopala Reddy Mekala, Ka-Lok Ng","doi":"10.2174/0115748936285057240126062220","DOIUrl":null,"url":null,"abstract":"Objective: We propose a novel method to compare directed networks by decomposing the network into small modules, the so-called network subgraph approach, which is distinct from the network motif approach because it does not depend on null model assumptions. Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Results:: We identified and examined the biological meaning of 5-node regulatory modules and pairs of cancer networks with the smallest HJS values. The two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma and (ii) breast cancer and pathways in cancer. Some studies have provided experimental data supporting the 5-node regulatory modules. result: We identify and examine the biological meaning of 5-node regulatory modules and pairs of cancer networks which have the smallest HJS values. These two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma, and (ii) breast cancer and pathways in cancer. Some literature studies provide experimental data to support the 5-node regulatory modules. Conclusion: Our method is an alignment-free approach that measures the topological similarity of 5-node regulatory modules and aligns two directed networks based on their topology. These modules capture complex interactions among multiple genes that cannot be detected using existing methods that only consider single-gene relations. We analyzed the biological relevance of the regulatory modules and used the subgraph method to identify the modules that shared the same topology across 2 cancer networks out of 17 cancer networks. We validated our findings using evidence from the literature.","PeriodicalId":10801,"journal":{"name":"Current Bioinformatics","volume":"26 1","pages":""},"PeriodicalIF":2.4000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Network Subgraph-based Method: Alignment-free Technique for Molecular Network Analysis\",\"authors\":\"Efendi Zaenudin, Ezra B. Wijaya, Venugopala Reddy Mekala, Ka-Lok Ng\",\"doi\":\"10.2174/0115748936285057240126062220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Objective: We propose a novel method to compare directed networks by decomposing the network into small modules, the so-called network subgraph approach, which is distinct from the network motif approach because it does not depend on null model assumptions. Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Results:: We identified and examined the biological meaning of 5-node regulatory modules and pairs of cancer networks with the smallest HJS values. The two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma and (ii) breast cancer and pathways in cancer. Some studies have provided experimental data supporting the 5-node regulatory modules. result: We identify and examine the biological meaning of 5-node regulatory modules and pairs of cancer networks which have the smallest HJS values. These two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma, and (ii) breast cancer and pathways in cancer. Some literature studies provide experimental data to support the 5-node regulatory modules. Conclusion: Our method is an alignment-free approach that measures the topological similarity of 5-node regulatory modules and aligns two directed networks based on their topology. These modules capture complex interactions among multiple genes that cannot be detected using existing methods that only consider single-gene relations. We analyzed the biological relevance of the regulatory modules and used the subgraph method to identify the modules that shared the same topology across 2 cancer networks out of 17 cancer networks. We validated our findings using evidence from the literature.\",\"PeriodicalId\":10801,\"journal\":{\"name\":\"Current Bioinformatics\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Current Bioinformatics\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://doi.org/10.2174/0115748936285057240126062220\",\"RegionNum\":3,\"RegionCategory\":\"生物学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"BIOCHEMICAL RESEARCH METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Current Bioinformatics","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.2174/0115748936285057240126062220","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

摘要

目的:我们提出了一种通过将网络分解成小模块来比较有向网络的新方法,即所谓的网络子图方法,这种方法与网络图案方法不同,因为它不依赖于空模型假设。方法:我们开发了一种名为 "子图识别算法"(SIA)的无对齐算法,它可以生成所有具有五个连接节点的子图(5 节点子图)。共有 9364 个这样的模块。然后,我们应用 SIA 方法研究了 17 个癌症网络,并使用詹森-香农熵(HJS)测量了两个网络的相似度。方法:我们开发了一种名为 "子图识别算法(SIA)"的无对齐算法,该算法可以生成所有具有五个连接节点的子图(五节点子图)。共有 9364 个这样的模块。然后,我们应用 SIA 方法研究了 17 个癌症网络,并使用詹森-香农熵(HJS)测量了两个网络的相似度。结果我们确定并研究了 HJS 值最小的 5 节点调控模块和癌症网络对的生物学意义。表现出相似模式的两对网络是:(i) 子宫内膜癌和肝细胞癌;(ii) 乳腺癌和癌症中的通路。一些研究提供了支持 5 节点调控模块的实验数据:我们识别并研究了 5 节点调控模块和 HJS 值最小的癌症网络对的生物学意义。这两对显示出相似模式的网络是:(i) 子宫内膜癌和肝细胞癌;(ii) 乳腺癌和癌症路径。一些文献研究提供了支持 5 节点调控模块的实验数据。结论我们的方法是一种免配准方法,可测量 5 节点调控模块的拓扑相似性,并根据其拓扑结构配准两个有向网络。这些模块捕捉了多个基因之间复杂的相互作用,而现有的方法只考虑单基因关系,无法检测到这些相互作用。我们分析了调控模块的生物学相关性,并使用子图方法从 17 个癌症网络中找出了在 2 个癌症网络中拓扑结构相同的模块。我们利用文献中的证据验证了我们的发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Network Subgraph-based Method: Alignment-free Technique for Molecular Network Analysis
Objective: We propose a novel method to compare directed networks by decomposing the network into small modules, the so-called network subgraph approach, which is distinct from the network motif approach because it does not depend on null model assumptions. Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Method: We developed an alignment-free algorithm called the Subgraph Identification Algorithm (SIA), which could generate all subgraphs that have five connected nodes (5-node subgraph). There were 9,364 such modules. Then, we applied the SIA method to examine 17 cancer networks and measured the similarity between the two networks by gauging the similarity level using Jensen- Shannon entropy (HJS). Results:: We identified and examined the biological meaning of 5-node regulatory modules and pairs of cancer networks with the smallest HJS values. The two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma and (ii) breast cancer and pathways in cancer. Some studies have provided experimental data supporting the 5-node regulatory modules. result: We identify and examine the biological meaning of 5-node regulatory modules and pairs of cancer networks which have the smallest HJS values. These two pairs of networks that show similar patterns are (i) endometrial cancer and hepatocellular carcinoma, and (ii) breast cancer and pathways in cancer. Some literature studies provide experimental data to support the 5-node regulatory modules. Conclusion: Our method is an alignment-free approach that measures the topological similarity of 5-node regulatory modules and aligns two directed networks based on their topology. These modules capture complex interactions among multiple genes that cannot be detected using existing methods that only consider single-gene relations. We analyzed the biological relevance of the regulatory modules and used the subgraph method to identify the modules that shared the same topology across 2 cancer networks out of 17 cancer networks. We validated our findings using evidence from the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Current Bioinformatics
Current Bioinformatics 生物-生化研究方法
CiteScore
6.60
自引率
2.50%
发文量
77
审稿时长
>12 weeks
期刊介绍: Current Bioinformatics aims to publish all the latest and outstanding developments in bioinformatics. Each issue contains a series of timely, in-depth/mini-reviews, research papers and guest edited thematic issues written by leaders in the field, covering a wide range of the integration of biology with computer and information science. The journal focuses on advances in computational molecular/structural biology, encompassing areas such as computing in biomedicine and genomics, computational proteomics and systems biology, and metabolic pathway engineering. Developments in these fields have direct implications on key issues related to health care, medicine, genetic disorders, development of agricultural products, renewable energy, environmental protection, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信