Inferring anatomical therapeutic chemical (ATC) class of drugs using shortest path and random walk with restart algorithms

The anatomical therapeutic chemical (ATC) classification system is a widely accepted drug classification scheme. This system comprises five levels and includes several classes in each level. Drugs are classified into classes according to their therapeutic effects and characteristics. The first level includes 14 main classes. In this study, we proposed two network-based models to infer novel potential chemicals deemed to belong in the first level of ATC classification. To build these models, two large chemical networks were constructed using the chemical–chemical interaction information retrieved from the Search Tool for Interactions of Chemicals (STITCH). Two classic network algorithms, shortest path (SP) and random walk with restart (RWR) algorithms, were executed on the corresponding network to mine novel chemicals for each ATC class using the validated drugs in a class as seed nodes. Then, the obtained chemicals yielded by these two algorithms were further evaluated by a permutation test and an association test. The former can exclude chemicals produced by the structure of the network, i.e., false positive discoveries. By contrast, the latter identifies the most important chemicals that have strong associations with the ATC class. Comparisons indicated that the two models can provide quite dissimilar results, suggesting that the results yielded by one model can be essential supplements for those obtained by the other model. In addition, several representative inferred chemicals were analyzed to confirm the reliability of the results generated by the two models. This article is part of a Special Issue entitled: Accelerating Precision Medicine through Genetic and Genomic Big Data Analysis edited by Yudong Cai & Tao Huang.     

Study of drug function based on similarity of pathway fingerprint

Drugs sharing similar therapeutic function may not bind to the same group of targets. However, their targets may be involved in similar pathway profiles which are associated with certain pathological process. In this study, pathway fingerprint was introduced to indicate the profile of significant pathways being influenced by the targets of drugs. Then drug-drug network was further constructed based on significant similarity of pathway fingerprints. In this way, the functions of a drug may be hinted by the enriched therapeutic functions of its neighboring drugs. In the test of 911 FDA approved drugs with more than one known target, 471 drugs could be connected into networks. 760 significant associations of drug-therapeutic function were generated, among which around 60% of them were supported by scientific literatures or ATC codes of drug functional classification. Therefore, pathway fingerprints may be useful to further study on the potential function of known drugs, or the unknown function of new drugs.     

Predicting Anatomical Therapeutic Chemical (ATC) classification of drugs by integrating chemical-chemical interactions and similarities

The Anatomical Therapeutic Chemical (ATC) classification system, recommended by the World Health Organization, categories drugs into different classes according to their therapeutic and chemical characteristics. For a set of query compounds, how can we identify which ATC-class (or classes) they belong to? It is an important and challenging problem because the information thus obtained would be quite useful for drug development and utilization. By hybridizing the informations of chemical-chemical interactions and chemical-chemical similarities, a novel method was developed for such purpose. It was observed by the jackknife test on a benchmark dataset of 3,883 drug compounds that the overall success rate achieved by the prediction method was about 73% in identifying the drugs among the following 14 main ATC-classes: (1) alimentary tract and metabolism; (2) blood and blood forming organs; (3) cardiovascular system; (4) dermatologicals; (5) genitourinary system and sex hormones; (6) systemic hormonal preparations, excluding sex hormones and insulins; (7) anti-infectives for systemic use; (8) antineoplastic and immunomodulating agents; (9) musculoskeletal system; (10) nervous system; (11) antiparasitic products, insecticides and repellents; (12) respiratory system; (13) sensory organs; (14) various. Such a success rate is substantially higher than 7% by the random guess. It has not escaped our notice that the current method can be straightforwardly extended to identify the drugs for their 2^nd-level, 3^rd-level, 4^th-level, and 5^th-level ATC-classifications once the statistically significant benchmark data are available for these lower levels.     

IDMap: facilitating the detection of potential leads with therapeutic targets

Pharmaceutical industry has been striving to reduce the costs of drug development and increase productivity. Among the many different attempts, drug repositioning (retargeting existing drugs) comes into the spotlight because of its financial efficiency. We introduce IDMap which predicts novel relationships between targets and chemicals and thus is capable of repositioning the marketed drugs by using text mining and chemical structure information. Also capable of mapping commercial chemicals to possible drug targets and vice versa, IDMap creates convenient environments for identifying the potential lead and its targets, especially in the field of drug repositioning. AVAILABILITY: IDMap executable and its user manual including color images are freely available to non-commercial users at http://www.equispharm.com/idmap     

