Overcoming drug resistance by co-targeting

M. Ayati, Golnaz Taheri, S. Arab, L. Wong, C. Eslahchi
{"title":"Overcoming drug resistance by co-targeting","authors":"M. Ayati, Golnaz Taheri, S. Arab, L. Wong, C. Eslahchi","doi":"10.1109/BIBM.2010.5706562","DOIUrl":null,"url":null,"abstract":"Removal or suppression of key proteins in an essential pathway of a pathogen is expected to disrupt the pathway and prohibit the pathogen from performing a vital function. Thus disconnecting multiple essential pathways should disrupt the survival of a pathogen even when it has multiple pathways to drug resistance. We consider a scenario where the drug-resistance pathways are unknown. To disrupt these pathways, we consider a cut set S of G, where G is a connected simple graph representing the protein interaction network of the pathogen, so that G-S splits to two partitions such that the endpoints of each pathway are in different partitions. If the difference between the sizes of the two partitions is high, the probability of existence of a functioning pathway in one partition is increased. Thus, we need to partition the graph into two balanced partitions. We approximate the balanced bipartitioning problem with spectral bipartitioning since finding (2,1)-separator is NP-complete. We test our technique on E. coli and C. jejuni. We show that over 50% of genes in the cut sets are essential. Moreover, all proteins in the cut sets have fundamental roles in cell and inhibition of each of them is harmful for cell survival. Also, 20% and 17% of known targets are in the vertex cut of E. coli and C. jejuni. Hence our approach has produced plausible “co-targets” whose inhibition should counter a pathogen's drug resistance.","PeriodicalId":275098,"journal":{"name":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM.2010.5706562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Removal or suppression of key proteins in an essential pathway of a pathogen is expected to disrupt the pathway and prohibit the pathogen from performing a vital function. Thus disconnecting multiple essential pathways should disrupt the survival of a pathogen even when it has multiple pathways to drug resistance. We consider a scenario where the drug-resistance pathways are unknown. To disrupt these pathways, we consider a cut set S of G, where G is a connected simple graph representing the protein interaction network of the pathogen, so that G-S splits to two partitions such that the endpoints of each pathway are in different partitions. If the difference between the sizes of the two partitions is high, the probability of existence of a functioning pathway in one partition is increased. Thus, we need to partition the graph into two balanced partitions. We approximate the balanced bipartitioning problem with spectral bipartitioning since finding (2,1)-separator is NP-complete. We test our technique on E. coli and C. jejuni. We show that over 50% of genes in the cut sets are essential. Moreover, all proteins in the cut sets have fundamental roles in cell and inhibition of each of them is harmful for cell survival. Also, 20% and 17% of known targets are in the vertex cut of E. coli and C. jejuni. Hence our approach has produced plausible “co-targets” whose inhibition should counter a pathogen's drug resistance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过共同靶向克服耐药性
去除或抑制病原体基本途径中的关键蛋白质有望破坏该途径并禁止病原体执行重要功能。因此,切断多种基本途径应该会破坏病原体的生存,即使它有多种产生耐药性的途径。我们考虑一种耐药性途径未知的情况。为了破坏这些通路,我们考虑G的切集S,其中G是表示病原体蛋白质相互作用网络的连通简单图,因此G-S分裂为两个分区,使得每个通路的端点位于不同的分区。如果两个分区之间的大小差异很大,则在一个分区中存在有效路径的概率会增加。因此,我们需要将图划分为两个平衡的分区。由于找到(2,1)-分离器是np完全的,我们用谱双分区近似平衡双分区问题。我们在大肠杆菌和空肠杆菌上测试了我们的技术。我们发现,切割集中超过50%的基因是必需的。此外,切割集中的所有蛋白质在细胞中都具有基础作用,对它们中的任何一种的抑制都对细胞存活有害。此外,20%和17%的已知靶点位于大肠杆菌和空肠杆菌的顶点切口。因此,我们的方法产生了似是而非的“共同靶点”,其抑制作用应该能够对抗病原体的耐药性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A gene ranking method using text-mining for the identification of disease related genes alns — A searchable and filterable sequence alignment format A fast and noise-adaptive rough-fuzzy hybrid algorithm for medical image segmentation An accurate, automatic method for markerless alignment of electron tomographic images Unsupervised integration of multiple protein disorder predictors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1