CytoMCL: A Cytoscape plugin for fast clustering of protein interaction networks

The analysis of the whole set of molecular interactions in an organism, often referred to as interaction networks, is becoming an important research area. A main approach for such analysis resides on the application of clustering techniques to such networks. The meaning of discovered clusters, (i.e. highly interconnected regions), is strictly related to the type of networks. For instance in protein-protein interaction networks clusters may represent protein complexes. The Markov Clustering Algorithm (MCL) is a wellknown algorithm for clustering graphs. It does not provide a graphical user interface and cannot be used in the Cytoscape platform. We present CytoMCL a Cytoscape plugin that finds clusters in a graph by using MCL. It is based on an intuitive interface it is able to load a network from Cytoscape, to analyze it and to visualize resulting clusters into Cytoscape.

[1]  Shigehiko Kanaya,et al.  Development and implementation of an algorithm for detection of protein complexes in large interaction networks , 2006, BMC Bioinformatics.

[2]  Igor Jurisica,et al.  Functional topology in a network of protein interactions , 2004, Bioinform..

[3]  Mario Cannataro,et al.  Protein-to-protein interactions: Technologies, databases, and algorithms , 2010, CSUR.

[4]  Andrew D. King Graph clustering with restricted neighbourhood search , 2004 .

[5]  R. Ozawa,et al.  A comprehensive two-hybrid analysis to explore the yeast protein interactome , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Roded Sharan,et al.  Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data , 2004, J. Comput. Biol..

[7]  S. vanDongen Graph Clustering by Flow Simulation , 2000 .

[8]  P. Bork,et al.  Functional organization of the yeast proteome by systematic analysis of protein complexes , 2002, Nature.

[9]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[10]  M. Golumbic Algorithmic graph theory and perfect graphs , 1980 .

[11]  Adam J. Smith,et al.  The Database of Interacting Proteins: 2004 update , 2004, Nucleic Acids Res..

[12]  Gary D. Bader,et al.  clusterMaker: a multi-algorithm clustering plugin for Cytoscape , 2011, BMC Bioinformatics.

[13]  See-Kiong Ng,et al.  Interaction graph mining for protein complexes using local clique merging. , 2005, Genome informatics. International Conference on Genome Informatics.

[14]  D. Fell,et al.  The small world of metabolism , 2000, Nature Biotechnology.

[15]  Jacques van Helden,et al.  Evaluation of clustering algorithms for protein-protein interaction networks , 2006, BMC Bioinformatics.

[16]  Anton J. Enright,et al.  An efficient algorithm for large-scale detection of protein families. , 2002, Nucleic acids research.

[17]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[18]  Igor Jurisica,et al.  Protein complex prediction via cost-based clustering , 2004, Bioinform..

[19]  P. Shannon,et al.  Cytoscape: a software environment for integrated models of biomolecular interaction networks. , 2003, Genome research.

[20]  Dmitrij Frishman,et al.  MIPS: a database for genomes and protein sequences , 2000, Nucleic Acids Res..