Stability assessment of a new antithrombotic small peptide,Arg-Gly-Asp-Trp-Arg (RGDWR), and its derivative

Objective

To assess the stabilities of Arg-Gly-Asp-Trp-Arg (RGDWR, designated as RWR), a new patented antithrombotic small peptide, and its derivative with ω-aminocaprylic acid on its N-terminus (ωRWR).

Results

RWR in rat plasma was decreased by between 32 and 48% after 4 h incubation on ice, indicating its instability in plasma. In contrast, ωRWR in plasma remained at 96–107%. Concentration changes were within 6.2% for ωRWR after storage in various conditions. ωRWR is therefore stable in rat plasma, as well as under different storage methods. Furthermore, ω-aminocaprylic acid added onto the RWR peptide did not affect its antiplatelet aggregation activity.

Conclusions

A novel small peptide, ωRWR, has been developed with a good stability for possible antithrombotic use.

     

Identification and characterization of inhibitors of Haemophilus influenzae acetohydroxyacid synthase

Acetohydroxyacid synthase (AHAS), a potential target for antimicrobial agents, catalyzes the first common step in the biosynthesis of branched-chain amino acids. The gene coding for the AHAS catalytic subunit from Haemophilus influenzae (Hi) was cloned, overexpressed in Escherichia coli, and purified. To identify new inhibitory scaffolds, we used a high-throughput screen to test 221 small diverse chemical compounds against Hi-AHAS. Compounds were selected for their ability to inhibit AHAS in vitro. The screen identified 3 compounds, each representing a structural class, as Hi-AHAS inhibitors with an IC₅₀ in the low micromolar range (4.4-14.6 μM). The chemical scaffolds of the three compounds were oxa-1-thia-4-aza-cyclopenta[b]naphthalene (KHG25229), phenyl-2,3-dihydro-isothiazole (KHG25386), and phenyl-pyrrolidine-3-carboxylic acid phenylamide (KHG25056). Further, molecular docking of the two most potent chemicals, KHG25229 and KHG25386, in Hi-AHAS yielded binding energies of −10.41 and −9.21 kcal/mol, respectively. The binding modes were consistent with inhibition mechanisms, as both chemicals oriented outside the active site. As the need for novel antibiotic classes to combat drug resistant bacteria increases, screening compounds that act against Hi-AHAS may assist in the identification of potential new anti-Hi drugs.     

Predicting drug-disease interactions by semi-supervised graph cut algorithm and three-layer data integration

Background

Prediction of drug-disease interactions is promising for either drug repositioning or disease treatment fields. The discovery of novel drug-disease interactions, on one hand can help to find novel indictions for the approved drugs; on the other hand can provide new therapeutic approaches for the diseases. Recently, computational methods for finding drug-disease interactions have attracted lots of attention because of their far more higher efficiency and lower cost than the traditional wet experiment methods. However, they still face several challenges, such as the organization of the heterogeneous data, the performance of the model, and so on.

Methods

In this work, we present to hierarchically integrate the heterogeneous data into three layers. The drug-drug and disease-disease similarities are first calculated separately in each layer, and then the similarities from three layers are linearly fused into comprehensive drug similarities and disease similarities, which can then be used to measure the similarities between two drug-disease pairs. We construct a novel weighted drug-disease pair network, where a node is a drug-disease pair with known or unknown treatment relation, an edge represents the node-node relation which is weighted with the similarity score between two pairs. Now that similar drug-disease pairs are supposed to show similar treatment patterns, we can find the optimal graph cut of the network. The drug-disease pair with unknown relation can then be considered to have similar treatment relation with that within the same cut. Therefore, we develop a semi-supervised graph cut algorithm, SSGC, to find the optimal graph cut, based on which we can identify the potential drug-disease treatment interactions.

Results

By comparing with three representative network-based methods, SSGC achieves the highest performances, in terms of both AUC score and the identification rates of true drug-disease pairs. The experiments with different integration strategies also demonstrate that considering several sources of data can improve the performances of the predictors. Further case studies on four diseases, the top-ranked drug-disease associations have been confirmed by KEGG, CTD database and the literature, illustrating the usefulness of SSGC.

Conclusions

The proposed comprehensive similarity scores from multi-views and multiple layers and the graph-cut based algorithm can greatly improve the prediction performances of drug-disease associations.

     

基于LINCS-L1000扰动信号通过SAE-XGBoost算法预测药物诱导下的细胞活性

