• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

酵母蛋白质组网络的复杂性分析

Complexity analysis of yeast proteome network.

作者信息

Bonchev Danail

机构信息

Center for the Study of Biological Complexity, Virginia Commonwealth University, Richmond, VA 23284-2030, USA.

出版信息

Chem Biodivers. 2004 Feb;1(2):312-26. doi: 10.1002/cbdv.200490028.

DOI:10.1002/cbdv.200490028
PMID:17191850
Abstract

Topological and compositional complexity of protein-protein networks is assessed in a variety of ways making use of graph theory and information theory. The methodology used is borrowed from mathematical chemistry and includes complexity descriptors such as substructure count, overall connectivity, walk count, and information on various vertex distributions. The approach is applied to the (incomplete) proteome of Saccharomyces cerevisiae containing 232 protein complexes of a total of 1,440 proteins. The proteome network and each of its nine functional subsets of protein complexes are disconnected graphs, containing a number of noninteracting species and a major component. A weighted edge between two vertices in these graphs stands for the number of shared proteins between the respective complexes. The major component is a highly connected, 'small-world' network, in which the average vertex distance between protein complexes does not exceed 2.2 (2.4 for the entire proteome), whereas the maximum distance does not exceed 4 (or 5 for the proteome). The vertex degree distribution in the major proteome component with 199 complexes follows the power law P(k) approximately k(-gamma), with gamma approximately = 1.7. The analysis of the functional organization of the yeast proteome has shown that, for any pair of biological functions, there always exist many proteins that can perform both functions. The potential application of the quantitative proteome descriptors discussed includes quantitative relationships between the structure and biological action of dynamic protein complexes in changing environment, identification of targets for markers/drugs, as well as system analysis and comparative studies of proteomes.

摘要

利用图论和信息论,人们通过多种方式评估蛋白质 - 蛋白质网络的拓扑和组成复杂性。所使用的方法借鉴自数学化学,包括子结构计数、整体连通性、游走计数以及各种顶点分布信息等复杂性描述符。该方法应用于酿酒酵母(Saccharomyces cerevisiae)的(不完整)蛋白质组,该蛋白质组包含总共1440个蛋白质的232个蛋白质复合物。蛋白质组网络及其九个蛋白质复合物功能子集均为非连通图,包含许多非相互作用的物种和一个主要成分。这些图中两个顶点之间的加权边代表相应复合物之间共享蛋白质的数量。主要成分是一个高度连通的“小世界”网络,其中蛋白质复合物之间的平均顶点距离不超过2.2(整个蛋白质组为2.4),而最大距离不超过4(蛋白质组为5)。包含199个复合物的主要蛋白质组成分中的顶点度分布遵循幂律P(k) 近似为k^(-γ),γ约为1.7。对酵母蛋白质组功能组织的分析表明,对于任意一对生物学功能,总是存在许多能够执行这两种功能的蛋白质。所讨论的定量蛋白质组描述符的潜在应用包括动态蛋白质复合物在变化环境中的结构与生物学作用之间的定量关系、标记物/药物靶点的识别以及蛋白质组的系统分析和比较研究。

相似文献

1
Complexity analysis of yeast proteome network.酵母蛋白质组网络的复杂性分析
Chem Biodivers. 2004 Feb;1(2):312-26. doi: 10.1002/cbdv.200490028.
2
The coming age of complete, accurate, and ubiquitous proteomes.全面、准确、无处不在的蛋白质组学时代即将到来。
Mol Cell. 2013 Feb 21;49(4):583-90. doi: 10.1016/j.molcel.2013.01.029.
3
Finding the "dark matter" in human and yeast protein network prediction and modelling.在人类和酵母蛋白质网络预测和建模中寻找“暗物质”。
PLoS Comput Biol. 2010 Sep 23;6(9):e1000945. doi: 10.1371/journal.pcbi.1000945.
4
Characterization of global yeast quantitative proteome data generated from the wild-type and glucose repression saccharomyces cerevisiae strains: the comparison of two quantitative methods.对野生型和葡萄糖抑制型酿酒酵母菌株产生的全球酵母定量蛋白质组数据的表征:两种定量方法的比较。
J Proteome Res. 2008 Jan;7(1):266-75. doi: 10.1021/pr700580m.
5
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures.基于新拓扑结构修改用于识别蛋白质复合物的DPClus算法。
BMC Bioinformatics. 2008 Sep 25;9:398. doi: 10.1186/1471-2105-9-398.
6
Protein interaction networks by proteome peptide scanning.通过蛋白质组肽扫描构建的蛋白质相互作用网络
PLoS Biol. 2004 Jan;2(1):E14. doi: 10.1371/journal.pbio.0020014. Epub 2004 Jan 20.
7
AVID: an integrative framework for discovering functional relationships among proteins.AVID:一个用于发现蛋白质间功能关系的综合框架。
BMC Bioinformatics. 2005 Jun 1;6:136. doi: 10.1186/1471-2105-6-136.
8
Fitting a geometric graph to a protein-protein interaction network.将几何图拟合到蛋白质-蛋白质相互作用网络。
Bioinformatics. 2008 Apr 15;24(8):1093-9. doi: 10.1093/bioinformatics/btn079. Epub 2008 Mar 14.
9
Detecting functional modules in the yeast protein-protein interaction network.在酵母蛋白质-蛋白质相互作用网络中检测功能模块。
Bioinformatics. 2006 Sep 15;22(18):2283-90. doi: 10.1093/bioinformatics/btl370. Epub 2006 Jul 12.
10
Identification of core-attachment complexes based on maximal frequent patterns in protein-protein interaction networks.基于蛋白质相互作用网络中的最大频繁模式识别核心附着复合物。
Proteomics. 2011 Oct;11(19):3826-34. doi: 10.1002/pmic.201100194. Epub 2011 Aug 23.

引用本文的文献

1
Study of peptide fingerprints of parasite proteins and drug-DNA interactions with Markov-Mean-Energy invariants of biopolymer molecular-dynamic lattice networks.利用生物聚合物分子动力学晶格网络的马尔可夫平均能量不变量研究寄生虫蛋白质的肽指纹图谱及药物与DNA的相互作用。
Polymer (Guildf). 2009 Jul 17;50(15):3857-3870. doi: 10.1016/j.polymer.2009.05.055. Epub 2009 Jun 3.
2
Systems biology perspectives on minimal and simpler cells.关于最小化细胞和简化细胞的系统生物学观点。
Microbiol Mol Biol Rev. 2014 Sep;78(3):487-509. doi: 10.1128/MMBR.00050-13.
3
Scoring function for DNA-drug docking of anticancer and antiparasitic compounds based on spectral moments of 2D lattice graphs for molecular dynamics trajectories.
基于二维格点图的分子动力学轨迹谱矩的抗癌和抗寄生虫化合物与 DNA 对接的评分函数。
Eur J Med Chem. 2009 Nov;44(11):4461-9. doi: 10.1016/j.ejmech.2009.06.011. Epub 2009 Jun 17.
4
Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.最短路径网络分析是一种识别长寿基因决定因素的有用方法。
PLoS One. 2008;3(11):e3802. doi: 10.1371/journal.pone.0003802. Epub 2008 Nov 25.
5
Characterization of protein-interaction networks in tumors.肿瘤中蛋白质相互作用网络的表征
BMC Bioinformatics. 2007 Jun 27;8:224. doi: 10.1186/1471-2105-8-224.