Predicting essential proteins is crucial for identifying disease-causing genes and advancing drug discovery. However, existing methods face challenges, such as insufficient capture of biological properties, class imbalance, incomplete representation of network topology, and inadequate utilization of edge features. To address these limitations, we propose a novel model, GTLSTMEP, which combines Graph Transformer (GT) and Bidirectional Long Short-Term Memory (bi-LSTM). GTLSTMEP leverages biological data-including subcellular localization, protein complexes, and gene expression profiles-to initialize node and edge features. A subgraph batch sampling approach is employed to handle class imbalance. The bi-LSTM module processes time-series gene expression data, while the GT module captures global topological features using Laplacian positional encodings and local topological features through an attention mechanism that automatically identifies neighboring nodes' characteristics. Additionally, edge features are integrated to enhance the learning of protein interactions. The node features extracted from these two modules are then fed into a Multi-Layer Perceptron (MLP) for essential protein prediction. Experimental results demonstrate that GTLSTMEP outperforms all comparative methods. For instance, on the DIP dataset, GTLSTMEP achieves an $AUC$ that is 17.64% higher than the next-best model. Ablation studies further confirm the effectiveness of each component of GTLSTMEP.

Despite the widespread deployment of terrestrial networks, providing reliable communication services to remote areas and maintaining connectivity during emergencies remains challenging. Low Earth orbit (LEO) satellite constellations offer promising solutions with their global coverage capabilities and reduced latency, yet struggle with intermittent coverage and limited communication windows due to orbital dynamics. This paper introduces an age of information (AoI)-aware space-air-ground integrated network (SAGIN) architecture that leverages a high-altitude platform (HAP) as intelligent relay between the LEO satellites and ground terminals. Our three-layer design employs hybrid free-space optical (FSO) links for high-capacity satellite-to-HAP communication and reliable radio frequency (RF) links for HAP-to-ground transmission, and thus addressing the temporal discontinuity in LEO satellite coverage while serving diverse user priorities. Specifically, we formulate a joint optimization problem to simultaneously minimize the AoI and satellite handover frequency through optimal transmit power distribution and satellite selection decisions. This highly dynamic, non-convex problem with time-coupled constraints presents significant computational challenges for traditional approaches. To address these difficulties, we propose a novel diffusion model (DM)-enhanced dueling double deep Q-network withaction decomposition andstate transformer encoder (DD3QN-AS) algorithm that incorporates transformer-based temporal feature extraction and employs a DM-based latent prompt generative module to refine state-action representations through conditional denoising. Simulation results highlight the superior performance of the proposed approach compared with policy-based methods and some other deep reinforcement learning (DRL) benchmarks. Moreover, performance analysis under various system settings verifies the robustness of the proposed approach.

This paper proposes a UAV-assisted forwarding system based on distributed beamforming to enhance age of information (AoI) in Internet of Things (IoT). Specifically, UAVs collect and relay data between sensor nodes (SNs) and the remote base station (BS). However, flight delays increase the AoI and degrade the network performance. To mitigate this, we adopt distributed beamforming to extend the communication range, reduce the flight frequency and ensure the continuous data relay and efficient energy utilization. Then, we formulate an optimization problem to minimize AoI and UAV energy consumption, by jointly optimizing the UAV trajectories and communication schedules. The problem is non-convex and with high dynamic, and thus we propose a deep reinforcement learning (DRL)-based algorithm to solve the problem, thereby enhancing the stability and accelerate convergence speed. Simulation results show that the proposed algorithm effectively addresses the problem and outperforms other benchmark algorithms.

