首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 260 毫秒
1.
计算方法在蛋白质相互作用研究中的应用   总被引:3,自引:1,他引:2  
计算方法在蛋白质相互作用研究的各个阶段扮演了一个重要的角色。对此,作者将从以下几个方面对计算方法在蛋白质相互作用及相互作用网络研究中的应用做一个概述:蛋白质相互作用数据库及其发展;数据挖掘方法在蛋白质相互作用数据收集和整合中的应用;高通量方法实验结果的验证;根据蛋白质相互作用网络预测和推断未知蛋白质的功能;蛋白质相互作用的预测。  相似文献   

2.
蛋白质网络聚类是识别功能模块的重要手段,不仅有利于理解生物系统的组织结构,对预测蛋白质功能也具有重要的意义。针对目前蛋白质网络聚类算法缺乏有效分析软件的事实,本文设计并实现了一个新的蛋白质网络聚类算法分析平台ClusterE。该平台实现了查全率、查准率、敏感性、特异性、功能富集分析等聚类评估方法,并且集成了FAG-EC、Dpclus、Monet、IPC-MCE、IPCA等聚类算法,不仅可以对蛋白质网络聚类分析结果进行可视化,并且可以在不同聚类分析指标下对多个聚类算法进行可视化比较与分析。该平台具有良好的扩展性,其中聚类算法以及聚类评估方法都是以插件形式集成到系统中。  相似文献   

3.
细胞中的生理活动主要是通过蛋白质 - 蛋白质之间的相互作用来调控完成 . 详尽细致的蛋白质 - 蛋白质相互作用网络的解析对于理解细胞中复杂的调控、代谢和信号通路有重要的意义 . 近年来,关于新的蛋白质 - 蛋白质相互作用预测领域进展快速,这里,利用贝叶斯算法结合关联的 GO (Gene Ontology) ,来预测蛋白质的相互作用 . 利用非冗余的蛋白质相互作用数据来观察 GO 对的特性,得到 GO 关联的概率 . 通过阳性的和阴性的标准对照数据证实这个新方法可以很好地区别这两类不同的数据,显示出较好的灵敏度和非常低的假阳性预测率 . 通过与已知的高通量的实验数据比较,这个方法具有灵敏度高、速度快的优点 . 而且,运用这个新方法可以提供一些新的关于细胞内蛋白质之间相互作用的信息,为进一步的实验提供理论依据 .  相似文献   

4.
GESTs(gene expression similarity and taxonomy similarity)是结合基因表达相似性和基因功能分类体系Gene Ontology (GO)中的功能概念相似性测度进行功能预测的新方法. 将此预测算法推广应用于蛋白质互相作用数据, 并提出了几种在蛋白质互作网络中为功能待测蛋白质筛选邻居的方法. 与已有的其它蛋白质功能预测方法不同, 新方法在学习过程中自动地从功能分类体系中的各个功能类中选择最合适的尽可能具体细致的功能类, 利用注释于其相近功能类中的互作邻居蛋白质支持对此具体功能类的预测. 使用MIPS提供的酵母蛋白质互作信息与一套基因表达谱数据, 利用特别针对GO体系结构层次特点设计的3种测度, 评价对GO知识体系中的生物过程分支进行蛋白质功能预测的效果. 结果显示, 利用文中的方法, 可以大范围预测蛋白质的精细功能. 此外, 还利用此方法对2004年底Gene Ontology上未知功能的蛋白质进行预测, 其中部分预测结果在2006年4月发布的SGD注释数据中已经得到了证实.  相似文献   

5.
唐羽  李敏 《生物信息学》2014,12(1):38-45
蛋白质网络聚类是识别功能模块的重要手段,不仅有利于理解生物系统的组织结构,对预测蛋白质功能也具有重要的意义.聚类结果的可视化分析是实现蛋白质网络聚类的有效途径.本论文基于开源的Cytoscape平台,设计并实现了一个蛋白质网络聚类分析及可视化插件CytoCluster.该插件集成了MCODE,FAG-EC,HC-PIN,OH-PIN,IPCA,EAGLE等六种典型的聚类算法;实现了聚类结果的可视化,将分析所得的clusters以缩略图列表的形式直观地显示出来,对于单个cluster,可显示在原网络中的位置,并能生成相应的子图单独显示;可对聚类结果进行导出,记录了算法名称、参数、聚类结果等信息.该插件具有良好的扩展性,提供了统一的算法接口,可不断添加新的聚类算法.  相似文献   

