On the Discovery of Novel Drug-Target Interactions from Dense SubGraphs
1. On the Discovery of Novel
Drug-Target Interactions
from Dense SubGraphs
Alejandro Flores
Maria-Esther Vidal
Guillermo Palma
Universidad Simón Bolívar
1Graph-TA 2015
3. Motivation
Graph-TA 2015 3
Network of Drug-Target Interactions.
Drug (Green); Target (Yellow).
Densest Subgraphs
from where novel drug-
target interactions can
be suggested.
6. The esDSG Problem
• Given a bipartite graph G=(D U T, E)
The esDSG problem identifies the subgraph
G* G such that the edge-similarity density
of G* is maximized.
Graph-TA 2015 6
14. Conclusions and Future Plans
The esDSG problem allows for the
prediction of novel interactions that
cannot be suggested by state-of-the-art
approaches.
Extend esDSG to traverse different
connected components to identify
esDSGs from each component.
Graph-TA 2015 14