title: MGclus: network clustering employing shared neighbors.
abstract: Network analysis is an important tool for functional annotation of genes and proteins. A common approach to discern structure in a global network is to infer network clusters, or modules, and assume a functional coherence within each module, which may represent a complex or a pathway. It is however not trivial to define optimal modules. Although many methods have been proposed, it is unclear which methods perform best in general. It seems that most methods produce far from optimal results but in different ways. MGclus is a new algorithm designed to detect modules with a strongly interconnected neighborhood in large scale biological interaction networks. In our benchmarks we found MGclus to outperform other methods when applied to random graphs with varying degree of noise, and to perform equally or better when applied to biological protein interaction networks. MGclus is implemented in Java and utilizes the JGraphT graph library. It has an easy to use command-line interface and is available for download from .
authors: Stockholm Bioinformatics Centre, Science for Life Laboratory, Box 1031, SE-17121 Solna, Sweden.
authors: Oliver
authors: O
authors: Frings
authors: Andrey
authors: A
authors: Alexeyenko
authors: Erik L L
authors: EL
authors: Sonnhammer
mesh_terms: D016000:Cluster Analysis; D053263:Gene Regulatory Networks; D006801:Humans; D025941:Protein Interaction Mapping / Q000379:methods; D015203:Reproducibility of Results; D012441:Saccharomyces cerevisiae / Q000235:genetics / Q000378:metabolism; D012984:Software