6.
生物信息学方法预测蛋白质相互作用网络中的功能模块   总被引:1,自引:0,他引:1  
蛋白质相互作用是大多数生命过程的基础。随着高通量实验技术和计算机预测方法的发展,在各种生物中已获得了数目十分庞大的蛋白质相互作用数据,如何从中提取出具有生物学意义的数据是一项艰巨的挑战。从蛋白质相互作用数据出发获得相互作用网络进而预测出其中的功能模块,对于蛋白质功能预测、揭示各种生化反应过程的分子机理都有着极大的帮助。我们分类概括了用生物信息学预测蛋白质相互作用功能模块的方法,以及对这些方法的评价,并介绍了蛋白质相互作用网络比较的一些方法。  相似文献   

7.
提出了一种蛋白质相互作用的相似性度量,将其与基因表达数据的相似性度量相结合,定义了一种融合的距离度量,并且将这种融合的距离度量用于改进现有的K—means聚类方法。经过实际数据的检验,改进后的K—means方法比常用的其它几种聚类方法具有更好的效果,说明结合蛋白质相互作用数据可以使得基因表达聚类的结果更有生物意义。  相似文献   

8.
蔡娟  王建新  李敏  陈钢 《生物信息学》2011,9(3):185-188
生物网络中的聚类分析是功能模块识别及蛋白质功能预测的重要方法,聚类结果的可视化对于快速有效地分析生物网络结构也具有重要作用。通过分析生物网络显示和分析平台Cytoscape的架构,设计了一个使用方便的聚类分析和显示插件ClusterViz。这是一个可扩展的聚类算法的集成平台,可以不断增加其中的聚类算法,并对不同算法的结果进行比较分析,目前已实现了三种典型的算法实例。该插件能够成为蛋白质相互作用网络机理研究的一个有效工具。  相似文献   

9.
庞尔丽 《生物学通报》2012,47(11):11-14
蛋白质行使功能时,需要与其他蛋白质或者其他分子相互作用才能完成.在蛋白质相互作用水平上研究蛋白质对理解蛋白质功能、疾病与进化具有重要的意义.就蛋白质相互作用的预测、常用的蛋白质相互作用数据库以及蛋白质相互作用网络的研究进行了介绍.  相似文献   

10.
蛋白质功能注释是后基因组时代研究的核心内容之一,基于蛋白质相互作用网络的蛋白质功能预测方法越来越受到研究者们的关注.提出了一种基于贝叶斯网络和蛋白质相互作用可信度的蛋白质功能预测方法.该方法在功能预测过程中为待注释的蛋白质建立贝叶斯网络预测模型,并充分考虑了蛋白质相互作用的可信度问题.在构建的芽殖酵母数据集上的三重交叉验证测试表明,在功能预测过程中考虑蛋白质可信度能够有效地提高功能预测的性能.与现有一些算法相比,该方法能够给出令人满意的预测效果.  相似文献   

11.
Inference of protein functions is one of the most important aims of modern biology. To fully exploit the large volumes of genomic data typically produced in modern-day genomic experiments, automated computational methods for protein function prediction are urgently needed. Established methods use sequence or structure similarity to infer functions but those types of data do not suffice to determine the biological context in which proteins act. Current high-throughput biological experiments produce large amounts of data on the interactions between proteins. Such data can be used to infer interaction networks and to predict the biological process that the protein is involved in. Here, we develop a probabilistic approach for protein function prediction using network data, such as protein-protein interaction measurements. We take a Bayesian approach to an existing Markov Random Field method by performing simultaneous estimation of the model parameters and prediction of protein functions. We use an adaptive Markov Chain Monte Carlo algorithm that leads to more accurate parameter estimates and consequently to improved prediction performance compared to the standard Markov Random Fields method. We tested our method using a high quality S.cereviciae validation network with 1622 proteins against 90 Gene Ontology terms of different levels of abstraction. Compared to three other protein function prediction methods, our approach shows very good prediction performance. Our method can be directly applied to protein-protein interaction or coexpression networks, but also can be extended to use multiple data sources. We apply our method to physical protein interaction data from S. cerevisiae and provide novel predictions, using 340 Gene Ontology terms, for 1170 unannotated proteins and we evaluate the predictions using the available literature.  相似文献   

