Link Prediction in Multipartite Graphs With Application to Drug Repositioning Studies

Developing new ethical drugs is exceedingly expensive in terms of both time and resources. A single drug can take up to a decade to bring to market, with costs soaring to over a billion dollars. Drug repositioning has thus become an attractive alternative to the development of new compounds, with growing interest in the use of in silico repositioning predictions. Bipartite graphs and efficient biclique enumeration algorithms can be used to study drug-protein or other pairwise crucial interactions. Extensions of this approach to datasets with three or more divergent data types have been hobbled, however, by a lack of effective analytics. To address this shortcoming, a highly innovative and efficient graph theoretical technique is introduced to impute potential edges (links) in an arbitrary multipartite graph. The utility of this method is demonstrated on five tripartite graphs, each comprised of three partite sets, one each for diseases, drugs, and gene products of interest, and with interpartite edges denoting known interactions or associations. Evidence for the reliability of imputed edges is also reported.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Biology and Bioinformatics
Published
2025-09-12
DOI
https://doi.org/10.1109/tcbbio.2025.3609315
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Link Prediction in Multipartite Graphs With Application to Drug Repositioning Studies

Michael A. Langston, Levente Dojcsak, Sally R. Ellingson, Stephen K. Grady et al.
IEEE Transactions on Computational Biology and Bioinformatics
Computational Drug Discovery Methods
article

Link Prediction in Multipartite Graphs With Application to Drug Repositioning Studies

Michael A. Langston, Levente Dojcsak, Sally R. Ellingson, Stephen K. Grady, Cheng Chen
article en

Abstract

Developing new ethical drugs is exceedingly expensive in terms of both time and resources. A single drug can take up to a decade to bring to market, with costs soaring to over a billion dollars. Drug repositioning has thus become an attractive alternative to the development of new compounds, with growing interest in the use of in silico repositioning predictions. Bipartite graphs and efficient biclique enumeration algorithms can be used to study drug-protein or other pairwise crucial interactions. Extensions of this approach to datasets with three or more divergent data types have been hobbled, however, by a lack of effective analytics. To address this shortcoming, a highly innovative and efficient graph theoretical technique is introduced to impute potential edges (links) in an arbitrary multipartite graph. The utility of this method is demonstrated on five tripartite graphs, each comprised of three partite sets, one each for diseases, drugs, and gene products of interest, and with interpartite edges denoting known interactions or associations. Evidence for the reliability of imputed edges is also reported.

IEEE Transactions on Computational Biology and BioinformaticsVol. 22(6)
University of Kentucky (US), University of Tennessee at Knoxville (US)
Openalex Percentile: Top 74%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.