An automated method for finding molecular complexes in large protein interaction networks
By Gary D. Bader, Christopher W. V. Hogue. BMC Bioinformatics, 2003
5,430 citations recorded by the source corpus.
BackgroundRecent advances in proteomics technologies such as two-hybrid, phage display and mass spectrometry have enabled us to create a detailed map of biomolecular interaction networks. Initial mapping efforts have already produced a wealth of data. As the size of the interaction set increases, databases and computational methods will be required to store, visualize and analyze the information in order to effectively aid in knowledge discovery.ResultsThis paper describes a novel graph theoretic clustering algorithm, "Molecular Complex Detection" (MCODE), that detects densely connected regions in large protein-protein interaction networks that may represent molecular complexes. The method is based on vertex weighting by local neighborhood density and outward traversal from a locally dense seed protein to isolate the dense regions according to given parameters. The algorithm has the advantage over other graph clustering methods of having a directed mode that allows fine-tuning of clusters of interest without considering the rest of the network and allows examination of cluster interconnectivity, which is relevant for protein networks. Protein interaction and complex information from the yeast Saccharomyces cerevisiae was used for evaluation.ConclusionDense regions of protein interaction networks can be found, based solely on connectivity data, many of which correspond to known protein complexes. The algorithm is not affected by a known high rate of false positives in data from high-throughput interaction techniques. The program is available from ftp://ftp.mshri.on.ca/pub/BIND/Tools/MCODE.
Subfields: Cell Biology, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/06aad24ac4ad4312ca190d0c16fe0df7f474844c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Cell Biology
- Igor Jurisica
- Natasa Przulj
- Min Wu
- Chee Keong Kwoh
- See-Kiong Ng
- Xiaoli Li
- Jacques van Helden
- Sylvain Brohée
In Molecular Biology
Citations in the corpus
- A core-attachment based method to detect protein complexes in PPI networks (2009, methodology): “A preliminary core in a neighborhood graph Gv is a dense subgraph where all its members should show higher significance and have heavier weights [12,13] than those non-members.”
- Network-based prediction of protein function (2007, methodology): “Only a handful, such as MCODE (Bader and Hogue, 2003), PRODISTIN (Baudot et al , 2006), CFinder (Adamcsek et al , 2006) and NetworkBlast (http://www.pathblast.org/), are currently supported with a graphical interface.”
- Topological analysis and interactive visualization of biological networks and protein structures (2012, methodology): “For instance, plug-ins such as ClusterMaker 49 , GLay 50 , MCODE 51 , MINE 52 and NeMo 53 can be used to identify and visualize clusters in networks, whereas the DomainGraph plug-in has a special focus on the visual analysis of the effect of alternative splicing on gene and protein networks 54 .”
- Gaining confidence in high-throughput protein interaction networks (2004, neutral): “Although computationally intensive approaches have been describe”
- Protein interaction networks from yeast to human. (2004, background): “Modules are being sought for a variety of networks: metabolic networks [55], high-throughput experimental interaction data [56–60] and in silico predicted networks [37 ,61].”
- Mining coherent dense subgraphs across massive biological networks for functional discovery (2005, background): “…from biological networks, which are often biologically meaningful, e.g. a dense protein interaction subnetwork may correspond to a protein complex (Bader and Hogue, 2003; Spirin and Mirny, 2003), and a dense co-expression network may represent a tight co-expression cluster (Sharan and Shamir,…”
- Functional topology in a network of protein interactions (2004, methodology): “MCODE method (Bader and Hogue, 2003)] or the reliance on reciprocal bait–hit interactions as a measure of complex involvement.”
- SIRT5-Mediated Lysine Desuccinylation Impacts Diverse Metabolic Pathways (2013, methodology): “Using the MCODE tool (Bader and Hogue, 2003), we identified a number of highly connected subnetworks among Lys-succinylated proteins, including the F1F0 ATP synthetase, respiratory chain supercomplexes (complexes I, III, and IV), glutathione S transferases, ribosomes, and the chaperonin-containing…”
- BIOLOGICAL NETWORK EXPLORATION WITH CYTOSCAPE 3 (2014, background): “MCODE (Bader and Hogue, 2003) is one of many Cytoscape Apps that identifies local clusters that can be used to identify interesting modules.”
- Evaluation of clustering algorithms for protein-protein interaction networks (2006, methodology): “Developper King AD Van Dongen S Bader GD and Hogue CWV Blatt M, Wiseman S, Domany E References [21] [35] [ 19 ] [18] BMC Bioinformatics 2006, 7:488 http://www.biomedcentral.com/1471-2105/7/488”