Community structure detection for overlapping modules through mathematical programming in protein interaction networks

Overlapping communities detection through weighted graph community games

We propose a new model to detect the overlapping communities of a network that is based on cooperative games and mathematical programming. More specifically, communities are defined as stable coalitions of a weighted graph community game and they are revealed as the optimal solution of a mixed-integer linear programming problem. Exact optimal solutions are obtained for small and medium sized instances and it is shown that they provide useful information about the network structure, improving on previous contributions. Next, a heuristic algorithm is developed to solve the largest instances and used to compare two variations of the objective function.

Network medicine in ovarian cancer: topological properties to drug discovery

Network medicine provides network theoretical tools, methods and properties to study underlying laws governing human interactome to identify disease states and disease complexity leading to drug discovery. Within this framework, we investigated the topological properties of ovarian cancer network (OCN) and the roles of hubs to understand OCN organization to address disease states and complexity. The OCN constructed from the experimentally verified genes exhibits fractal nature in the topological properties with deeply rooted functional communities indicating self-organizing behavior. The network properties at all levels of organization obey one parameter scaling law which lacks centrality lethality rule. We showed that $\langle k\rangle $ can be taken as a scaling parameter, where, power law exponent can be estimated from the ratio of network diameters. The betweenness centrality $C_B$ shows two distinct behaviors one shown by high degree hubs and the other by segregated low degree nodes. The $C_B$ power law exponent is found to connect the exponents of distributions of high and low degree nodes. OCN showed the absence of rich-club formation which leads to the missing of a number of attractors in the network causing formation of weakly tied diverse functional modules to keep optimal network efficiency. In OCN, provincial and connector hubs, which includes identified key regulators, take major responsibility to keep the OCN integrity and organization. Further, most of the key regulators are found to be over expressed and positively correlated with immune infiltrates. Finally, few potential drugs are identified related to the key regulators.

oComm: Overlapping Community Detection in Multi-View Brain Network

Many efforts have been made on developing multi-view network community detection approaches. However, most of them can only reveal non-overlapping community structure. In this paper, we propose a novel approach for Overlapping Community Detection in Multi-view Brain Network (oComm). For modeling the overlapping community structure, a community membership strength vector is introduced for each node in each view, based on which a network generative model is designed to measure the within-view community quality. For measuring the consistency of overlapping community structures across different views, the Jaccard similarity is adopted to measure the first-order structural consistency of one node across different views, based on which a cross-view community consistency model is established. One objective function is defined by integrating the above two components. By solving the objective function via the alternative coordinate gradient ascent method, the optimal community membership strength vectors are generated, from which the multi-view overlapping community structure is obtained. Additionally, this study collects a set of EEG data of 147 subjects from Department of Otolaryngology of Sun Yat-sen Memorial Hospital, Sun Yat-sen University, based on which three multi-view brain networks are constructed. Comparison results with several existing approaches have confirmed the effectiveness of the proposed method.

DriveWays: a method for identifying possibly overlapping driver pathways in cancer

The majority of the previous methods for identifying cancer driver modules output nonoverlapping modules. This assumption is biologically inaccurate as genes can participate in multiple molecular pathways. This is particularly true for cancer-associated genes as many of them are network hubs connecting functionally distinct set of genes. It is important to provide combinatorial optimization problem definitions modeling this biological phenomenon and to suggest efficient algorithms for its solution. We provide a formal definition of the Overlapping Driver Module Identification in Cancer (ODMIC) problem. We show that the problem is NP-hard. We propose a seed-and-extend based heuristic named DriveWays that identifies overlapping cancer driver modules from the graph built from the IntAct PPI network. DriveWays incorporates mutual exclusivity, coverage, and the network connectivity information of the genes. We show that DriveWays outperforms the state-of-the-art methods in recovering well-known cancer driver genes performed on TCGA pan-cancer data. Additionally, DriveWay’s output modules show a stronger enrichment for the reference pathways in almost all cases. Overall, we show that enabling modules to overlap improves the recovery of functional pathways filtered with known cancer drivers, which essentially constitute the reference set of cancer-related pathways.