利用布尔网络和基于max - sat的ATPG进行有效的癌症治疗

P. Lin, S. Khatri
{"title":"利用布尔网络和基于max - sat的ATPG进行有效的癌症治疗","authors":"P. Lin, S. Khatri","doi":"10.1109/GENSiPS.2011.6169450","DOIUrl":null,"url":null,"abstract":"Cancer and other gene related diseases are usually caused by a failure in the signaling pathway between genes and cells. These failures can occur in different areas of the gene regulatory network, but can be abstracted as faults in the regulatory function. For effective cancer treatment, it is imperative to identify faults and select appropriate drugs to treat the fault. In this paper, we present an extensible Max-SAT based automatic test pattern generation (ATPG) algorithm for cancer therapy. This ATPG algorithm is based on Boolean Satisfiability (SAT) and utilizes the stuck-at fault model for representing signalling faults. A weighted partial Max-SAT formulation is used to enable selection of the most effective drug. Several usage cases as presented for fault identification and drug selection. These include the identification of testable faults, optimal drug selection for single/multiple known faults, and optimal drug selection for overall fault coverage. Experimental results on growth factor (GF) signaling pathways demonstrate that our algorithm is flexible, and can yield an exact solution for each feature in much less than 1 second.","PeriodicalId":181666,"journal":{"name":"2011 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Efficient cancer therapy using Boolean networks and Max-SAT-based ATPG\",\"authors\":\"P. Lin, S. Khatri\",\"doi\":\"10.1109/GENSiPS.2011.6169450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cancer and other gene related diseases are usually caused by a failure in the signaling pathway between genes and cells. These failures can occur in different areas of the gene regulatory network, but can be abstracted as faults in the regulatory function. For effective cancer treatment, it is imperative to identify faults and select appropriate drugs to treat the fault. In this paper, we present an extensible Max-SAT based automatic test pattern generation (ATPG) algorithm for cancer therapy. This ATPG algorithm is based on Boolean Satisfiability (SAT) and utilizes the stuck-at fault model for representing signalling faults. A weighted partial Max-SAT formulation is used to enable selection of the most effective drug. Several usage cases as presented for fault identification and drug selection. These include the identification of testable faults, optimal drug selection for single/multiple known faults, and optimal drug selection for overall fault coverage. Experimental results on growth factor (GF) signaling pathways demonstrate that our algorithm is flexible, and can yield an exact solution for each feature in much less than 1 second.\",\"PeriodicalId\":181666,\"journal\":{\"name\":\"2011 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GENSiPS.2011.6169450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GENSiPS.2011.6169450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

癌症和其他基因相关疾病通常是由基因和细胞之间的信号通路失效引起的。这些故障可能发生在基因调控网络的不同区域,但可以抽象为调控功能的故障。为了有效地治疗癌症,必须识别故障并选择合适的药物来治疗故障。在本文中,我们提出了一种可扩展的基于Max-SAT的癌症治疗自动测试模式生成(ATPG)算法。该算法以布尔可满足性(SAT)为基础,利用故障卡滞模型来表示信令故障。加权部分Max-SAT配方用于选择最有效的药物。给出了故障识别和药物选择的几个用例。这些包括可测试故障的识别,单个/多个已知故障的最佳药物选择,以及总体故障覆盖的最佳药物选择。生长因子(GF)信号通路的实验结果表明,我们的算法是灵活的,可以在不到1秒的时间内对每个特征产生精确的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient cancer therapy using Boolean networks and Max-SAT-based ATPG
Cancer and other gene related diseases are usually caused by a failure in the signaling pathway between genes and cells. These failures can occur in different areas of the gene regulatory network, but can be abstracted as faults in the regulatory function. For effective cancer treatment, it is imperative to identify faults and select appropriate drugs to treat the fault. In this paper, we present an extensible Max-SAT based automatic test pattern generation (ATPG) algorithm for cancer therapy. This ATPG algorithm is based on Boolean Satisfiability (SAT) and utilizes the stuck-at fault model for representing signalling faults. A weighted partial Max-SAT formulation is used to enable selection of the most effective drug. Several usage cases as presented for fault identification and drug selection. These include the identification of testable faults, optimal drug selection for single/multiple known faults, and optimal drug selection for overall fault coverage. Experimental results on growth factor (GF) signaling pathways demonstrate that our algorithm is flexible, and can yield an exact solution for each feature in much less than 1 second.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信