不同细胞在特定化合物作用下具有不同的扰动信号,基于这些扰动信号预测细胞的活性和挖掘隐藏在表型之下的药物敏感性非常重要.文中开发了一种基于LINCS-L1000扰动信号的SAE-XGBoost细胞活性预测算法.通过对LINCS-L1000、Achilles和CTRP三大数据集匹配和筛选,采用堆栈式深度自动编码器对基因信息...     

Efficient extraction of mapping rules of atoms from enzymatic reaction data.

Many computational problems and methods have been proposed for analysis of biological pathways. Among them, this paper focuses on extraction of mapping rules of atoms from enzymatic reaction data, which is useful for drug design, simulation of tracer experiments, and consistency checking of pathway databases. Most of existing methods for this problem are based on maximal common subgraph algorithms. In this paper, we propose a novel approach based on graph partition and graph isomorphism. We show that this problem is NP-hard in general, but can be solved in polynomial time for wide classes of enzymatic reactions. We also present an O(n(1.5)) time algorithm for a special but fundamental class of reactions, where n is the maximum size of compounds appearing in a reaction. We develop practical polynomial-time algorithms in which the Morgan algorithm is used for computing the normal form of a graph, where it is known that the Morgan algorithm works correctly for most chemical structures. Computational experiments are performed for these practical algorithms using the chemical reaction data stored in the KEGG/LIGAND database. The results of computational experiments suggest that practical algorithms are useful in many cases.     

Prediction of occurrences of diverse chemical classes in the Asteraceae through artificial neural networks

The training and the application of a neural network system for the prediction of occurrences of secondary metabolites belonging to diverse chemical classes in the Asteraceae is described. From a database containing about 604 genera and 28,000 occurrences of secondary metabolites in the plant family, information was collected encompassing nine chemical classes and their respective occurrences for training of a multi-layer net using the back-propagation algorithm. The net supplied as output the presence or absence of the chemical classes as well as the number of compounds isolated from each taxon. The results provided by the net from the presence or absence of a chemical class showed a 89% hit rate; by excluding triterpenes from the analysis, only 5% of the genera studied exhibited errors greater than 10%.     

Identification of New Candidate Genes and Chemicals Related to Esophageal Cancer Using a Hybrid Interaction Network of Chemicals and Proteins

Cancer is a serious disease responsible for many deaths every year in both developed and developing countries. One reason is that the mechanisms underlying most types of cancer are still mysterious, creating a great block for the design of effective treatments. In this study, we attempted to clarify the mechanism underlying esophageal cancer by searching for novel genes and chemicals. To this end, we constructed a hybrid network containing both proteins and chemicals, and generalized an existing computational method previously used to identify disease genes to identify new candidate genes and chemicals simultaneously. Based on jackknife test, our generalized method outperforms or at least performs at the same level as those obtained by a widely used method - the Random Walk with Restart (RWR). The analysis results of the final obtained genes and chemicals demonstrated that they highly shared gene ontology (GO) terms and KEGG pathways with direct and indirect associations with esophageal cancer. In addition, we also discussed the likelihood of selected candidate genes and chemicals being novel genes and chemicals related to esophageal cancer.     

Enhanced stochastic optimization algorithm for finding effective multi-target therapeutics

Background

For treating a complex disease such as cancer, we need effective means to control the biological network that underlies the disease. However, biological networks are typically robust to external perturbations, making it difficult to beneficially alter the network dynamics by controlling a single target. In fact, multi-target therapeutics is often more effective compared to monotherapies, and combinatory drugs are commonly used these days for treating various diseases. A practical challenge in combination therapy is that the number of possible drug combinations increases exponentially, which makes the prediction of the optimal drug combination a difficult combinatorial optimization problem. Recently, a stochastic optimization algorithm called the Gur Game algorithm was proposed for drug optimization, which was shown to be very efficient in finding potent drug combinations.

Results

In this paper, we propose a novel stochastic optimization algorithm that can be used for effective optimization of combinatory drugs. The proposed algorithm analyzes how the concentration change of a specific drug affects the overall drug response, thereby making an informed guess on how the concentration should be updated to improve the drug response. We evaluated the performance of the proposed algorithm based on various drug response functions, and compared it with the Gur Game algorithm.

Conclusions

