The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Improving compound–protein interaction prediction by building up highly credible negative samples
Open accessAbstract
Motivation: Computational prediction of compound–protein interactions (CPIs) is of great importance for drug design and development, as genome-scale experimental validation of CPIs is not only time-consuming but also prohibitively expensive. With the availability of an increasing number of validated interactions, the performance of computational prediction approaches is severely impended by the lack of reliable negative CPI samples. A systematic method of screening reliable negative sample becomes critical to improving the performance of in silico prediction methods. Results: This article aims at building up a set of highly credible negative samples of CPIs via an in silico screening method. As most existing computational models assume that similar compounds are likely to interact with similar target proteins and achieve remarkable performance, it is rational to identify potential negative samples based on the converse negative proposition that the proteins dissimilar to every known/predicted target of a compound are not much likely to be targeted by the compound and vice versa. We integrated various resources, including chemical structures, chemical expression profiles and side effects of compounds, amino acid sequences, protein–protein interaction network and functional annotations of proteins, into a systematic screening framework. We first tested the screened negative samples on six classical classifiers, and all these classifiers achieved remarkably higher performance on our negative samples than on randomly generated negative samples for both human and Caenorhabditis elegans. We then verified the negative samples on three existing prediction models, including bipartite local model, Gaussian kernel profile and Bayesian matrix factorization, and found that the performances of these models are also significantly improved on the screened negative samples. Moreover, we validated the screened negative samples on a drug bioactivity dataset. Finally, we derived two sets of new interactions by training an support vector machine classifier on the positive interactions annotated in DrugBank and our screened negative interactions. The screened negative samples and the predicted interactions provide the research community with a useful resource for identifying new drug targets and a helpful supplement to the current curated compound–protein databases. Availability: Supplementary files are available at: http://admis.fudan.edu.cn/negative-cpi/. Contact: sgzhou@fudan.edu.cn Supplementary Information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gene Ontology: tool for the unification of biology
Ashburner, M., Ball, C. A., Blake, J. A., Botstein, D., Butler, H., Cherry, J. M., Davis, A. P., Dolinski, K., Dwight, S. S., Eppig, J. T., et al. (2000) · Nature Genetics · doi:10.1038/75556 · Cited by 43,206
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Systematic and integrative analysis of large gene lists using DAVID bioinformatics resources
Huang, D. W., Sherman, B. T., & Lempicki, R. A. (2009) · Nature Protocols · doi:10.1038/nprot.2008.211 · Cited by 35,890
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
Database resources of the National Center for Biotechnology Information: update
Wheeler, D. L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh073 · Cited by 10,641
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Lamb, J., Crawford, E. D., Peck, D., Modell, J. W., Blat, I. C., Wrobel, M. J., Lerner, J., Brunet, J.-P., Subramanian, A., Ross, K. N., et al. (2006) · Science · doi:10.1126/science.1132939 · Cited by 5,257
STRING v9.1: protein-protein interaction networks, with increased coverage and integration
Franceschini, A., Szklarczyk, D., Frankild, S., Kuhn, M., Simonovic, M., Roth, A., Lin, J., Minguez, P., Bork, P., von Mering, C., et al. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks1094 · Cited by 4,398
The Pfam protein families database
Punta, M., Coggill, P. C., Eberhardt, R. Y., Mistry, J., Tate, J., Boursnell, C., Pang, N., Forslund, K., Ceric, G., Clements, J., et al. (2012) · Nucleic Acids Research · doi:10.1093/nar/gkr1065 · Cited by 3,719
Cited by
Tsubaki, M., Tomii, K., & Sese, J. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty535 · Cited by 688
“elegans dataset) performance compared to other methods: k-NN, random forest (RF), L2-logistic (L2) and SVM, which the results are obtain in Liu et al. (2015) and the experimental”
Lee, I., Keum, J., & Nam, H. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1007129 · Cited by 675
Chen, L., Tan, X., Wang, D., Zhong, F., Liu, X., Yang, T., Luo, X., Chen, K., Jiang, H., & Zheng, M. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa524 · Cited by 607
Rifaioglu, A. S., Atas, H., Martin, M. J., Cetin-Atalay, R., Atalay, V., & Doğan, T. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bby061 · Cited by 529
Machine learning approaches and databases for prediction of drug–target interaction: a survey paper
Bagherian, M., Sabeti, E., Wang, K., Sartor, M. A., Nikolovska-Coleska, Z., & Najarian, K. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbz157 · Cited by 429
Interpretable bilinear attention network with domain adaptation improves drug–target prediction
Bai, P., Miljković, F., John, B., & Lu, H. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-022-00605-1 · Cited by 362
In silico methods for drug repurposing and pharmacology
Hodos, R. A., Kidd, B. A., Shameer, K., Readhead, B. P., & Dudley, J. T. (2016) · WIREs Systems Biology and Medicine · doi:10.1002/wsbm.1337 · Cited by 326
Ezzat, A., Wu, M., Li, X.-L., & Kwoh, C.-K. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bby002 · Cited by 314
Predicting drug–protein interaction using quasi-visual question answering system
Zheng, S., Li, Y., Chen, S., Xu, J., & Yang, Y. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0152-y · Cited by 311
Design of efficient computational workflows for in silico drug repurposing
Vanhaelen, Q., Mamoshina, P., Aliper, A. M., Artemov, A., Lezhnina, K., Ozerov, I., Labat, I., & Zhavoronkov, A. (2017) · Drug Discovery Today · doi:10.1016/j.drudis.2016.09.019 · Cited by 150
(2024) · doi:10.1038/s42256-024-00847-1 · Cited by 108
GraphCPI: Graph Neural Representation Learning for Compound-Protein Interaction
Quan, Z., Guo, Y., Lin, X., Wang, Z.-J., & Zeng, X. (2019) · 2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm47256.2019.8983267 · Cited by 35
Benchmarking compound activity prediction for real-world drug discovery applications
(2024) · doi:10.1038/s42004-024-01204-4 · Cited by 34
Zhao, M., Yuan, M., Yang, Y., & Xu, S. X. (2023) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2022.3225296 · Cited by 22
Zhang, P., Ma, J., & Chen, T. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3576488 · Cited by 13
LIGHTHOUSE illuminates therapeutics for a variety of diseases including COVID-19
(2022) · doi:10.1016/j.isci.2022.105314 · Cited by 9
Zhang, Z., He, X., Long, D., Luo, G., & Chen, S. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae240 · Cited by 8
BioStructNet: Structure-Based Network with Transfer Learning for Predicting Biocatalyst Functions
Wang, X., Zhou, J., Mueller, J., Quinn, D., Carvalho, A., Moody, T. S., & Huang, M. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01391 · Cited by 7
Metadata
- Authors
- Liu, H., Sun, J., Guan, J., Zheng, J., & Zhou, S.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-06-10
- Volume
- 31
- Issue
- 12
- Pages
- i221-i229
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2148145769
- Cited by
- 359
- References
- 57
- FWCI
- 9.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
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.