RNA interference (RNAi) is a technique for precisely silencing the expression of specific genes by means of small RNA molecules and is essential in functional genomics. Among the commonly used RNAi molecules, short hairpin RNAs (shRNAs) exhibit advantages over small interfering RNAs, including longer half-life, comparable silencing efficiency, fewer off-target effects, and greater safety. However, traditional screening of potent shRNAs is costly and time-consuming. Advances in big data and artificial intelligence have enabled computational methods to significantly accelerate shRNA design and prediction. In this study, we propose BBANsh, a new shRNA prediction model based on bidirectional encoder representation from transformers (BERT) and bilinear attention network (BAN). We comprehensively evaluate the performance of BBANsh against traditional feature-based models, various feature fusion methods, and existing shRNA prediction models. The BBANsh has achieved an area under the precision-recall curve of 0.951 on five-cross validation and a prediction accuracy of 0.896 on a new external validation set, highlighting its superior predictive performance. Ablation experiments validate the significant contributions of BERT and BAN to model performance. The visualization of internal feature representations intuitively demonstrates the effectiveness of the feature fusion strategy of BBANsh. Furthermore, the attentional analysis reveals that nucleotides near the 5' end have the greatest impact on model predictions, highlighting sequence characteristics of potent shRNAs. Overall, BBANsh provides an efficient and reliable tool for shRNA prediction, which can offer valuable support for researchers in the precise selection and design of shRNA.

BACKGROUND: Predicting and studying essential proteins not only helps to understand the fundamental requirements for cell survival and growth regulation mechanisms but also deepens our understanding of disease mechanisms and drives drug development. Existing methods for identifying essential proteins primarily focus on PPI networks within a single species, without fully exploiting interspecies homologous relationships. These homologous relationships connect proteins from different species, forming multilayer PPI networks. Some methods only construct interlayer edges based on homologous relationships between two species, without incorporating appropriate biological attributes to assess the biological significance of these edges. Furthermore, homologous proteins are often highly conserved across multiple species, and expanding homologous relationships to more species allows for a more accurate assessment of interlayer edge importance. RESULTS: To address these issues, we propose a novel model, MLPR, which constructs a multilayer PPI network based on homologous proteins and integrates multiple PageRank algorithms to identify essential proteins. This study combines homologous protein data from three species to construct interlayer transition matrices and assigns weights to interlayer edges by integrating the biological attributes of homologous proteins and cross-species GO annotations. The MLPR model uses multiple PageRank methods to comprehensively consider homologous relationships across species and designs three key parameters to find the optimal combination that balances random walks within layers, global jumps, interlayer biases, and interspecies homologous relationships. CONCLUSIONS: Experimental results show that MLPR outperforms other state-of-the-art methods in terms of performance. Ablation experiments further validate that integrating homologous relationships across three species effectively enhances the overall performance of MLPR and demonstrates the advantages of the multiple PageRank model in identifying essential proteins.

Antibacterial peptides (ABPs) are a promising strategy to combat antimicrobial resistance. We constructed a comprehensive database named AntiBacterial Peptides DataBase (ABPDB) by collecting and integrating existing ABP databases. Specifically, ABPDB includes 4,872 ABPs and their sequence information, activity information, physicochemical properties and structural information. Three-dimensional structures of ABPs were predicted using AlphaFold2. In addition, we provided a service that allows users to find peptides that are structurally similar to a specific peptide. ABPDB provides user-friendly interfaces for searching, downloading and further analyzing, and is freely available at http://www.acdb.plus/ABPDB.

Alzheimer's disease (AD) is progressive and gets worse with time. Early detection is an effective treatment for the disease, which can timely implement effective interventions. The multi-modal medical image contains more comprehensive and abundant information about the disease, which can reflect the different aspects of AD and reduce the potential bias in single-modal diagnosis. However, an effective and reliable solution is still lacking, which can integrate multimodal neuroimaging effectively for the precision diagnosis and treatment of AD. In this work, we proposed a feature representation and fusion model of MRI and PET scans based on a multiscale convolution network and cross-attention for AD early diagnosis, named camAD. Compared with the existing models, camAD performs better with fewer pre-processing steps. Using the Alzheimer’s disease neuroimaging initiative (ADNI) datasets, we demonstrated that integrating multi-modality data outperforms single-modality models in accuracy, specificity, sensitivity, AUC, and F1 scores. Our models exhibited significantly good accuracy and generality in four classification tasks, which provided a promising way to understand the underlying mechanisms of the disorder's progression.

