Decomposing PPI networks for complex discovery
Open Access
- 1 January 2011
- journal article
- research article
- Published by Springer Nature in Proteome Science
- Vol. 9 (Suppl 1) , S15
Abstract
Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput protein-protein interactions (PPI), many algorithms have been proposed to discover protein complexes from PPI networks. However, existing algorithms generally do not take into consideration the fact that not all the interactions in a PPI network take place at the same time. As a result, predicted complexes often contain many spuriously included proteins, precluding them from matching true complexes.Keywords
This publication has 17 references indexed in Scilit:
- Protein complex prediction based on k-connected subgraphs in protein interaction networkBMC Systems Biology, 2010
- Up-to-date catalogues of yeast protein complexesNucleic Acids Research, 2008
- Modifying the DPClus algorithm for identifying protein complexes based on new topological structuresBMC Bioinformatics, 2008
- Development and implementation of an algorithm for detection of protein complexes in large interaction networksBMC Bioinformatics, 2006
- CFinder: locating cliques and overlapping modules in biological networksBioinformatics, 2006
- BioGRID: a general repository for interaction datasetsNucleic Acids Research, 2006
- Evidence for dynamically organized modularity in the yeast protein–protein interaction networkNature, 2004
- Structure-Based Assembly of Protein Complexes in YeastScience, 2004
- MIPS: analysis and annotation of proteins from whole genomesNucleic Acids Research, 2004
- An automated method for finding molecular complexes in large protein interaction networksBMC Bioinformatics, 2003