The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Computational drug repositioning using low-rank matrix approximation and randomized algorithms
Abstract
Motivation: Computational drug repositioning is an important and efficient approach towards identifying novel treatments for diseases in drug discovery. The emergence of large-scale, heterogeneous biological and biomedical datasets has provided an unprecedented opportunity for developing computational drug repositioning methods. The drug repositioning problem can be modeled as a recommendation system that recommends novel treatments based on known drug–disease associations. The formulation under this recommendation system is matrix completion, assuming that the hidden factors contributing to drug–disease associations are highly correlated and thus the corresponding data matrix is low-rank. Under this assumption, the matrix completion algorithm fills out the unknown entries in the drug–disease matrix by constructing a low-rank matrix approximation, where new drug–disease associations having not been validated can be screened. Results: In this work, we propose a drug repositioning recommendation system (DRRS) to predict novel drug indications by integrating related data sources and validated information of drugs and diseases. Firstly, we construct a heterogeneous drug–disease interaction network by integrating drug–drug, disease–disease and drug–disease networks. The heterogeneous network is represented by a large drug–disease adjacency matrix, whose entries include drug pairs, disease pairs, known drug–disease interaction pairs and unknown drug–disease pairs. Then, we adopt a fast Singular Value Thresholding (SVT) algorithm to complete the drug–disease adjacency matrix with predicted scores for unknown drug–disease pairs. The comprehensive experimental results show that DRRS improves the prediction accuracy compared with the other state-of-the-art approaches. In addition, case studies for several selected drugs further demonstrate the practical usefulness of the proposed method. Availability and implementation: http://bioinformatics.csu.edu.cn/resources/softs/DrugRepositioning/DRRS/index.html Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
DrugBank: a comprehensive resource for in silico drug discovery and exploration
Wishart, D. S. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj067 · Cited by 3,892
Online Mendelian Inheritance in Man (OMIM), a knowledgebase of human genes and genetic disorders
Hamosh, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki033 · Cited by 3,420
Data, information, knowledge and principle: back to metabolism in KEGG
Kanehisa, M., Goto, S., Sato, Y., Kawashima, M., Furumichi, M., & Tanabe, M. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1076 · Cited by 3,092
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Walking the Interactome for Prioritization of Candidate Disease Genes
Köhler, S., Bauer, S., Horn, D., & Robinson, P. N. (2008) · The American Journal of Human Genetics · doi:10.1016/j.ajhg.2008.02.013 · Cited by 1,258
The Chemistry Development Kit (CDK): An Open-Source Java Library for Chemo- and Bioinformatics
Steinbeck, C., Han, Y., Kuhn, S., Horlacher, O., Luttmann, E., & Willighagen, E. (2003) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci025584y · Cited by 1,108
Cited by
Artificial intelligence to deep learning: machine intelligence approach for drug discovery
Gupta, R., Srivastava, D., Sahu, M., Tiwari, S., Ambasta, R. K., & Kumar, P. (2021) · Molecular Diversity · doi:10.1007/s11030-021-10217-3 · Cited by 1,473
“…DPDR-CPI (http:// cpi. bio-x. cn/ dpdr/) [276], PHARMGKB (https:// www. pharm gkb. org/) [277], PRO-MISCUOUS 2.0 (http:// bioin forma tics. chari te. de/ promi scuou s2) [278], and DRRS (http:// bioin forma tics. csu. edu. cn/ resou rces/ softs/ DrugR eposi tioni ng/ DRRS/ index. html) [279].”
InfluentialMicroRNAs and complex diseases: from experimental results to computational models
Chen, X., Xie, D., Zhao, Q., & You, Z.-H. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bbx130 · Cited by 638
Artificial intelligence in cancer target identification and drug discovery
You, Y., Lai, X., Pan, Y., Zheng, H., Vera, J., Liu, S., Deng, S., & Zhang, L. (2022) · Signal Transduction and Targeted Therapy · doi:10.1038/s41392-022-00994-0 · Cited by 435
Wang, R., Li, S., Cheng, L., Wong, M. H., & Leung, K. S. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-3283-6 · Cited by 37
Metadata
- Authors
- Luo, H., Li, M., Wang, S., Liu, Q., Li, Y., & Wang, J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2018-01-22
- Volume
- 34
- Issue
- 11
- Pages
- 1904-1912
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2790385355
- Cited by
- 264
- References
- 33
- FWCI
- 20.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational drug repositioning using low-rank matrix approximation and randomized algorithms. https://app.cochat.ai/papers/10.1093/bioinformatics/bty013
- The paper
- Luo, H., Li, M., Wang, S., Liu, Q., Li, Y., & Wang, J. (2018). Computational drug repositioning using low-rank matrix approximation and randomized algorithms. Bioinformatics. https://doi.org/10.1093/bioinformatics/bty013
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.