酿酒酵母蛋白复合物的代表性DDI图平面性表征

William Gasper, Kathryn M. Cooper, Nathan Cornelius, H. Ali, S. Bhowmick
{"title":"酿酒酵母蛋白复合物的代表性DDI图平面性表征","authors":"William Gasper, Kathryn M. Cooper, Nathan Cornelius, H. Ali, S. Bhowmick","doi":"10.1145/3388440.3412465","DOIUrl":null,"url":null,"abstract":"With the increasing availability of various types of biological data and the ability to measure interrelationships among molecular elements, biological networks have quickly emerged as the go-to structure to model biological elements and relationships. However, there is not a large body of research that closely analyzes the properties of the various biological networks in ways that allow for the increased extraction of valuable information from these networks and establishes useful connections between network structures and corresponding biological properties. In particular, exploring the underlying graph properties of biological networks augments our understanding of biological organisms as complex systems. Understanding these properties is critical to the process of generating knowledge from biological network models. These properties become particularly interesting when they can be correlated with specific structural and functional qualities associated with the entities represented by the graph/network. Planarity may be especially important to understanding and identifying protein complexes, which are frequently subject to physical constraints that may prevent the constitutive protein components from interacting in such a way that the resulting graph abstraction is densely connected. In this work, we investigate the planarity of domain-domain interaction (DDI) graphs for S. cerevisiae protein complexes with validated three-dimensional structures. We found that the majority of these protein complexes were planar, even with the exclusion of complexes that had small DDI graphs with very few edges. We also found significant structural and functional differences between groups of complexes with planar and nonplanar DDI graphs. These results provide additional context for the study of protein complexes within the network model, and this additional context may be important for general knowledge generation, as well as for specific tasks like protein complex identification.","PeriodicalId":411338,"journal":{"name":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterization of S. cerevisiae Protein Complexes by Representative DDI Graph Planarity\",\"authors\":\"William Gasper, Kathryn M. Cooper, Nathan Cornelius, H. Ali, S. Bhowmick\",\"doi\":\"10.1145/3388440.3412465\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing availability of various types of biological data and the ability to measure interrelationships among molecular elements, biological networks have quickly emerged as the go-to structure to model biological elements and relationships. However, there is not a large body of research that closely analyzes the properties of the various biological networks in ways that allow for the increased extraction of valuable information from these networks and establishes useful connections between network structures and corresponding biological properties. In particular, exploring the underlying graph properties of biological networks augments our understanding of biological organisms as complex systems. Understanding these properties is critical to the process of generating knowledge from biological network models. These properties become particularly interesting when they can be correlated with specific structural and functional qualities associated with the entities represented by the graph/network. Planarity may be especially important to understanding and identifying protein complexes, which are frequently subject to physical constraints that may prevent the constitutive protein components from interacting in such a way that the resulting graph abstraction is densely connected. In this work, we investigate the planarity of domain-domain interaction (DDI) graphs for S. cerevisiae protein complexes with validated three-dimensional structures. We found that the majority of these protein complexes were planar, even with the exclusion of complexes that had small DDI graphs with very few edges. We also found significant structural and functional differences between groups of complexes with planar and nonplanar DDI graphs. These results provide additional context for the study of protein complexes within the network model, and this additional context may be important for general knowledge generation, as well as for specific tasks like protein complex identification.\",\"PeriodicalId\":411338,\"journal\":{\"name\":\"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3388440.3412465\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3388440.3412465","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着各种生物数据的不断增加和测量分子元素之间相互关系的能力,生物网络迅速成为建模生物元素和关系的首选结构。然而,并没有大量的研究仔细分析各种生物网络的特性,从而允许从这些网络中增加有价值的信息的提取,并在网络结构和相应的生物特性之间建立有用的联系。特别是,探索生物网络的潜在图属性增强了我们对生物有机体作为复杂系统的理解。理解这些属性对于从生物网络模型中生成知识的过程至关重要。当这些属性可以与图/网络所表示的实体相关的特定结构和功能特性相关联时,它们就变得特别有趣。平面性对于理解和识别蛋白质复合物尤其重要,因为蛋白质复合物经常受到物理限制,这些限制可能会阻止构成蛋白质成分以这种方式相互作用,从而导致图抽象紧密相连。在这项工作中,我们研究了酿酒酵母蛋白复合物具有验证的三维结构的域-域相互作用(DDI)图的平面性。我们发现大多数这些蛋白质复合物是平面的,即使排除了具有很少边的小DDI图的复合物。我们还发现平面和非平面DDI图复合物组在结构和功能上存在显著差异。这些结果为网络模型中蛋白质复合物的研究提供了额外的背景,这种额外的背景可能对一般知识的产生以及蛋白质复合物鉴定等特定任务很重要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Characterization of S. cerevisiae Protein Complexes by Representative DDI Graph Planarity
With the increasing availability of various types of biological data and the ability to measure interrelationships among molecular elements, biological networks have quickly emerged as the go-to structure to model biological elements and relationships. However, there is not a large body of research that closely analyzes the properties of the various biological networks in ways that allow for the increased extraction of valuable information from these networks and establishes useful connections between network structures and corresponding biological properties. In particular, exploring the underlying graph properties of biological networks augments our understanding of biological organisms as complex systems. Understanding these properties is critical to the process of generating knowledge from biological network models. These properties become particularly interesting when they can be correlated with specific structural and functional qualities associated with the entities represented by the graph/network. Planarity may be especially important to understanding and identifying protein complexes, which are frequently subject to physical constraints that may prevent the constitutive protein components from interacting in such a way that the resulting graph abstraction is densely connected. In this work, we investigate the planarity of domain-domain interaction (DDI) graphs for S. cerevisiae protein complexes with validated three-dimensional structures. We found that the majority of these protein complexes were planar, even with the exclusion of complexes that had small DDI graphs with very few edges. We also found significant structural and functional differences between groups of complexes with planar and nonplanar DDI graphs. These results provide additional context for the study of protein complexes within the network model, and this additional context may be important for general knowledge generation, as well as for specific tasks like protein complex identification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信