By Topic

Mining protein complexes from PPI networks using the minimum vertex cut

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Ding, Xiaojun ; School of Information Science and Engineering, Central South University, Changsha 410083, China; Department of Computer Science, Georgia State University, Atlanta, GA 30302, USA ; Wang, WeiPing ; Peng, Xiaoqing ; Wang, Jianxin

Evidence shows that biological systems are composed of separable functional modules. Identifying protein complexes is essential for understanding the principles of cellular functions. Many methods have been proposed to mine protein complexes from protein-protein interaction networks. However, the performances of these algorithms are not good enough since the protein-protein interactions detected from experiments are not complete and have noise. This paper presents an analysis of the topological properties of protein complexes to show that although proteins from the same complex are more highly connected than proteins from different complexes, many protein complexes are not very dense (density ≥ 0.8). A method is then given to mine protein complexes that are relatively dense (density ≥ 0.4). In the first step, a topology property is used to identify proteins that are probably in a same complex. Then, a possible boundary is calculated based on a minimum vertex cut for the protein complex. The final complex is formed by the proteins within the boundary. The method is validated on a yeast protein-protein interaction network. The results show that this method has better performance in terms of sensitivity and specificity compared with other methods. The functional consistency is also good.

Published in:

Tsinghua Science and Technology  (Volume:17 ,  Issue: 6 )