支配蛋白质相互作用网络的约束模型

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Adel A. Alofairi, Emad Mabrouk, Ibrahim E. Elsemman
{"title":"支配蛋白质相互作用网络的约束模型","authors":"Adel A. Alofairi,&nbsp;Emad Mabrouk,&nbsp;Ibrahim E. Elsemman","doi":"10.1049/syb2.12021","DOIUrl":null,"url":null,"abstract":"<p>The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlation between structural analysis and biological functions. Although the PPI network contains many MDSets, the identification of multiple MDSets is an NP-complete problem, and it is difficult to determine the best MDSets, enriched with biological functions. Therefore, the MDSet model needs to be further expanded and validated to find constrained solutions that differ from those generated by the traditional models. Moreover, by identifying the critical set of the network, the set of nodes common to all MDSets can be time-consuming. Herein, the authors adopted the minimisation of metabolic adjustment (MOMA) algorithm to develop a new framework, called maximisation of interaction adjustment (MOIA). In MOIA, they provide three models; the first one generates two MDSets with a minimum number of shared proteins, the second model generates constrained multiple MDSets (<math>\n <mrow>\n <mi>k</mi>\n </mrow></math>-MDSets), and the third model generates user-defined MDSets, containing the maximum number of essential genes and/or other important genes of the PPI network. In practice, these models significantly reduce the cost of finding the critical set and classifying the graph nodes. Herein, the authors termed the critical set as the <math>\n <mrow>\n <mi>k</mi>\n </mrow></math>-critical set, where <math>\n <mrow>\n <mi>k</mi>\n </mrow></math> is the number of MDSets generated by the proposed model. Then, they defined a new set of proteins called the <math>\n <mrow>\n <mo>(</mo>\n <mi>k</mi>\n <mo>−</mo>\n <mn>1</mn>\n <mo>)</mo>\n </mrow></math>-critical set, where each node belongs to <math>\n <mrow>\n <mo>(</mo>\n <mi>k</mi>\n <mo>−</mo>\n <mn>1</mn>\n <mo>)</mo>\n </mrow></math> MDSets. This set has been shown to be as important as the <math>\n <mrow>\n <mi>k</mi>\n </mrow></math>-critical set and contains many essential genes, transcription factors, and protein kinases as the <math>\n <mrow>\n <mi>k</mi>\n </mrow></math>-critical set. The <math>\n <mrow>\n <mo>(</mo>\n <mi>k</mi>\n <mo>−</mo>\n <mn>1</mn>\n <mo>)</mo>\n </mrow></math>-critical set can be used to extend the search for drug target proteins. Based on the performance of the MOIA models, the authors believe the proposed methods contribute to answering key questions about the MDSets of PPI networks, and their results and analysis can be extended to other network types.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2021-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8675806/pdf/","citationCount":"1","resultStr":"{\"title\":\"Constraint-based models for dominating protein interaction networks\",\"authors\":\"Adel A. Alofairi,&nbsp;Emad Mabrouk,&nbsp;Ibrahim E. Elsemman\",\"doi\":\"10.1049/syb2.12021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlation between structural analysis and biological functions. Although the PPI network contains many MDSets, the identification of multiple MDSets is an NP-complete problem, and it is difficult to determine the best MDSets, enriched with biological functions. Therefore, the MDSet model needs to be further expanded and validated to find constrained solutions that differ from those generated by the traditional models. Moreover, by identifying the critical set of the network, the set of nodes common to all MDSets can be time-consuming. Herein, the authors adopted the minimisation of metabolic adjustment (MOMA) algorithm to develop a new framework, called maximisation of interaction adjustment (MOIA). In MOIA, they provide three models; the first one generates two MDSets with a minimum number of shared proteins, the second model generates constrained multiple MDSets (<math>\\n <mrow>\\n <mi>k</mi>\\n </mrow></math>-MDSets), and the third model generates user-defined MDSets, containing the maximum number of essential genes and/or other important genes of the PPI network. In practice, these models significantly reduce the cost of finding the critical set and classifying the graph nodes. Herein, the authors termed the critical set as the <math>\\n <mrow>\\n <mi>k</mi>\\n </mrow></math>-critical set, where <math>\\n <mrow>\\n <mi>k</mi>\\n </mrow></math> is the number of MDSets generated by the proposed model. Then, they defined a new set of proteins called the <math>\\n <mrow>\\n <mo>(</mo>\\n <mi>k</mi>\\n <mo>−</mo>\\n <mn>1</mn>\\n <mo>)</mo>\\n </mrow></math>-critical set, where each node belongs to <math>\\n <mrow>\\n <mo>(</mo>\\n <mi>k</mi>\\n <mo>−</mo>\\n <mn>1</mn>\\n <mo>)</mo>\\n </mrow></math> MDSets. This set has been shown to be as important as the <math>\\n <mrow>\\n <mi>k</mi>\\n </mrow></math>-critical set and contains many essential genes, transcription factors, and protein kinases as the <math>\\n <mrow>\\n <mi>k</mi>\\n </mrow></math>-critical set. The <math>\\n <mrow>\\n <mo>(</mo>\\n <mi>k</mi>\\n <mo>−</mo>\\n <mn>1</mn>\\n <mo>)</mo>\\n </mrow></math>-critical set can be used to extend the search for drug target proteins. Based on the performance of the MOIA models, the authors believe the proposed methods contribute to answering key questions about the MDSets of PPI networks, and their results and analysis can be extended to other network types.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2021-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8675806/pdf/\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/syb2.12021\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"99","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/syb2.12021","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1

摘要

最小支配集(MDSet)包含最小数量的图节点,其中其他图节点至少与一个MDSet节点连接。MDSet已成功应用于提取控制蛋白-蛋白相互作用(PPI)网络的蛋白质,并揭示结构分析与生物功能之间的相关性。虽然PPI网络包含许多mdset,但对多个mdset的识别是一个np完全问题,很难确定具有丰富生物学功能的最佳mdset。因此,需要进一步扩展和验证MDSet模型,以找到不同于传统模型生成的约束解决方案。此外,通过识别网络的关键集,所有mdset共用的节点集可能会很耗时。在此,作者采用代谢调节最小化(MOMA)算法开发了一个新的框架,称为交互调节最大化(MOIA)。在MOIA中,他们提供了三种模型;第一种模型生成两个具有最小共享蛋白数量的mdset,第二种模型生成约束的多个mdset (k - mdset),第三种模型生成用户自定义mdset,包含最大数量的PPI网络必需基因和/或其他重要基因。在实践中,这些模型显著降低了寻找关键集和对图节点进行分类的成本。在这里,作者将临界集称为k -临界集,其中k是由提出的模型生成的mdset的数量。然后,他们定义了一组新的蛋白质,称为(k−1)临界集,其中每个节点属于(k−1)个MDSets。这组已被证明是同样重要的k关键集,并包含许多必需的基因,转录因子和蛋白激酶的k关键集。(k−1)临界集可用于扩展对药物靶蛋白的搜索。基于MOIA模型的性能,作者认为所提出的方法有助于回答关于PPI网络mdset的关键问题,并且他们的结果和分析可以扩展到其他网络类型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Constraint-based models for dominating protein interaction networks

Constraint-based models for dominating protein interaction networks

The minimum dominating set (MDSet) comprises the smallest number of graph nodes, where other graph nodes are connected with at least one MDSet node. The MDSet has been successfully applied to extract proteins that control protein–protein interaction (PPI) networks and to reveal the correlation between structural analysis and biological functions. Although the PPI network contains many MDSets, the identification of multiple MDSets is an NP-complete problem, and it is difficult to determine the best MDSets, enriched with biological functions. Therefore, the MDSet model needs to be further expanded and validated to find constrained solutions that differ from those generated by the traditional models. Moreover, by identifying the critical set of the network, the set of nodes common to all MDSets can be time-consuming. Herein, the authors adopted the minimisation of metabolic adjustment (MOMA) algorithm to develop a new framework, called maximisation of interaction adjustment (MOIA). In MOIA, they provide three models; the first one generates two MDSets with a minimum number of shared proteins, the second model generates constrained multiple MDSets ( k -MDSets), and the third model generates user-defined MDSets, containing the maximum number of essential genes and/or other important genes of the PPI network. In practice, these models significantly reduce the cost of finding the critical set and classifying the graph nodes. Herein, the authors termed the critical set as the k -critical set, where k is the number of MDSets generated by the proposed model. Then, they defined a new set of proteins called the ( k 1 ) -critical set, where each node belongs to ( k 1 ) MDSets. This set has been shown to be as important as the k -critical set and contains many essential genes, transcription factors, and protein kinases as the k -critical set. The ( k 1 ) -critical set can be used to extend the search for drug target proteins. Based on the performance of the MOIA models, the authors believe the proposed methods contribute to answering key questions about the MDSets of PPI networks, and their results and analysis can be extended to other network types.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信