By Topic

Identifying Functional Groups by Finding Cliques and Near-Cliques in 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
$31 $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)
Kyungsook Han ; Sch. of Comput. Sci. & Eng., Inha Univ., Incheon ; Guangyu Cui ; Yu Chen

Many cellular processes are performed by a group of proteins rather than by individual proteins. When visualized in a protein-protein interaction network, proteins in a same biological unit often form a highly connected subgraph but loosely connected to the rest of the network. Therefore, finding a highly connected subgraph provides useful information to predict the function or protein complex of uncharacterized proteins in the highly connected subgraph. We have developed an efficient algorithm and program for finding cliques and near-cliques in a protein-protein interaction network. Analysis of the interaction network of yeast proteins demonstrates that 77% of the near-cliques identified by our algorithm have at least one function shared by all the proteins within a near- clique, and that 68% of the near-cliques show a good agreement with experimentally determined protein complexes catalogued in MIPS.

Published in:

Frontiers in the Convergence of Bioscience and Information Technologies, 2007. FBIT 2007

Date of Conference:

11-13 Oct. 2007