Peptide drugs have demonstrated enormous potential in treating a variety of diseases, yet toxicity prediction remains a significant challenge in drug development. Existing models for prediction of peptide toxicity largely rely on sequence information and often neglect the three-dimensional (3D) structures of peptides. This study introduced a novel model for short peptide toxicity prediction, named ToxGIN. The model utilizes Graph Isomorphism Network (GIN), integrating the underlying amino acid sequence composition and the 3D structures of peptides. ToxGIN comprises three primary modules: (i) Sequence processing module, converting peptide 3D structures and sequences into information of nodes and edges; (ii) Feature extraction module, utilizing GIN to learn discriminative features from nodes and edges; (iii) Classification module, employing a fully connected classifier for toxicity prediction. ToxGIN performed well on the independent test set with F1 score = 0.83, AUROC = 0.91, and Matthews correlation coefficient = 0.68, better than existing models for prediction of peptide toxicity. These results validated the effectiveness of integrating 3D structural information with sequence data using GIN for peptide toxicity prediction. The proposed ToxGIN and data can be freely accessible at https://github.com/cihebiyql/ToxGIN.

Metabolic processes can transform a drug into metabolites with different properties that may affect its efficacy and safety. Therefore, investigation of the metabolic fate of a drug candidate is of great significance for drug discovery. Computational methods have been developed to predict drug metabolites, but most of them suffer from two main obstacles: the lack of model generalization due to restrictions on metabolic transformation rules or specific enzyme families, and high rate of false-positive predictions. Here, we presented MetaPredictor, a rule-free, end-to-end and prompt-based method to predict possible human metabolites of small molecules including drugs as a sequence translation problem. We innovatively introduced prompt engineering into deep language models to enrich domain knowledge and guide decision-making. The results showed that using prompts that specify the sites of metabolism (SoMs) can steer the model to propose more accurate metabolite predictions, achieving a 30.4% increase in recall and a 16.8% reduction in false positives over the baseline model. The transfer learning strategy was also utilized to tackle the limited availability of metabolic data. For the adaptation to automatic or non-expert prediction, MetaPredictor was designed as a two-stage schema consisting of automatic identification of SoMs followed by metabolite prediction. Compared to four available drug metabolite prediction tools, our method showed comparable performance on the major enzyme families and better generalization that could additionally identify metabolites catalyzed by less common enzymes. The results indicated that MetaPredictor could provide a more comprehensive and accurate prediction of drug metabolism through the effective combination of transfer learning and prompt-based learning strategies.

Qualitative or quantitative prediction models of structure-activity relationships based on graph neural networks (GNNs) are prevalent in drug discovery applications and commonly have excellently predictive power. However, the network information flows of GNNs are highly complex and accompanied by poor interpretability. Unfortunately, there are relatively less studies on GNN attributions, and their developments in drug research are still at the early stages. In this work, we adopted several advanced attribution techniques for different GNN frameworks and applied them to explain multiple drug molecule property prediction tasks, enabling the identification and visualization of vital chemical information in the networks. Additionally, we evaluated them quantitatively with attribution metrics such as accuracy, sparsity, fidelity and infidelity, stability and sensitivity; discussed their applicability and limitations; and provided an open-source benchmark platform for researchers. The results showed that all attribution techniques were effective, while those directly related to the predicted labels, such as integrated gradient, preferred to have better attribution performance. These attribution techniques we have implemented could be directly used for the vast majority of chemical GNN interpretation tasks.

BACKGROUND: The identification of essential proteins is of great significance in biology and pathology. However, protein-protein interaction (PPI) data obtained through high-throughput technology include a high number of false positives. To overcome this limitation, numerous computational algorithms based on biological characteristics and topological features have been proposed to identify essential proteins. RESULTS: In this paper, we propose a novel method named SESN for identifying essential proteins. It is a seed expansion method based on PPI sub-networks and multiple biological characteristics. Firstly, SESN utilizes gene expression data to construct PPI sub-networks. Secondly, seed expansion is performed simultaneously in each sub-network, and the expansion process is based on the topological features of predicted essential proteins. Thirdly, the error correction mechanism is based on multiple biological characteristics and the entire PPI network. Finally, SESN analyzes the impact of each biological characteristic, including protein complex, gene expression data, GO annotations, and subcellular localization, and adopts the biological data with the best experimental results. The output of SESN is a set of predicted essential proteins. CONCLUSIONS: The analysis of each component of SESN indicates the effectiveness of all components. We conduct comparison experiments using three datasets from two species, and the experimental results demonstrate that SESN achieves superior performance compared to other methods.

