Clustering PPI data based on Improved functional-flow model through Quantum-behaved PSO

Clustering Protein-Protein Interaction (PPI) data is a difficult problem due to its small world and scale-free characteristics. Existing clustering methods could not perform well. This paper proposes an improved functional-flow based approach through Quantum-behaved Particle Swarm Optimisation (QPSO) algorithm, which can find the optimum threshold automatically when calculating the lowest similarity between modules. We also take bridging nodes into account to improve the clustering result. The experiments on Munich Information Center for Protein Sequences (MIPS) PPI data sets show that the algorithm has better performance than functional flow method in terms of accuracy and number of matched clusters.

[1]  Aidong Zhang,et al.  CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions , 2008, BMC Bioinformatics.

[2]  J M Gauthier,et al.  Protein--protein interaction maps: a lead towards cellular functions. , 2001, Trends in genetics : TIG.

[3]  Aidong Zhang,et al.  Semantic integration to identify overlapping functional modules in protein interaction networks , 2007, BMC Bioinformatics.

[4]  Rosni Abdullah,et al.  ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins from Protein Interaction Network , 2008, 2008 Second UKSIM European Symposium on Computer Modeling and Simulation.

[5]  Shoshana J. Wodak,et al.  CYGD: the Comprehensive Yeast Genome Database , 2004, Nucleic Acids Res..

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

[7]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[8]  Xiujuan Lei,et al.  An improved projection pursuit clustering model and its application based on Quantum-behaved PSO , 2010, 2010 Sixth International Conference on Natural Computation.

[9]  B. Schwikowski,et al.  A network of protein–protein interactions in yeast , 2000, Nature Biotechnology.

[10]  T. Haystead,et al.  Molecular Biologist's Guide to Proteomics , 2002, Microbiology and Molecular Biology Reviews.

[11]  J. Hopfield,et al.  From molecular to modular cell biology , 1999, Nature.

[12]  Mona Singh,et al.  Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps , 2005, ISMB.

[13]  Bertrand Séraphin,et al.  Recent developments in the analysis of protein complexes 1 , 2004, FEBS letters.

[14]  M. Pellegrini,et al.  Protein Interaction Networks , 2004, Expert review of proteomics.

[15]  Jun Sun,et al.  A global search strategy of quantum-behaved particle swarm optimization , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[16]  Aidong Zhang,et al.  Identification of Overlapping Functional Modules in Protein Interaction Networks: Information Flow-based Approach , 2006, ICDM Workshops.

[17]  Juan Liu,et al.  Clustering Protein Interaction Data Through Chaotic Genetic Algorithm , 2006, SEAL.

[18]  P. Bork,et al.  Proteome survey reveals modularity of the yeast cell machinery , 2006, Nature.

[19]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[20]  Aidong Zhang,et al.  Protein Interaction Networks: Computational Analysis , 2009 .

[21]  D. Hochstrasser,et al.  Progress with proteome projects: why all proteins expressed by a genome should be identified and how to do it. , 1996, Biotechnology & genetic engineering reviews.

[22]  David Warde-Farley,et al.  Dynamic modularity in protein interaction networks predicts breast cancer outcome , 2009, Nature Biotechnology.

[23]  A. Barabasi,et al.  Functional and topological characterization of protein interaction networks , 2004, Proteomics.

[24]  I. Dan Melamed,et al.  Precision and Recall of Machine Translation , 2003, NAACL.

[25]  Wenbo Xu,et al.  Particle swarm optimization with particles having quantum behavior , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).