By Topic

A “Seed-Refine” Algorithm for Detecting Protein Complexes From Protein Interaction Data

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

2 Author(s)
Pengjun Pei ; Dept. of Comput. Sci. & Eng., State Univ. of New York ; Aidong Zhang

New technology advances in large-scale protein-protein interaction detection provide researchers an initial view of proteins on a global scale. These massive data sets provide a valuable source for elucidating the biomolecular mechanism in the cell. In this paper, we investigate the problem of protein complex detection from noisy protein interaction data, i.e., finding the subsets of proteins that are closely coupled via protein interactions. We identify the challenges and propose a "seed-refine" approach. We propose a novel statistically meaningful subgraph quality measure, a two-layer seeding heuristic to find good seeds, and a novel subgraph refinement method that controls the overlap between subgraphs. Experiments show the desirable properties of our subgraph quality measure and the effectiveness of our "seed-refine" algorithm

Published in:

NanoBioscience, IEEE Transactions on  (Volume:6 ,  Issue: 1 )