Antimicrobial resistance is a global public health concern. The lack of innovations in antibiotic development has led to renewed interest in antibiotic adjuvants. However, there is no database to collect antibiotic adjuvants. Herein, we build a comprehensive database named Antibiotic Adjuvant DataBase (AADB) by manually collecting relevant literature. Specifically, AADB includes 3,035 combinations of antibiotics with adjuvants, covering 83 antibiotics, 226 adjuvants, and 325 bacterial strains. AADB provides user-friendly interfaces for searching and downloading. Users can easily obtain these datasets for further analysis. In addition, we also collected related datasets (e.g., chemogenomic and metabolomic data) and proposed a computational strategy to dissect these datasets. As a test case, we identified 10 candidates for minocycline, and 6 of 10 candidates are the known adjuvants that synergize with minocycline to inhibit the growth of E. coli BW25113. We hope that AADB can help users to identify effective antibiotic adjuvants. AADB is freely available at http://www.acdb.plus/AADB.

Antibiotic combination is a promising strategy to extend the lifetime of antibiotics and thereby combat antimicrobial resistance. However, screening for new antibiotic combinations is both time-consuming and labor-intensive. In recent years, an increasing number of researchers have used computational models to predict effective antibiotic combinations. In this review, we summarized existing computational models for antibiotic combinations and discussed the limitations and challenges of these models in detail. In addition, we also collected and summarized available data resources and tools for antibiotic combinations. This study aims to help computational biologists design more accurate and interpretable computational models.

Nuclear receptors (NRs) are ligand-activated transcription factors, which constitute one of the most important targets for drug discovery. Current computational strategies mainly focus on a single target, and the transfer of learned knowledge among NRs was not considered yet. Herein we proposed a novel computational framework named NR-Profiler for prediction of potential NR modulators with high affinity and specificity. First, we built a comprehensive NR data set including 42 684 interactions to connect 42 NRs and 31 033 compounds. Then, we used multi-task deep neural network and multi-task graph convolutional neural network architectures to construct multi-task multi-classification models. To improve the predictive capability and robustness, we built a consensus model with an area under the receiver operating characteristic curve (AUC) = 0.883. Compared with conventional machine learning and structure-based approaches, the consensus model showed better performance in external validation. Using this consensus model, we demonstrated the practical value of NR-Profiler in virtual screening for NRs. In addition, we designed a selectivity score to quantitatively measure the specificity of NR modulators. Finally, we developed a freely available standalone software for users to make profiling predictions for their compounds of interest. In summary, our NR-Profiler provides a useful tool for NR-profiling prediction and is expected to facilitate NR-based drug discovery.

