{"title":"Endhered Patterns in Matchings and RNA.","authors":"Célia Biane, Greg Hampikian, Sergey Kirgizov, Khaydar Nurligareev","doi":"10.1089/cmb.2024.0658","DOIUrl":"https://doi.org/10.1089/cmb.2024.0658","url":null,"abstract":"<p><p>An <i>endhered (end-adhered) pattern</i> is a subset of arcs in matchings, such that the corresponding starting points are consecutive, and the same holds for the ending points. Such patterns are in one-to-one correspondence with the permutations. We focus on the occurrence frequency of such patterns in matchings and native (real-world) RNA structures with pseudoknots. We present combinatorial results related to the distribution and asymptotic behavior of the pattern 21, which corresponds to two consecutive base pairs frequently encountered in RNA, and the pattern 12, representing the archetypal minimal pseudoknot. We show that in matchings these two patterns are equidistributed, which is quite different from what we can find in native RNAs. We also examine the distribution of endhered patterns of size 3, showing how the patterns change under the transformation called <i>endhered twist</i>. Finally, we compute the distributions of endhered patterns of size 2 and 3 in native secondary RNA structures with pseudoknots and discuss possible outcomes of our study.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142876873","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":"<i>Special Issue, Part II</i> 19th International Symposium on Bioinformatics Research and Applications (ISBRA 2023).","authors":"Murray Patterson","doi":"10.1089/cmb.2024.0905","DOIUrl":"https://doi.org/10.1089/cmb.2024.0905","url":null,"abstract":"","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142846889","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}
Xiang Chen, Yibing Ma, Yongle Shi, Bai Zhang, Hanwen Wu, Jie Gao
{"title":"Fuzzy-Based Identification of Transition Cells to Infer Cell Trajectory for Single-Cell Transcriptomics.","authors":"Xiang Chen, Yibing Ma, Yongle Shi, Bai Zhang, Hanwen Wu, Jie Gao","doi":"10.1089/cmb.2023.0432","DOIUrl":"https://doi.org/10.1089/cmb.2023.0432","url":null,"abstract":"<p><p>With the continuous evolution of single-cell RNA sequencing technology, it has become feasible to reconstruct cell development processes using computational methods. Trajectory inference is a crucial downstream analytical task that provides valuable insights into understanding cell cycle and differentiation. During cell development, cells exhibit both stable and transition states, which makes it challenging to accurately identify these cells. To address this challenge, we propose a novel single-cell trajectory inference method using fuzzy clustering, named scFCTI. By introducing fuzzy clustering and quantifying cell uncertainty, scFCTI can identify transition cells within unstable cell states. Moreover, scFCTI can obtain refined cell classification by characterizing different cell stages, which gain more accurate single-cell trajectory reconstruction containing transition paths. To validate the effectiveness of scFCTI, we conduct experiments on five real datasets and four different structure simulation datasets, comparing them with several state-of-the-art trajectory inference methods. The results demonstrate that scFCTI outperforms these methods by successfully identifying unstable cell clusters and obtaining more accurate cell paths with transition states. Especially the experimental results demonstrate that scFCTI can reconstruct the cell trajectory more precisely.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142818363","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}
Elias DeVoe, Honey V Reddi, Bradley W Taylor, Samantha Stachowiak, Jennifer L Geurts, Ben George, Reza Shaker, Raul Urrutia, Michael T Zimmermann
{"title":"An Analytical Approach that Combines Knowledge from Germline and Somatic Mutations Enhances Tumor Genomic Reanalyses in Precision Oncology.","authors":"Elias DeVoe, Honey V Reddi, Bradley W Taylor, Samantha Stachowiak, Jennifer L Geurts, Ben George, Reza Shaker, Raul Urrutia, Michael T Zimmermann","doi":"10.1089/cmb.2023.0461","DOIUrl":"https://doi.org/10.1089/cmb.2023.0461","url":null,"abstract":"<p><p><b><i>Background:</i></b> Expanded analysis of tumor genomics data enables current and future patients to gain more benefits, such as improving diagnosis, prognosis, and therapeutics. <b><i>Methods:</i></b> Here, we report tumor genomic data from 1146 cases accompanied by simultaneous expert analysis from patients visiting our oncological clinic. We developed an analytical approach that leverages combined germline and cancer genetics knowledge to evaluate opportunities, challenges, and yield of potentially medically relevant data. <b><i>Results:</i></b> We identified 499 cases (44%) with variants of interest, defined as either potentially actionable or pathogenic in a germline setting, and that were reported in the original analysis as variants of uncertain significance (VUS). Of the 7405 total unique tumor variants reported, 462 (6.2%) were reported as VUS at the time of diagnosis, yet information from germline analyses identified them as (likely) pathogenic. Notably, we find that a sizable number of these variants (36%-79%) had been reported in heritable disorders and deposited in public databases before the year of tumor testing. <b><i>Conclusions:</i></b> This finding indicates the need to develop data systems to bridge current gaps in variant annotation and interpretation and to develop more complete digital representations of actionable pathways. We outline our process for achieving such methodologic integration. Sharing genomics data across medical specialties can enable more robust, equitable, and thorough use of patient's genomics data. This comprehensive analytical approach and the new knowledge derived from its results highlight its multi-specialty value in precision oncology settings.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142807362","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}
Lidan Bai, Jun Sun, Vasile Palade, Chao Li, Hengyang Lu, Cong Gao
{"title":"Optimizing Metabolite Production with Neighborhood-Based Binary Quantum-Behaved Particle Swarm Optimization and Flux Balance Analysis.","authors":"Lidan Bai, Jun Sun, Vasile Palade, Chao Li, Hengyang Lu, Cong Gao","doi":"10.1089/cmb.2024.0538","DOIUrl":"https://doi.org/10.1089/cmb.2024.0538","url":null,"abstract":"<p><p>Metabolic engineering is a rapidly evolving field that involves optimizing microbial cell factories to overproduce various industrial products. To achieve this, several tools, leveraging constraint-based stoichiometric models and metaheuristic algorithms like particle swarm optimization (PSO), have been developed. However, PSO can potentially get trapped in local optima. Quantum-behaved PSO (QPSO) overcomes this limitation, and our study further enhances its binary version (BQPSO) with a neighborhood topology, leading to the advanced neighborhood-based BQPSO (NBQPSO). Combined with flux balance analysis (FBA), this forms an innovative approach, NBQPSO-FBA, for identifying optimal knockout strategies to maximize the desired metabolite production. Additionally, we introduced a novel encoding strategy suitable for large-scale genome-scale metabolic models (GSMMs). Evaluated on four <i>E. coli</i> GSMMs (iJR904, iAF1260, iJO1366, and iML1515), NBQPSO-FBA matches or surpasses established bi-level linear programming (LP) and heuristic methods in metabolite production optimization. Notably, it achieved 90.69% realization of the theoretical maximum in acetate production and demonstrated comparable performance with leading algorithms in lactate production. The efficiency of NBQPSO-FBA, which requires fewer knockouts, makes it a practical and effective tool for optimizing microbial cell factories. This addresses the rising demand for microbial products across various industries.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142800309","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}
Ziqian Wu, Jiyoon Park, Paul R Steiner, Bo Zhu, John X J Zhang
{"title":"A Graph-Based Machine-Learning Approach Combined with Optical Measurements to Understand Beating Dynamics of Cardiomyocytes.","authors":"Ziqian Wu, Jiyoon Park, Paul R Steiner, Bo Zhu, John X J Zhang","doi":"10.1089/cmb.2024.0491","DOIUrl":"https://doi.org/10.1089/cmb.2024.0491","url":null,"abstract":"<p><p>The development of computational models for the prediction of cardiac cellular dynamics remains a challenge due to the lack of first-principled mathematical models. We develop a novel machine-learning approach hybridizing physics simulation and graph networks to deliver robust predictions of cardiomyocyte dynamics. Embedded with inductive physical priors, the proposed constraint-based interaction neural projection (CINP) algorithm can uncover hidden physical constraints from sparse image data on a small set of beating cardiac cells and provide robust predictions for heterogenous large-scale cell sets. We also implement an in vitro culture and imaging platform for cellular motion and calcium transient analysis to validate the model. We showcase our model's efficacy by predicting complex organoid cellular behaviors in both in silico and in vitro settings.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142794605","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":"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":"https://doi.org/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":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-09","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":"https://doi.org/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":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-06","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":"An Earth Mover's Distance-Based Self-Supervised Framework for Cellular Dynamic Grading in Live-Cell Imaging.","authors":"Fengqian Pang, Chunyue Lei, Hongfei Zhao, Zhiqiang Xing","doi":"10.1089/cmb.2024.0672","DOIUrl":"https://doi.org/10.1089/cmb.2024.0672","url":null,"abstract":"<p><p>Cellular appearance and its dynamics frequently serve as a proxy measurement of live-cell physiological properties. The computational analysis of cell properties is considered to be a significant endeavor in biological and biomedical research. Deep learning has garnered considerable success across various fields. In light of this, various neural networks have been developed to analyze live-cell microscopic videos and capture cellular dynamics with biological significance. Specifically, cellular dynamic grading (CDG) is the task that provides a predefined dynamic grade for a live-cell according to the speed of cellular deformation and intracellular movement. This task involves recording the morphological and cytoplasmic dynamics in live-cell microscopic videos. Similar to other medical image processing tasks, CDG faces challenges in collecting and annotating cellular videos. These deficiencies in medical data limit the performance of deep learning models. In this article, we propose a novel self-supervised framework to overcome these limitations for the CDG task. Our framework relies on the assumption that increasing or decreasing cell dynamic grades is consistent with accelerating or decelerating cell appearance change in videos, respectively. This consistency is subsequently incorporated as a constraint in the loss function for the self-supervised training strategy. Our framework is implemented by formulating a probability transition matrix based on the Earth Mover's Distance and imposing a loss constraint on the elements of this matrix. Experimental results demonstrate that our proposed framework enhances the model's ability to learn spatiotemporal dynamics. Furthermore, our framework outperforms the existing methods on our cell video database.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142769460","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}
Lin Zhang, Jigen Peng, Yongbin Ge, Haiyang Li, Yuchao Tang
{"title":"High-Accuracy Positivity-Preserving Finite Difference Approximations of the Chemotaxis Model for Tumor Invasion.","authors":"Lin Zhang, Jigen Peng, Yongbin Ge, Haiyang Li, Yuchao Tang","doi":"10.1089/cmb.2023.0316","DOIUrl":"10.1089/cmb.2023.0316","url":null,"abstract":"<p><p>Numerical simulation of the complex evolution process for tumor invasion plays an extremely important role in-depth exploring the bio-taxis phenomena of tumor growth and metastasis. In view of the fact that low-accuracy numerical methods often have large errors and low resolution, very refined grids have to be used if we want to get high-resolution simulating results, which leads to a great deal of computational cost. In this paper, we are committed to developing a class of high-accuracy positivity-preserving finite difference methods to solve the chemotaxis model for tumor invasion. First, two unconditionally stable implicit compact difference schemes for solving the model are proposed; second, the local truncation errors of the new schemes are analyzed, which show that they have second-order accuracy in time and fourth-order accuracy in space; third, based on the proposed schemes, the high-accuracy numerical integration idea of binary functions is employed to structure a linear compact weighting formula that guarantees fourth-order accuracy and nonnegative, and then a positivity-preserving and time-marching algorithm is established; and finally, the accuracy, stability, and positivity-preserving of the proposed methods are verified by several numerical experiments, and the evolution phenomena of tumor invasion over time are numerically simulated and analyzed.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"1224-1258"},"PeriodicalIF":1.4,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142380968","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}