By Topic

Identification of core-attachment complexes based on maximal frequent patterns in protein-protein interaction networks

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.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liang Yu ; School of Computer Science and Technology, Xidian University, Xi'an, China ; Lin Gao ; Chuiliang Kong

In this paper, we present a method based on mining maximal frequent patterns for core-attachment complexes identification in yeast protein-protein interaction networks (PINs). Our method contains of two stages. Firstly, it finds all the protein-complex cores by mining maximal frequent patterns in PIN using FP-growth method. Then it filters the redundant cores and adds the attachment proteins for each remained core to form protein complexes. We experimentally evaluate the performance of our method using three different yeast PINs. The results show that our method is better than other existing methods with regard to localization and Gene Ontology (GO) semantic similarity within the predicted complexes. Furthermore, the accuracy of prediction with regard to the known CYC2008 reference complexes proves that our results can obtain higher map complex rate.

Published in:

Bioinformatics and Biomedicine Workshops (BIBMW), 2010 IEEE International Conference on

Date of Conference:

18-18 Dec. 2010