MétaCan
← all works

An automated method for finding molecular complexes in large protein interaction networks

2003· article· en· 6,293 citations· W2136850043 on OpenAlex· 10.1186/1471-2105-4-2

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.
Canadian funderA Canadian agency funded it. The work may carry no Canadian affiliation at all.

Abstract

BACKGROUND: Recent 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. RESULTS: This 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. CONCLUSION: Dense 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.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

The record

Venue
BMC Bioinformatics
Topic
Bioinformatics and Genomic Networks
Field
Biochemistry, Genetics and Molecular Biology
Canadian institutions
Lunenfeld-Tanenbaum Research InstituteUniversity of TorontoMount Sinai Hospital
Funders
Canadian Institutes of Health Research
Keywords
Computer scienceTree traversalCluster analysisProtein Interaction NetworksProtein–protein interactionInteraction networkData miningFalse positive paradoxComputational biologyTheoretical computer scienceAlgorithmArtificial intelligenceBiologyGenetics
Has abstract in OpenAlex
yes