Numerical experiments clearly show that the proposed algorithm significantly outperforms the original Gur Game algorithm, in terms of reliability and efficiency. This enhanced optimization algorithm can provide an effective framework for identifying potent drug combinations that lead to optimal drug response.

     

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks

Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease studies. However, it is still time-consuming and laborious to determine the real disease-causing genes by biological experiments. With the advances of the high-throughput techniques, a large number of protein-protein interactions have been produced. Therefore, to address this issue, several methods based on protein interaction network have been proposed. In this paper, we propose a shortest path-based algorithm, named SPranker, to prioritize disease-causing genes in protein interaction networks. Considering the fact that diseases with similar phenotypes are generally caused by functionally related genes, we further propose an improved algorithm SPGOranker by integrating the semantic similarity of GO annotations. SPGOranker not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into account. The proposed algorithms SPranker and SPGOranker were applied to 1598 known orphan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches, ICN, VS and RWR. The experimental results show that SPranker and SPGOranker outperform ICN, VS, and RWR for the prioritization of orphan disease-causing genes. Importantly, for the case study of severe combined immunodeficiency, SPranker and SPGOranker predict several novel causal genes.     

Drug Repositioning by Kernel-Based Integration of Molecular Structure,Molecular Activity,and Phenotype Data

Computational inference of novel therapeutic values for existing drugs, i.e., drug repositioning, offers the great prospect for faster and low-risk drug development. Previous researches have indicated that chemical structures, target proteins, and side-effects could provide rich information in drug similarity assessment and further disease similarity. However, each single data source is important in its own way and data integration holds the great promise to reposition drug more accurately. Here, we propose a new method for drug repositioning, PreDR (Predict Drug Repositioning), to integrate molecular structure, molecular activity, and phenotype data. Specifically, we characterize drug by profiling in chemical structure, target protein, and side-effects space, and define a kernel function to correlate drugs with diseases. Then we train a support vector machine (SVM) to computationally predict novel drug-disease interactions. PreDR is validated on a well-established drug-disease network with 1,933 interactions among 593 drugs and 313 diseases. By cross-validation, we find that chemical structure, drug target, and side-effects information are all predictive for drug-disease relationships. More experimentally observed drug-disease interactions can be revealed by integrating these three data sources. Comparison with existing methods demonstrates that PreDR is competitive both in accuracy and coverage. Follow-up database search and pathway analysis indicate that our new predictions are worthy of further experimental validation. Particularly several novel predictions are supported by clinical trials databases and this shows the significant prospects of PreDR in future drug treatment. In conclusion, our new method, PreDR, can serve as a useful tool in drug discovery to efficiently identify novel drug-disease interactions. In addition, our heterogeneous data integration framework can be applied to other problems.     

Computational drug repositioning using meta-path-based semantic network analysis

Background

Drug repositioning is a promising and efficient way to discover new indications for existing drugs, which holds the great potential for precision medicine in the post-genomic era. Many network-based approaches have been proposed for drug repositioning based on similarity networks, which integrate multiple sources of drugs and diseases. However, these methods may simply view nodes as the same-typed and neglect the semantic meanings of different meta-paths in the heterogeneous network. Therefore, it is urgent to develop a rational method to infer new indications for approved drugs.

Results

In this study, we proposed a novel methodology named HeteSim_DrugDisease (HSDD) for the prediction of drug repositioning. Firstly, we build the drug-drug similarity network and disease-disease similarity network by integrating the information of drugs and diseases. Secondly, a drug-disease heterogeneous network is constructed, which combines the drug similarity network, disease similarity network as well as the known drug-disease association network. Finally, HSDD predicts novel drug-disease associations based on the HeteSim scores of different meta-paths. The experimental results show that HSDD performs significantly better than the existing state-of-the-art approaches. HSDD achieves an AUC score of 0.8994 in the leave-one-out cross validation experiment. Moreover, case studies for selected drugs further illustrate the practical usefulness of HSDD.

Conclusions

HSDD can be an effective and feasible way to infer the associations between drugs and diseases using on meta-path-based semantic network analysis.

     

Identification of genes related to proliferative diabetic retinopathy through RWR algorithm based on protein–protein interaction network

