title: Identifying complexes from protein interaction networks according to different types of neighborhood density.
abstract: To facilitate the realization of biological functions, proteins are often organized into complexes. While computational techniques are used to predict these complexes, detailed understanding of their organization remains inadequate. Apart from complexes that reside in very dense regions of a protein interaction network in which most algorithms are able to identify, we observe that many other complexes, while not residing in very dense regions, reside in regions with low neighborhood density. We develop an algorithm for identifying protein complexes by considering these two types of complexes separately. We test our algorithm on a few yeast protein interaction networks, and show that our algorithm is able to identify complexes more accurately than existing algorithms. A software program NDComplex for implementing the algorithm is available at http://faculty.cse.tamu.edu/shsze/ndcomplex.
authors.affiliation: Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843-3112, USA.
authors.forename: Jia-Hao
authors.initials: JH
authors.lastname: Fan
authors.forename: Jianer
authors.initials: J
authors.lastname: Chen
authors.forename: Sing-Hoi
authors.initials: SH
authors.lastname: Sze
mesh_terms: D000465:Algorithms; D025941:Protein Interaction Mapping / Q000379:methods*; D060066:Protein Interaction Maps; D011506:Proteins / Q000235:genetics / Q000378:metabolism*; D012984:Software
chemical_list: D011506:Proteins