返回
Evolutionary Graph Clustering for Protein Complex Identification
DOI:10.1109/TCBB.2016.2642107.png)
摘要
En 中文
This paper presents a graph clustering algorithm, called EGCPI, to discover protein complexes in protein-protein interaction (PRI) networks. In performing its task, EGCPI takes into consideration both network topologies and attributes of interacting proteins, both of which have been shown to be important for protein complex discovery. EGCPI formulates the problem as an optimization problem and tackles it with evolutionary clustering. Given a PPI network, EGCPI first annotates each protein with corresponding attributes that are provided in Gene Ontology database. It then adopts a similarity measure to evaluate how similar the connected proteins are taking into consideration the network topology. Given this measure, EGCPI then discovers a number of graph clusters within which proteins are densely connected, based on an evolutionary strategy. At last, EGCPI identifies protein complexes in each discovered cluster based on the homogeneity of attributes performed by pairwise proteins. EGCPI has been tested with several real data sets and the experimental results show EGCPI is very effective on protein complex discovery, and the evolutionary clustering is helpful to identify protein complexes in PPI networks. The software of EGCPI can be downloaded via: https://github.com/hetiantian1985/EGCPI.
Keyword:
Graph clustering
evolutionary clustering
clustering algorithms
protein-protein interaction networks
protein complex identification
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
In vitro reconstruction of a tissue-engineered endothelialized bladder from a single porcine biopsy从单个猪活检中体外重建组织工程化的内皮化膀胱
BioGRID: a general repository for interaction datasetsBioGRID: 交互数据集的通用存储库
NUCLEIC ACIDS RESEARCH
IF13.1