Proliferative diabetic retinopathy (PDR) is one of the most common complications of diabetes and can lead to blindness. Proteomic studies have provided insight into the pathogenesis of PDR and a series of PDR-related genes has been identified but are far from fully characterized because the experimental methods are expensive and time consuming. In our previous study, we successfully identified 35 candidate PDR-related genes through the shortest-path algorithm. In the current study, we developed a computational method using the random walk with restart (RWR) algorithm and the protein–protein interaction (PPI) network to identify potential PDR-related genes. After some possible genes were obtained by the RWR algorithm, a three-stage filtration strategy, which includes the permutation test, interaction test and enrichment test, was applied to exclude potential false positives caused by the structure of PPI network, the poor interaction strength, and the limited similarity on gene ontology (GO) terms and biological pathways. As a result, 36 candidate genes were discovered by the method which was different from the 35 genes reported in our previous study. A literature review showed that 21 of these 36 genes are supported by previous experiments. These findings suggest the robustness and complementary effects of both our efforts using different computational methods, thus providing an alternative method to study PDR pathogenesis.     

Cycloheximide induction of xenotropic type C virus from synchronized mouse cells: metabolic requirements for virus activation.

The information for type C RNA viruses is genetically transmitted within the cellular DNA of the normal mouse cell. These viruses can be induced after exposure of cells to two classes of chemicals, inhibitors of protein synthesis and halogenated pyrimidines. The metabolic requirements for activation of one endogenous virus of BALB/c mouse cells by representatives of each class of drugs were studies. Cycloheximide and iododeoxyuridine each induce virus efficiently from cultures in exponential growth but are inactive on cells in stationary phase. However, cells are maximally sensitive to the actions of each drug at different times within the cell cycle. Further, virus induction in response to each is differentially inhibited under conditions of simultaneous cell exposure to inhibitors of DNA or RNA synthesis. The results provide support for the concept that inhibitors of protein synthesis and halogenated pyrimidines act by different mechanisms to induce type C virus release.     

SuperDrug: a conformational drug database

MOTIVATION: Different resources exist for experimentally determined and computed three-dimensional (3D)-structures of low molecular weight structures but for approved drugs, no free, publicly accessible source of 3D-structures and conformers is available. Furthermore, for selection purposes or for correlation of structural similarity with medical application, the assignment of the Anatomical Therapeutic Chemical (ATC) classification codes to each structure according to the WHO-scheme would be desirable. RESULTS: The database contains approximately 2500 3D-structures of active ingredients of essential marketed drugs. To account for structural flexibility they are represented by 10(5) structural conformers. Here we present a web-query system enabling searches for drug name, synonyms, trade name, trivial name, formula, CAS-number, ATC-code etc. 2D-similarity screening (Tanimoto coefficients) and an automatic 3D-superposition procedure based on conformational representation are implemented. Drug structures above a similarity threshold as well as superimposed conformers can be retrieved in the mol- file format via a graphical interface. AVAILABILITY: For academic use the system is accessible at http://bioinf.charite.de/superdrug. The retrieval system requires the free browser-plugin 'chime' from MDL for visualization.     

Gene gravity-like algorithm for disease gene prediction based on phenotype-specific network

Background

Polygenic diseases are usually caused by the dysfunction of multiple genes. Unravelling such disease genes is crucial to fully understand the genetic landscape of diseases on molecular level. With the advent of ‘omic’ data era, network-based methods have prominently boosted disease gene discovery. However, how to make better use of different types of data for the prediction of disease genes remains a challenge.

Results

In this study, we improved the performance of disease gene prediction by integrating the similarity of disease phenotype, biological function and network topology. First, for each phenotype, a phenotype-specific network was specially constructed by mapping phenotype similarity information of given phenotype onto the protein-protein interaction (PPI) network. Then, we developed a gene gravity-like algorithm, to score candidate genes based on not only topological similarity but also functional similarity. We tested the proposed network and algorithm by conducting leave-one-out and leave-10%-out cross validation and compared them with state-of-art algorithms. The results showed a preference to phenotype-specific network as well as gene gravity-like algorithm. At last, we tested the predicting capacity of proposed algorithms by test gene set derived from the DisGeNET database. Also, potential disease genes of three polygenic diseases, obesity, prostate cancer and lung cancer, were predicted by proposed methods. We found that the predicted disease genes are highly consistent with literature and database evidence.

Conclusions

The good performance of phenotype-specific networks indicates that phenotype similarity information has positive effect on the prediction of disease genes. The proposed gene gravity-like algorithm outperforms the algorithm of Random Walk with Restart (RWR), implicating its predicting capacity by combing topological similarity with functional similarity. Our work will give an insight to the discovery of disease genes by fusing multiple similarities of genes and diseases.