PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks

A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the undirected graph modelling it. The algorithm introduces the concept of quality of a sub-matrix of the adjacency matrix, and applies a greedy search technique for finding local optimal solutions made of dense submatrices containing the maximum number of ones. An initial random solution, constituted by a single protein, is evolved to search for a locally optimal solution by adding/removing connected proteins that best contribute to improve the quality function. Experimental evaluations carried out on Saccaromyces Cerevisiae proteins show that the algorithm is able to efficiently isolate groups of biologically meaningful proteins corresponding to the most compact sets of interactions.

• Type: Conference
• Year: 2007
• Where: IDEAL
• Authors: Clara Pizzuti, Simona E. Rombo
• Keywords: Adjacency Matrix, Greedy Search Technique, IDEAL 2007, Optimal Solution