{"title":"Drug Repurposing Using Hypergraph Embedding Based on Common Therapeutic Targets of a Drug.","authors":"Hanieh Abbasi, Amir Lakizadeh","doi":"10.1089/cmb.2023.0427","DOIUrl":"10.1089/cmb.2023.0427","url":null,"abstract":"<p><p>Developing a new drug is a long and expensive process that typically takes 10-15 years and costs billions of dollars. This has led to an increasing interest in drug repositioning, which involves finding new therapeutic uses for existing drugs. Computational methods become an increasingly important tool for identifying associations between drugs and new diseases. Graph- and hypergraph-based approaches are a type of computational method that can be used to identify potential associations between drugs and new diseases. Here, we present a drug repurposing method based on hypergraph neural network for predicting drug-disease association in three stages. First, it constructs a heterogeneous graph that contains drug and disease nodes and links between them; in the second stage, it converts the heterogeneous simple graph to a hypergraph with only disease nodes. This is achieved by grouping diseases that use the same drug into a hyperedge. Indeed, all the diseases that are the common therapeutic goal of a drug are placed on a hyperedge. Finally, a graph neural network is used to predict drug-disease association based on the structure of the hypergraph. This model is more efficient than other methods because it uses a hypergraph to model relationships more effectively than graphs. Furthermore, it constructs the hypergraph using only a drug-disease association matrix, eliminating the need for extensive amounts of data. Experimental results show that the hypergraph-based approach effectively captures complex interrelationships between drugs and diseases, leading to improved accuracy of drug-disease association prediction compared to state-of-the-art methods.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"316-329"},"PeriodicalIF":1.4,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142794721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DRGAT: Predicting Drug Responses Via Diffusion-Based Graph Attention Network.","authors":"Emre Sefer","doi":"10.1089/cmb.2024.0807","DOIUrl":"10.1089/cmb.2024.0807","url":null,"abstract":"<p><p>Accurately predicting drug response depending on a patient's genomic profile is critical for advancing personalized medicine. Deep learning approaches rise and especially the rise of graph neural networks leveraging large-scale omics datasets have been a key driver of research in this area. However, these biological datasets, which are typically high dimensional but have small sample sizes, present challenges such as overfitting and poor generalization in predictive models. As a complicating matter, gene expression (GE) data must capture complex inter-gene relationships, exacerbating these issues. In this article, we tackle these challenges by introducing a drug response prediction method, called drug response graph attention network (DRGAT), which combines a denoising diffusion implicit model for data augmentation with a recently introduced graph attention network (GAT) with high-order neighbor propagation (HO-GATs) prediction module. Our proposed approach achieved almost 5% improvement in the area under receiver operating characteristic curve compared with state-of-the-art models for the many studied drugs, indicating our method's reasonable generalization capabilities. Moreover, our experiments confirm the potential of diffusion-based generative models, a core component of our method, to mitigate the inherent limitations of omics datasets by effectively augmenting GE data.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"330-350"},"PeriodicalIF":1.4,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142785889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Structure Feature Introduced to Predict Protein-Protein Interaction Sites.","authors":"Lingwei Lai, Jing Geng, Haochen Duan, Siyuan Chen, Lvwen Huang, Jiantao Yu","doi":"10.1089/cmb.2024.0804","DOIUrl":"https://doi.org/10.1089/cmb.2024.0804","url":null,"abstract":"<p><p>Interaction between proteins often depends on the sequence features and structure features of proteins. Both of these features are helpful for machine learning methods to predict (protein-protein interaction) PPI sites. In this study, we introduced a new structure feature: concave-convex feature on the protein surface, which was computed by the structural data of proteins in Protein Data Bank database. And then, a prediction model combining protein sequence features and structure features was constructed, named SSPPI_Ensemble (Sequence and Structure geometric feature-based PPI site prediction). Three sequence features, i.e., PSSMs (Position-Specific Scoring Matrices), HMM (Hidden Markov Models) and raw protein sequence, were used. The Dictionary of Secondary Structure in Proteins and the concave-convex feature were used as the structure feature. Compared with the other prediction methods, our method has achieved better performance or showed the obvious advantages on the same test datasets, confirming the proposed concave-convex feature is useful in predicting PPI sites.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143501476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Subject-Specific Dosage Estimation for Primary Hypothyroidism Using Sparse Data.","authors":"Devleena Ghosh, Chittaranjan Mandal","doi":"10.1089/cmb.2024.0752","DOIUrl":"https://doi.org/10.1089/cmb.2024.0752","url":null,"abstract":"<p><p>Subject-specific dosage estimation for primary hypothyroidism using subject-specific parameters of the thyrotropic regulation system is presented in this work. The data needed for such personalized modeling are usually sparse. This is addressed by utilizing available data along with domain knowledge for estimation of model parameters but with some uncertainty. Optimization-based dosage estimation approaches may not be applicable in the presence of such uncertainty. In this work, the optimal drug dosage range based on estimated parameter ranges for primary hypothyroid condition is estimated using the mathematical model through satisfiability modulo theory (SMT)-based analysis. The salient features of this work are as follows: (1) estimation of subject-specific model parameters with uncertainty using subject-specific pre-treatment and post-treatment observations, (2) modeling periodic drug administration as part of the ordinary differential equation model of thyrotropic regulation pathway through Fourier series approximation, (3) application of SMT-based analysis for determining optimal dosage range using this model and estimated parameter ranges, and (4) an initial dosage estimation method using the regression model. Results have been obtained to support the working of the developed computational procedures.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143433256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"VIPER: Virus Inhibition Via Peptide Engineering and Receptor Mimicry.","authors":"Anna Sophie Klingenberg, Dario Ghersi","doi":"10.1089/cmb.2024.0866","DOIUrl":"https://doi.org/10.1089/cmb.2024.0866","url":null,"abstract":"<p><p>A key step in most viral infections is the binding of a viral protein to a host receptor, leading to the virus entering the host cell. Disrupting this protein-protein interaction is an effective strategy for preventing infection and subsequent disease. Building on recent advances in computational tools for structural biology, we introduce Virus Inhibition via Peptide Engineering and Receptor Mimicry (VIPER), a novel approach for the automatic derivation and optimization of biomimetic decoy peptides that mimic binding sites of human proteins. VIPER leverages structural data from human-pathogen protein complexes, yielding peptides that can competitively inhibit viral entry by mimicking the natural receptor. We computationally validated VIPER using molecular dynamics simulations and showcased its applicability on three clinically relevant viruses, highlighting its potential to accelerate therapeutic development. With a focus on reproducibility and extensibility, VIPER can facilitate the rapid development of antiviral inhibitors by automating the design and optimization of biomimetic compounds.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143414411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Brenda Ivette García-Maya, Yehtli Morales-Huerta, Raúl Salgado-García
{"title":"Disease Spread Model in Structurally Complex Spaces: An Open Markov Chain Approach.","authors":"Brenda Ivette García-Maya, Yehtli Morales-Huerta, Raúl Salgado-García","doi":"10.1089/cmb.2024.0630","DOIUrl":"https://doi.org/10.1089/cmb.2024.0630","url":null,"abstract":"<p><p>Understanding the dynamical behavior of infectious disease propagation within enclosed spaces is crucial for effectively establishing control measures. In this article, we present a modeling approach to analyze the dynamics of individuals in enclosed spaces, where such spaces are comprised of different chambers. Our focus is on capturing the movement of individuals and their infection status using an open Markov chain framework. Unlike ordinary Markov chains, an open Markov chain accounts for individuals entering and leaving the system. We categorize individuals within the system into three different groups: susceptible, carrier, and infected. A discrete-time process is employed to model the behavior of individuals throughout the system. To quantify the risk of infection, we derive a probability function that takes into account the total number of individuals inside the system and the distribution among the different groups. Furthermore, we calculate mathematical expressions for the average number of susceptible, carrier, and infected individuals at each time step. Additionally, we determine mathematical expressions for the mean number and stationary mean populations of these groups. To validate our modeling approach, we compare the theoretical and numerical models proposed in this work.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143391035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CFINet: Cross-Modality MRI Feature Interaction Network for Pseudoprogression Prediction of Glioblastoma.","authors":"Ya Lv, Jin Liu, Xu Tian, Pei Yang, Yi Pan","doi":"10.1089/cmb.2024.0518","DOIUrl":"10.1089/cmb.2024.0518","url":null,"abstract":"<p><p>Pseudoprogression (PSP) is a related reaction of glioblastoma treatment, and misdiagnosis can lead to unnecessary intervention. Magnetic resonance imaging (MRI) provides cross-modality images for PSP prediction studies. However, how to effectively use the complementary information between the cross-modality MRI to improve PSP prediction is still a challenging task. To address this challenge, we propose a cross-modality feature interaction network for PSP prediction. Firstly, we propose a triple-branch multi-scale module to extract low-order feature representations and a skip-connection multi-scale module to extract high-order feature representations. Then, a cross-modality interaction module based on attention mechanism is designed to make the complementary information between cross-modality MRI fully interact. Finally, the high-order cross-modality interaction information is fed into a multi-layer perceptron to achieve the PSP prediction task. We evaluate the proposed network on a private dataset with 52 subjects from Hunan Cancer Hospital and validate it on a private dataset with 30 subjects from Xiangya Hospital. The accuracy of our proposed network on the datasets is 0.954 and 0.929, respectively, which is better than most typical convolutional neural network and interaction methods.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"212-224"},"PeriodicalIF":1.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141554866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BiRNN-DDI: A Drug-Drug Interaction Event Type Prediction Model Based on Bidirectional Recurrent Neural Network and Graph2Seq Representation.","authors":"GuiShen Wang, Hui Feng, Chen Cao","doi":"10.1089/cmb.2024.0476","DOIUrl":"10.1089/cmb.2024.0476","url":null,"abstract":"<p><p>Research on drug-drug interaction (DDI) prediction, particularly in identifying DDI event types, is crucial for understanding adverse drug reactions and drug combinations. This work introduces a Bidirectional Recurrent Neural Network model for DDI event type prediction (BiRNN-DDI), which simultaneously considers structural relationships and contextual information. Our BiRNN-DDI model constructs drug feature graphs to mine structural relationships. For contextual information, it transforms drug graphs into sequences and employs a two-channel structure, integrating BiRNN, to obtain contextual representations of drug-drug pairs. The model's effectiveness is demonstrated through comparisons with state-of-the-art models on two DDI event-type benchmarks. Extensive experimental results reveal that BiRNN-DDI surpasses other models in accuracy, AUPR, AUC, F1 score, Precision, and Recall metrics on both small and large datasets. Additionally, our model exhibits a lower parameter space, indicating more efficient learning of drug feature representations and prediction of potential DDI event types.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"198-211"},"PeriodicalIF":1.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141759025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jakob L Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F Stadler
{"title":"Pathway Realizability in Chemical Networks.","authors":"Jakob L Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F Stadler","doi":"10.1089/cmb.2024.0521","DOIUrl":"10.1089/cmb.2024.0521","url":null,"abstract":"<p><p>The exploration of pathways and alternative pathways that have a specific function is of interest in numerous chemical contexts. A framework for specifying and searching for pathways has previously been developed, but a focus on which of the many pathway solutions are realizable, or can be made realizable, is missing. Realizable here means that there actually exists some sequencing of the reactions of the pathway that will execute the pathway. We present a method for analyzing the realizability of pathways based on the reachability question in Petri nets. For realizable pathways, our method also provides a certificate encoding an order of the reactions, which realizes the pathway. We present two extended notions of realizability of pathways, one of which is related to the concept of network catalysts. We exemplify our findings on the pentose phosphate pathway. Furthermore, we discuss the relevance of our concepts for elucidating the choices often implicitly made when depicting pathways. Lastly, we lay the foundation for the mathematical theory of realizability.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"164-187"},"PeriodicalIF":1.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143080216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Filipp Martin Rondel, Hafsa Farooq, Roya Hosseini, Akshay Juyal, Sergey Knyazev, Serghei Mangul, Artem S Rogovskyy, Alexander Zelikovsky
{"title":"Estimating Enzyme Expression and Metabolic Pathway Activity in <i>Borreliella</i>-Infected and Uninfected Mice.","authors":"Filipp Martin Rondel, Hafsa Farooq, Roya Hosseini, Akshay Juyal, Sergey Knyazev, Serghei Mangul, Artem S Rogovskyy, Alexander Zelikovsky","doi":"10.1089/cmb.2024.0564","DOIUrl":"10.1089/cmb.2024.0564","url":null,"abstract":"<p><p>Evaluating changes in metabolic pathway activity is essential for studying disease mechanisms and developing new treatments, with significant benefits extending to human health. Here, we propose EMPathways2, a maximum likelihood pipeline that is based on the expectation-maximization algorithm, which is capable of evaluating enzyme expression and metabolic pathway activity level. We first estimate enzyme expression from RNA-seq data that is used for simultaneous estimation of pathway activity levels using enzyme participation levels in each pathway. We implement the novel pipeline to RNA-seq data from several groups of mice, which provides a deeper look at the biochemical changes occurring as a result of bacterial infection, disease, and immune response. Our results show that estimated enzyme expression, pathway activity levels, and enzyme participation levels in each pathway are robust and stable across all samples. Estimated activity levels of a significant number of metabolic pathways strongly correlate with the infected and uninfected status of the respective rodent types.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"188-197"},"PeriodicalIF":1.4,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11947643/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141457117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}