Title
Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks
Abstract
An approach for module identification, Modules of Networks (MoNet), introduced an intuitive module definition and clear detection method using edges ranked by the Girvan-Newman algorithm. Modules from a yeast network showed significant association with biological processes, indicating the method's utility; however, systematic bias leads to varied results across trials. MoNet modules also exclude some network regions. To address these shortcomings, we developed a deterministic version of the Girvan-Newman algorithm and a new agglomerative algorithm, Deterministic Modularization of Networks (dMoNet). dMoNet simultaneously processes structurally equivalent edges while preserving intuitive foundations of the MoNet algorithm and generates modules with full network coverage.
Year
DOI
Venue
2010
10.1504/IJBRA.2010.032115
IJBRA
Keywords
Field
DocType
girvan newman,biological process,biological systems,interaction network,graph theory,modules,algorithms,bioinformatics,betweenness,indexing terms
Graph theory,Hierarchical clustering,Graph,Ranking,Computer science,Gene ontology,Girvan–Newman algorithm,Algorithm,Theoretical computer science,Betweenness centrality,Modular programming,Bioinformatics
Journal
Volume
Issue
Citations 
6
2
0
PageRank 
References 
Authors
0.34
12
4
Name
Order
Citations
PageRank
Roger L. Chang1422.94
Feng Luo228426.03
Stuart Johnson300.34
Richard H. Scheuermann425823.91