Identification of adverse drug events (ADEs) is crucial to reduce human health risks and improve drug safety assessment. With an increasing number of biological and medical data, computational methods such as network-based methods were proposed for ADE prediction with high efficiency and low cost. However, previous network-based methods rely on the topological information of known drug-ADE networks, and hence cannot make predictions for novel compounds without any known ADE. In this study, we introduced chemical substructures to bridge the gap between the drug-ADE network and novel compounds, and developed a novel network-based method named ADENet, which can predict potential ADEs for not only drugs within the drug-ADE network, but also novel compounds outside the network. To show the performance of ADENet, we collected drug-ADE associations from a comprehensive database named MetaADEDB and constructed a series of network-based prediction models. These models obtained high area under the receiver operating characteristic curve values ranging from 0.871 to 0.947 in 10-fold cross-validation. The best model further showed high performance in external validation, which outperformed a previous network-based and a recent deep learning-based method. Using several approved drugs as case studies, we found that 32-54% of the predicted ADEs can be validated by the literature, indicating the practical value of ADENet. Moreover, ADENet is freely available at our web server named NetInfer (http://lmmd.ecust.edu.cn/netinfer). In summary, our method would provide a promising tool for ADE prediction and drug safety assessment in drug discovery and development.

Medical image registration is a fundamental and critical task in medical image analysis. With the rapid development of deep learning , convolutional neural networks (CNNs) have dominated the medical image registration field. Due to the disadvantage of the local receptive field of CNNs, some recent registration methods have focused on using transformers for nonlocal registration. However, the standard transformer has a vast number of parameters and high computational complexity, which means that it can only be applied at the bottom of registration models . As a result, only coarse information is available at the lowest resolution, limiting the contribution of the transformer in these models. To address these challenges, we propose a convolution-based efficient multihead self-attention (CEMSA) block, which reduces the number of parameters of the traditional transformer and captures local spatial context information to reduce semantic ambiguity in the attention mechanism. Based on the proposed CEMSA, we present a novel symmetric transformer-based model (SymTrans). SymTrans employs the transformer blocks in the encoder and the decoder to model the long-range spatial cross-image relevance. We apply SymTrans to the displacement field and diffeomorphic registration. Experimental results show that our proposed method achieves state-of-the-art performance in image registration. Our code is publicly available at https://github.com/MingR-Ma/SymTrans .

Drug discovery and development is a time-consuming and costly process. Therefore, drug repositioning has become an effective approach to address the issues by identifying new therapeutic or pharmacological actions for existing drugs. The drug's anatomical therapeutic chemical (ATC) code is a hierarchical classification system categorized as five levels according to the organs or systems that drugs act and the pharmacology, therapeutic and chemical properties of drugs. The 2nd-, 3rd- and 4th-level ATC codes reserved the therapeutic and pharmacological information of drugs. With the hypothesis that drugs with similar structures or targets would possess similar ATC codes, we exploited a network-based approach to predict the 2nd-, 3rd- and 4th-level ATC codes by constructing substructure drug-ATC (SD-ATC), target drug-ATC (TD-ATC) and Substructure&Target drug-ATC (STD-ATC) networks. After 10-fold cross validation and two external validations, the STD-ATC models outperformed the SD-ATC and TD-ATC ones. Furthermore, with KR as fingerprint, the STD-ATC model was identified as the optimal model with AUC values at 0.899 ± 0.015, 0.916 and 0.893 for 10-fold cross validation, external validation set 1 and external validation set 2, respectively. To illustrate the predictive capability of the STD-ATC model with KR fingerprint, as a case study, we predicted 25 FDA-approved drugs (22 drugs were actually purchased) to have potential activities on heart failure using that model. Experiments in vitro confirmed that 8 of the 22 old drugs have shown mild to potent cardioprotective activities on both hypoxia model and oxygen-glucose deprivation model, which demonstrated that our STD-ATC prediction model would be an effective tool for drug repositioning.

SUMMARY: MetaADEDB is an online database we developed to integrate comprehensive information on adverse drug events (ADEs). The first version of MetaADEDB was released in 2013 and has been widely used by researchers. However, it has not been updated for more than seven years. Here, we reported its second version by collecting more and newer data from the U.S. FDA Adverse Event Reporting System (FAERS) and Canada Vigilance Adverse Reaction Online Database, in addition to the original three sources. The new version consists of 744 709 drug-ADE associations between 8498 drugs and 13 193 ADEs, which has an over 40% increase in drug-ADE associations compared to the previous version. Meanwhile, we developed a new and user-friendly web interface for data search and analysis. We hope that MetaADEDB 2.0 could provide a useful tool for drug safety assessment and related studies in drug discovery and development. AVAILABILITY AND IMPLEMENTATION: The database is freely available at: http://lmmd.ecust.edu.cn/metaadedb/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

SUMMARY: admetSAR was developed as a comprehensive source and free tool for the prediction of chemical ADMET properties. Since its first release in 2012 containing 27 predictive models, admetSAR has been widely used in chemical and pharmaceutical fields. This update, admetSAR 2.0, focuses on extension and optimization of existing models with significant quantity and quality improvement on training data. Now 47 models are available for either drug discovery or environmental risk assessment. In addition, we added a new module named ADMETopt for lead optimization based on predicted ADMET properties. AVAILABILITY AND IMPLEMENTATION: Free available on the web at http://lmmd.ecust.edu.cn/admetsar2/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

BACKGROUND: Protein complex identification from protein-protein interaction (PPI) networks is crucial for understanding cellular organization principles and functional mechanisms. In recent decades, numerous computational methods have been proposed to identify protein complexes. However, most of the current state-of-the-art studies still have some challenges to resolve, including their high false-positives rates, incapability of identifying overlapping complexes, lack of consideration for the inherent organization within protein complexes, and absence of some biological attachment proteins. RESULTS: In this paper, to overcome these limitations, we present a protein complex identification method based on an edge weight method and core-attachment structure (EWCA) which consists of a complex core and some sparse attachment proteins. First, we propose a new weighting method to assess the reliability of interactions. Second, we identify protein complex cores by using the structural similarity between a seed and its direct neighbors. Third, we introduce a new method to detect attachment proteins that is able to distinguish and identify peripheral proteins and overlapping proteins. Finally, we bind attachment proteins to their corresponding complex cores to form protein complexes and discard redundant protein complexes. The experimental results indicate that EWCA outperforms existing state-of-the-art methods in terms of both accuracy and p-value. Furthermore, EWCA could identify many more protein complexes with statistical significance. Additionally, EWCA could have better balance accuracy and efficiency than some state-of-the-art methods with high accuracy. CONCLUSIONS: In summary, EWCA has better performance for protein complex identification by a comprehensive comparison with twelve algorithms in terms of different evaluation metrics. The datasets and software are freely available for academic research at https://github.com/RongquanWang/EWCA .

BACKGROUND: Prioritizing genes according to their associations with a cancer allows researchers to explore genes in more informed ways. By far, Gene-centric or network-centric gene prioritization methods are predominated. Genes and their protein products carry out cellular processes in the context of functional modules. Dysfunctional gene modules have been previously reported to have associations with cancer. However, gene module information has seldom been considered in cancer-related gene prioritization. RESULTS: In this study, we propose a novel method, MGOGP (Module and Gene Ontology-based Gene Prioritization), for cancer-related gene prioritization. Different from other methods, MGOGP ranks genes considering information of both individual genes and their affiliated modules, and utilize Gene Ontology (GO) based fuzzy measure value as well as known cancer-related genes as heuristics. The performance of the proposed method is comprehensively validated by using both breast cancer and prostate cancer datasets, and by comparison with other methods. Results show that MGOGP outperforms other methods, and successfully prioritizes more genes with literature confirmed evidence. CONCLUSIONS: This work will aid researchers in the understanding of the genetic architecture of complex diseases, and improve the accuracy of diagnosis and the effectiveness of therapy.

BACKGROUND: In recent decades, detecting protein complexes (PCs) from protein-protein interaction networks (PPINs) has been an active area of research. There are a large number of excellent graph clustering methods that work very well for identifying PCs. However, most of existing methods usually overlook the inherent core-attachment organization of PCs. Therefore, these methods have three major limitations we should concern. Firstly, many methods have ignored the importance of selecting seed, especially without considering the impact of overlapping nodes as seed nodes. Thus, there may be false predictions. Secondly, PCs are generally supposed to be dense subgraphs. However, the subgraphs with high local modularity structure usually correspond to PCs. Thirdly, a number of available methods lack handling noise mechanism, and miss some peripheral proteins. In summary, all these challenging issues are very important for predicting more biological overlapping PCs. RESULTS: In this paper, to overcome these weaknesses, we propose a clustering method by core-attachment and local modularity structure, named CALM, to detect overlapping PCs from weighted PPINs with noises. Firstly, we identify overlapping nodes and seed nodes. Secondly, for a node, we calculate the support function between a node and a cluster. In CALM, a cluster which initially consists of only a seed node, is extended by adding its direct neighboring nodes recursively according to the support function, until this cluster forms a locally optimal modularity subgraph. Thirdly, we repeat this process for the remaining seed nodes. Finally, merging and removing procedures are carried out to obtain final predicted clusters. The experimental results show that CALM outperforms other classical methods, and achieves ideal overall performance. Furthermore, CALM can match more complexes with a higher accuracy and provide a better one-to-one mapping with reference complexes in all test datasets. Additionally, CALM is robust against the high rate of noise PPIN. CONCLUSIONS: By considering core-attachment and local modularity structure, CALM could detect PCs much more effectively than some representative methods. In short, CALM could potentially identify previous undiscovered overlapping PCs with various density and high modularity.

Prioritizing genes according to their association with a disease allows researchers to explore genes in more informed ways. Although some useful algorithms have been developed, they are based on single gene importance, gene interaction networks, or gene modules with little consideration of relative gene importance in the context of modules. In this paper, we propose to prioritize genes considering both individual genes and their affiliated modules, and utilize Gene Ontology (GO) based fuzzy measure value as well as known disease genes as heuristics. The performance of our method is comprehensively validated by using both simulated and real datasets. Results show that our method outperforms other methods in terms of disease-related gene prioritization. This work will aid researchers in the understanding of the genetic architecture of complex diseases, and improve the accuracy of diagnosis and the effectiveness of therapy.

Computational prediction of drug-target interactions (DTIs) and drug repositioning provides a low-cost and high-efficiency approach for drug discovery and development. The traditional social network-derived methods based on the naïve DTI topology information cannot predict potential targets for new chemical entities or failed drugs in clinical trials. There are currently millions of commercially available molecules with biologically relevant representations in chemical databases. It is urgent to develop novel computational approaches to predict targets for new chemical entities and failed drugs on a large scale. In this study, we developed a useful tool, namely substructure-drug-target network-based inference (SDTNBI), to prioritize potential targets for old drugs, failed drugs and new chemical entities. SDTNBI incorporates network and chemoinformatics to bridge the gap between new chemical entities and known DTI network. High performance was yielded in 10-fold and leave-one-out cross validations using four benchmark data sets, covering G protein-coupled receptors, kinases, ion channels and nuclear receptors. Furthermore, the highest areas under the receiver operating characteristic curve were 0.797 and 0.863 for two external validation sets, respectively. Finally, we identified thousands of new potential DTIs via implementing SDTNBI on a global network. As a proof-of-principle, we showcased the use of SDTNBI to identify novel anticancer indications for nonsteroidal anti-inflammatory drugs by inhibiting AKR1C3, CA9 or CA12. In summary, SDTNBI is a powerful network-based approach that predicts potential targets for new chemical entities on a large scale and will provide a new tool for DTI prediction and drug repositioning. The program and predicted DTIs are available on request.

Drug-target interaction (DTI) is the basis of drug discovery and design. It is time consuming and costly to determine DTI experimentally. Hence, it is necessary to develop computational methods for the prediction of potential DTI. Based on complex network theory, three supervised inference methods were developed here to predict DTI and used for drug repositioning, namely drug-based similarity inference (DBSI), target-based similarity inference (TBSI) and network-based inference (NBI). Among them, NBI performed best on four benchmark data sets. Then a drug-target network was created with NBI based on 12,483 FDA-approved and experimental drug-target binary links, and some new DTIs were further predicted. In vitro assays confirmed that five old drugs, namely montelukast, diclofenac, simvastatin, ketoconazole, and itraconazole, showed polypharmacological features on estrogen receptors or dipeptidyl peptidase-IV with half maximal inhibitory or effective concentration ranged from 0.2 to 10 µM. Moreover, simvastatin and ketoconazole showed potent antiproliferative activities on human MDA-MB-231 breast cancer cell line in MTT assays. The results indicated that these methods could be powerful tools in prediction of DTIs and drug repositioning.