12.
13.
With the development of high-throughput methods for identifying protein-protein interactions, large scale interaction networks are available. Computational methods to analyze the networks to detect functional modules as protein complexes are becoming more important. However, most of the existing methods only make use of the protein-protein interaction networks without considering the structural limitations of proteins to bind together. In this paper, we design a new protein complex prediction method by extending the idea of using domain-domain interaction information. Here we formulate the problem into a maximum matching problem (which can be solved in polynomial time) instead of the binary integer linear programming approach (which can be NP-hard in the worst case). We also add a step to predict domain-domain interactions which first searches the database Pfam using the hidden Markov model and then predicts the domain-domain interactions based on the database DOMINE and InterDom which contain confirmed DDIs. By adding the domain-domain interaction prediction step, we have more edges in the DDI graph and the recall value is increased significantly (at least doubled) comparing with the method of Ozawa et al. (2010) [1] while the average precision value is slightly better. We also combine our method with three other existing methods, such as COACH, MCL and MCODE. Experiments show that the precision of the combined method is improved. This article is part of a Special Issue entitled: Computational Methods for Protein Interaction and Structural Prediction.  相似文献   

14.
Prediction of protein function using protein-protein interaction data.   总被引:8,自引:0,他引:8  
Assigning functions to novel proteins is one of the most important problems in the postgenomic era. Several approaches have been applied to this problem, including the analysis of gene expression patterns, phylogenetic profiles, protein fusions, and protein-protein interactions. In this paper, we develop a novel approach that employs the theory of Markov random fields to infer a protein's functions using protein-protein interaction data and the functional annotations of protein's interaction partners. For each function of interest and protein, we predict the probability that the protein has such function using Bayesian approaches. Unlike other available approaches for protein annotation in which a protein has or does not have a function of interest, we give a probability for having the function. This probability indicates how confident we are about the prediction. We employ our method to predict protein functions based on "biochemical function," "subcellular location," and "cellular role" for yeast proteins defined in the Yeast Proteome Database (YPD, www.incyte.com), using the protein-protein interaction data from the Munich Information Center for Protein Sequences (MIPS, mips.gsf.de). We show that our approach outperforms other available methods for function prediction based on protein interaction data. The supplementary data is available at www-hto.usc.edu/~msms/ProteinFunction.  相似文献   

15.
Pairwise interactions of the six human MCM protein subunits   总被引:9,自引:0,他引:9  
The eukaryotic minichromosome maintenance (MCM) proteins have six subunits, Mcm2 to 7p. Together they play essential roles in the initiation and elongation of DNA replication, and the human MCM proteins present attractive targets for potential anticancer drugs. The six MCM subunits interact and form a ring-shaped heterohexameric complex containing one of each subunit in a variety of eukaryotes, and subcomplexes have also been observed. However, the architecture of the human MCM heterohexameric complex is still unknown. We systematically studied pairwise interactions of individual human MCM subunits by using the yeast two-hybrid system and in vivo protein-protein crosslinking with a non-cleavable crosslinker in human cells followed by co-immunoprecipitation. In the yeast two-hybrid assays, we revealed multiple binary interactions among the six human MCM proteins, and a subset of these interactions was also detected as direct interactions in human cells. Based on our results, we propose a model for the architecture of the human MCM protein heterohexameric complex. We also propose models for the structures of subcomplexes. Thus, this study may serve as a foundation for understanding the overall architecture and function of eukaryotic MCM protein complexes and as clues for developing anticancer drugs targeted to the human MCM proteins.  相似文献   

16.

Background  

Bioinformatics can be used to predict protein function, leading to an understanding of cellular activities, and equally-weighted protein-protein interactions (PPI) are normally used to predict such protein functions. The present study provides a weighting strategy for PPI to improve the prediction of protein functions. The weights are dependent on the local and global network topologies and the number of experimental verification methods. The proposed methods were applied to the yeast proteome and integrated with the neighbour counting method to predict the functions of unknown proteins.  相似文献   

