Inderscience PublishersInderscience PublishersInderscience Publishers
  PUBLISHERS OF DISTINGUISHED ACADEMIC, SCIENTIFIC AND PROFESSIONAL JOURNALS

Article Abstract

Title: Finding molecular complexes through multiple layer clustering of protein interaction networks
  Author: Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang   Email author(s)
  Address: Department of Computer Science and Engineering, York University, Toronto, Ontario M3J 1P3, Canada. ' Department of Computer Science and Engineering, York University, Toronto, Ontario M3J 1P3, Canada. ' School of Information Technology, York University, Toronto, Ontario M3J 1P3, Canada. ' Department of Mathematics and Statistics, York University, Toronto, Ontario M3J 1P3, Canada
  Journal: International Journal of Bioinformatics Research and Applications 2007 - Vol. 3, No.1  pp. 65 - 85
  Abstract: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without considering the layered structure of PINs. We propose the MULIC clustering algorithm that produces layered clusters. We applied MULIC to five PINs. Clusters correlate with known MIPS protein complexes. For example, a cluster of 79 proteins overlaps with a known complex of 88 proteins. Proteins in top cluster layers tend to be more representative of complexes than proteins in bottom layers. Lab work on finding unknown complexes or determining drug effects can be guided by top layer proteins.
  Keywords: clustering; multiple layers; protein interaction networks; molecular complexes; graphs; categorical attributes; neighbourhood similarity; adjacency matrix; bioinformatics; drug effects.
  DOI: 10.1504/IJBRA.2007.011835
  Access for editors and complimentary subscribers       Access for Subscribers   Purchase this Paper        We welcome your comments about this paper Comment on the Paper