Inferring domain-domain interactions using an extended parsimony model

Cheng Chen, Junfei Zhao, Qiang Huang, Rui-Sheng Wang, Xiang-Sun Zhang
{"title":"Inferring domain-domain interactions using an extended parsimony model","authors":"Cheng Chen, Junfei Zhao, Qiang Huang, Rui-Sheng Wang, Xiang-Sun Zhang","doi":"10.1109/ISB.2011.6033181","DOIUrl":null,"url":null,"abstract":"High-throughput technologies have produced a large number of protein-protein interactions (PPIs) for different species. As protein domains are functional and structural units of proteins, many computational efforts have been made to identify domain-domain interactions (DDIs) from PPIs. Parsimony assumption is widely used in computational biology as the evolution of the nature is considered as a continuous optimization process. In the context of identifying DDIs, parsimony methods try to find a minimal set of DDIs that can explain the observed PPIs. This category of methods are promising since they can be formulated and solved easily. Besides, researches have shown that they could detect specific DDIs, which is often hard for many probabilistic methods. In this paper, we revisit the parsimony model by presenting two important extensions. First, ‘complex networks’ as an emerging concept is incorporated as prior knowledge into the parsimony model. With this improvement, the prediction accuracy increases, which to some extent enhances the biological meaning of the common property of complex networks. Second, two randomization tests are designed to show the parsimony nature of the DDIs in mediating PPIs, which corroborates the model validation.","PeriodicalId":355056,"journal":{"name":"2011 IEEE International Conference on Systems Biology (ISB)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Systems Biology (ISB)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISB.2011.6033181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

High-throughput technologies have produced a large number of protein-protein interactions (PPIs) for different species. As protein domains are functional and structural units of proteins, many computational efforts have been made to identify domain-domain interactions (DDIs) from PPIs. Parsimony assumption is widely used in computational biology as the evolution of the nature is considered as a continuous optimization process. In the context of identifying DDIs, parsimony methods try to find a minimal set of DDIs that can explain the observed PPIs. This category of methods are promising since they can be formulated and solved easily. Besides, researches have shown that they could detect specific DDIs, which is often hard for many probabilistic methods. In this paper, we revisit the parsimony model by presenting two important extensions. First, ‘complex networks’ as an emerging concept is incorporated as prior knowledge into the parsimony model. With this improvement, the prediction accuracy increases, which to some extent enhances the biological meaning of the common property of complex networks. Second, two randomization tests are designed to show the parsimony nature of the DDIs in mediating PPIs, which corroborates the model validation.
使用扩展简约模型推断域与域之间的相互作用
高通量技术已经为不同的物种产生了大量的蛋白质-蛋白质相互作用(PPIs)。由于蛋白质结构域是蛋白质的功能和结构单元,许多计算工作已被用于从PPIs中识别域-域相互作用(ddi)。简约假设在计算生物学中被广泛应用,因为自然界的进化被认为是一个连续的优化过程。在确定ddi的背景下,简约方法试图找到一个最小的ddi集,可以解释观察到的ppi。这类方法很有前途,因为它们易于制定和求解。此外,研究表明,它们可以检测到特定的ddi,这是许多概率方法难以做到的。在本文中,我们通过提出两个重要的扩展来重新审视简约模型。首先,“复杂网络”作为一个新兴概念被作为先验知识纳入简约模型。这种改进提高了预测精度,在一定程度上增强了复杂网络共性的生物学意义。其次,设计了两个随机化测试来显示ddi在中介ppi中的简约性,这证实了模型验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信