17.
Protein interactions play an important role in the discovery of protein functions and pathways in biological processes. This is especially true in case of the diseases caused by the loss of specific protein-protein interactions in the organism. The accuracy of experimental results in finding protein-protein interactions, however, is rather dubious and high throughput experimental results have shown both high false positive beside false negative information for protein interaction. Computational methods have attracted tremendous attention among biologists because of the ability to predict protein-protein interactions and validate the obtained experimental results. In this study, we have reviewed several computational methods for protein-protein interaction prediction as well as describing major databases, which store both predicted and detected protein-protein interactions, and the tools used for analyzing protein interaction networks and improving protein-protein interaction reliability.  相似文献   

18.
Assigning functions to unknown proteins is one of the most important problems in proteomics. Several approaches have used protein-protein interaction data to predict protein functions. We previously developed a Markov random field (MRF) based method to infer a protein's functions using protein-protein interaction data and the functional annotations of its protein interaction partners. In the original model, only direct interactions were considered and each function was considered separately. In this study, we develop a new model which extends direct interactions to all neighboring proteins, and one function to multiple functions. The goal is to understand a protein's function based on information on all the neighboring proteins in the interaction network. We first developed a novel kernel logistic regression (KLR) method based on diffusion kernels for protein interaction networks. The diffusion kernels provide means to incorporate all neighbors of proteins in the network. Second, we identified a set of functions that are highly correlated with the function of interest, referred to as the correlated functions, using the chi-square test. Third, the correlated functions were incorporated into our new KLR model. Fourth, we extended our model by incorporating multiple biological data sources such as protein domains, protein complexes, and gene expressions by converting them into networks. We showed that the KLR approach of incorporating all protein neighbors significantly improved the accuracy of protein function predictions over the MRF model. The incorporation of multiple data sets also improved prediction accuracy. The prediction accuracy is comparable to another protein function classifier based on the support vector machine (SVM), using a diffusion kernel. The advantages of the KLR model include its simplicity as well as its ability to explore the contribution of neighbors to the functions of proteins of interest.  相似文献   

19.
Protein domains are conserved and functionally independent structures that play an important role in interactions among related proteins. Domain-domain inter- actions have been recently used to predict protein-protein interactions (PPI). In general, the interaction probability of a pair of domains is scored using a trained scoring function. Satisfying a threshold, the protein pairs carrying those domains are regarded as "interacting". In this study, the signature contents of proteins were utilized to predict PPI pairs in Saccharomyces cerevisiae, Caenorhabditis ele- gans, and Homo sapiens. Similarity between protein signature patterns was scored and PPI predictions were drawn based on the binary similarity scoring function. Results show that the true positive rate of prediction by the proposed approach is approximately 32% higher than that using the maximum likelihood estimation method when compared with a test set, resulting in 22% increase in the area un- der the receiver operating characteristic (ROC) curve. When proteins containing one or two signatures were removed, the sensitivity of the predicted PPI pairs in- creased significantly. The predicted PPI pairs are on average 11 times more likely to interact than the random selection at a confidence level of 0.95, and on aver- age 4 times better than those predicted by either phylogenetic profiling or gene expression profiling.  相似文献   

20.
Molecular understanding of disease processes can be accelerated if all interactions between the host and pathogen are known. The unavailability of experimental methods for large-scale detection of interactions across host and pathogen organisms hinders this process. Here we apply a simple method to predict protein-protein interactions across a host and pathogen organisms. We use homology detection approaches against the protein-protein interaction databases, DIP and iPfam in order to predict interacting proteins in a host-pathogen pair. In the present work, we first applied this approach to the test cases involving the pairs phage T4 -Escherichia coli and phage lambda -E. coli and show that previously known interactions could be recognized using our approach. We further apply this approach to predict interactions between human and three pathogens E. coli, Salmonella enterica typhimurium and Yersinia pestis. We identified several novel interactions involving proteins of host or pathogen that could be thought of as highly relevant to the disease process. Serendipitously, many interactions involve hypothetical proteins of yet unknown function. Hypothetical proteins are predicted from computational analysis of genome sequences with no laboratory analysis on their functions yet available. The predicted interactions involving such proteins could provide hints to their functions.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号