Proteolysis targeting chimera (PROTAC), has emerged as an effective modality to selectively degrade disease-related proteins by harnessing the ubiquitin-proteasome system. Due to PROTACs' hetero-bifunctional characteristics, in which a linker joins a warhead binding to a protein of interest (POI), conferring specificity and a E3-ligand binding to an E3 ubiquitin ligase, this could trigger the ubiquitination and transportation of POI to the proteasome, followed by degradation. The rational PROTAC linker design is challenging due to its relatively large molecular weight and the complexity of maintaining the binding mode of warhead and E3-ligand in the binding pockets of counterpart. Conventional linker generation method can only generate linkers in either 1D SMILES or 2D graph, without taking into account the information of ternary structures. Here we propose a novel 3D linker generative model PROTAC-INVENT which can not only generate SMILES of PROTAC but also its 3D putative binding conformation coupled with the target protein and the E3 ligase. The model is trained jointly with the RL approach to bias the generation of PROTAC structures toward pre-defined 2D and 3D based properties. Examples were provided to demonstrate the utility of the model for generating reasonable 3D conformation of PROTACs. On the other hand, our results show that the associated workflow for 3D PROTAC conformation generation can also be used as an efficient docking protocol for PROTACs.

Because of the clinical heterogeneity among patients with systemic lupus erythematosus (SLE), developing molecular profiles that predict clinical features can be useful in creating a personalized approach to treatment. Toro-Domínguez et al. created a web tool to aid in therapeutic decision making for clinicians that predicts clinical features associated with SLE from blood transcriptomic data. Specifically, they present a machine learning model that predicts the presence of proliferative nephritis from blood transcriptomics. Here, we report use of the tool in independent datasets and found that it did not perform sufficiently well to consider replacement of the standard kidney biopsy as a diagnostic procedure.

Dysregulation of microRNAs (miRNAs) is closely associated with refractory human diseases, and the identification of potential associations between small molecule (SM) drugs and miRNAs can provide valuable insights for clinical treatment. Existing computational techniques for inferring potential associations suffer from limitations in terms of accuracy and efficiency. To address these challenges, we devise a novel predictive model called RPCA$\Gamma $NR, in which we propose a new Robust principal component analysis (PCA) framework based on $\gamma $-norm and $l_{2,1}$-norm regularization and design an Augmented Lagrange Multiplier method to optimize it, thereby deriving the association scores. The Gaussian Interaction Profile Kernel Similarity is calculated to capture the similarity information of SMs and miRNAs in known associations. Through extensive evaluation, including Cross Validation Experiments, Independent Validation Experiment, Efficiency Analysis, Ablation Experiment, Matrix Sparsity Analysis, and Case Studies, RPCA$\Gamma $NR outperforms state-of-the-art models concerning accuracy, efficiency and robustness. In conclusion, RPCA$\Gamma $NR can significantly streamline the process of determining SM-miRNA associations, thus contributing to advancements in drug development and disease treatment.

A key problem in systems biology is the discovery of regulatory mechanisms that drive phenotypic behaviour of complex biological systems in the form of multi-level networks. Modern multi-omics profiling techniques probe these fundamental regulatory networks but are often hampered by experimental restrictions leading to missing data or partially measured omics types for subsets of individuals due to cost restrictions. In such scenarios, in which missing data is present, classical computational approaches to infer regulatory networks are limited. In recent years, approaches have been proposed to infer sparse regression models in the presence of missing information. Nevertheless, these methods have not been adopted for regulatory network inference yet. In this study, we integrated regression-based methods that can handle missingness into KiMONo, a Knowledge guided Multi-Omics Network inference approach, and benchmarked their performance on commonly encountered missing data scenarios in single- and multi-omics studies. Overall, two-step approaches that explicitly handle missingness performed best for a wide range of random- and block-missingness scenarios on imbalanced omics-layers dimensions, while methods implicitly handling missingness performed best on balanced omics-layers dimensions. Our results show that robust multi-omics network inference in the presence of missing data with KiMONo is feasible and thus allows users to leverage available multi-omics data to its full extent.

The Sequence Alignment/Map (SAM) format file is the text file used to record alignment information. Alignment is the core of sequencing analysis, and downstream tasks accept mapping results for further processing. Given the rapid development of the sequencing industry today, a comprehensive understanding of the SAM format and related tools is necessary to meet the challenges of data processing and analysis. This paper is devoted to retrieving knowledge in the broad field of SAM. First, the format of SAM is introduced to understand the overall process of the sequencing analysis. Then, existing work is systematically classified in accordance with generation, compression and application, and the involved SAM tools are specifically mined. Lastly, a summary and some thoughts on future directions are provided.

As the fundamental unit of a gene and its transcripts, nucleotides have enormous impacts on the gene function and evolution, and thus on phenotypes and diseases. In order to identify the key nucleotides of one specific gene, it is quite crucial to quantitatively measure the importance of each base on the gene. However, there are still no sequence-based methods of doing that. Here, we proposed Base Importance Calculator (BIC), an algorithm to calculate the importance score of each single base based on sequence information of human mRNAs and long noncoding RNAs (lncRNAs). We then confirmed its power by applying BIC to three different tasks. Firstly, we revealed that BIC can effectively evaluate the pathogenicity of both genes and single bases through single nucleotide variations. Moreover, the BIC score in The Cancer Genome Atlas somatic mutations is able to predict the prognosis of some cancers. Finally, we show that BIC can also precisely predict the transmissibility of SARS-CoV-2. The above results indicate that BIC is a useful tool for evaluating the single base importance of human mRNAs and lncRNAs.

The rising global burden of cancer has driven considerable efforts into the research and development of effective anti-cancer agents. Fortunately, with impressive advances in transcriptome profiling technology, the Connectivity Map (CMap) database has emerged as a promising and powerful drug repurposing approach. It provides an important platform for systematically discovering of the associations among genes, small-molecule compounds and diseases, and elucidating the mechanism of action of drug, contributing toward efficient anti-cancer pharmacotherapy. Moreover, CMap-based computational drug repurposing is gaining attention because of its potential to overcome the bottleneck constraints faced by traditional drug discovery in terms of cost, time and risk. Herein, we provide a comprehensive review of the applications of drug repurposing for anti-cancer drug discovery and summarize approaches for computational drug repurposing. We focus on the principle of the CMap database and novel CMap-based software/algorithms as well as their progress achieved for drug repurposing in the field of oncotherapy. This article is expected to illuminate the emerging potential of CMap in discovering effective anti-cancer drugs, thereby promoting efficient healthcare for cancer patients.

Alternative splicing (AS) is a key transcriptional regulation pathway. Recent studies have shown that AS events are associated with the occurrence of complex diseases. Various computational approaches have been developed for the detection of disease-associated AS events. In this review, we first describe the metrics used for quantitative characterization of AS events. Second, we review and discuss the three types of methods for detecting disease-associated splicing events, which are differential splicing analysis, aberrant splicing detection and splicing-related network analysis. Third, to further exploit the genetic mechanism of disease-associated AS events, we describe the methods for detecting genetic variants that potentially regulate splicing. For each type of methods, we conducted experimental comparison to illustrate their performance. Finally, we discuss the limitations of these methods and point out potential ways to address them. We anticipate that this review provides a systematic understanding of computational approaches for the analysis of disease-associated splicing.

Identifying disease-gene associations is a fundamental and critical biomedical task towards understanding molecular mechanisms, the diagnosis and treatment of diseases. It is time-consuming and expensive to experimentally verify causal links between diseases and genes. Recently, deep learning methods have achieved tremendous success in identifying candidate genes for genetic diseases. The gene prediction problem can be modeled as a link prediction problem based on the features of nodes and edges of the gene-disease graph. However, most existing researches either build homogeneous networks based on one single data source or heterogeneous networks based on multi-source data, and artificially define meta-paths, so as to learn the network representation of diseases and genes. The former cannot make use of abundant multi-source heterogeneous information, while the latter needs domain knowledge and experience when defining meta-paths, and the accuracy of the model largely depends on the definition of meta-paths. To address the aforementioned challenges above bottlenecks, we propose an end-to-end disease-gene association prediction model with parallel graph transformer network (DGP-PGTN), which deeply integrates the heterogeneous information of diseases, genes, ontologies and phenotypes. DGP-PGTN can automatically and comprehensively capture the multiple latent interactions between diseases and genes, discover the causal relationship between them and is fully interpretable at the same time. We conduct comprehensive experiments and show that DGP-PGTN outperforms the state-of-the-art methods significantly on the task of disease-gene association prediction. Furthermore, DGP-PGTN can automatically learn the implicit relationship between diseases and genes without manually defining meta paths.

The specificity of a T-cell receptor (TCR) repertoire determines personalized immune capacity. Existing methods have modeled the qualitative aspects of TCR specificity, while the quantitative aspects remained unaddressed. We developed a package, TCRanno, to quantify the specificity of TCR repertoires. We created deep-learning-based, epitope-aware vector embeddings to infer individual TCR specificity. Then we aggregated clonotype frequencies of TCRs to obtain a quantitative profile of repertoire specificity at epitope, antigen and organism levels. Applying TCRanno to 4195 TCR repertoires revealed quantitative changes in repertoire specificity upon infections, autoimmunity and cancers. Specifically, TCRanno found cytomegalovirus-specific TCRs in seronegative healthy individuals, supporting the possibility of abortive infections. TCRanno discovered age-accumulated fraction of severe acute respiratory syndrome coronavirus 2 specific TCRs in pre-pandemic samples, which may explain the aggressive symptoms and age-related severity of coronavirus disease 2019. TCRanno also identified the encounter of Hepatitis B antigens as a potential trigger of systemic lupus erythematosus. TCRanno annotations showed capability in distinguishing TCR repertoires of healthy and cancers including melanoma, lung and breast cancers. TCRanno also demonstrated usefulness to single-cell TCRseq+gene expression data analyses by isolating T-cells with the specificity of interest.

The critical first step in Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR)-associated (CRISPR-Cas) protein-mediated gene editing is recognizing a preferred protospacer adjacent motif (PAM) on target DNAs by the protein's PAM-interacting amino acids (PIAAs). Thus, accurate computational modeling of PAM recognition is useful in assisting CRISPR-Cas engineering to relax or tighten PAM requirements for subsequent applications. Here, we describe a universal computational protein design framework (UniDesign) for designing protein-nucleic acid interactions. As a proof of concept, we applied UniDesign to decode the PAM-PIAA interactions for eight Cas9 and two Cas12a proteins. We show that, given native PIAAs, the UniDesign-predicted PAMs are largely identical to the natural PAMs of all Cas proteins. In turn, given natural PAMs, the computationally redesigned PIAA residues largely recapitulated the native PIAAs (74% and 86% in terms of identity and similarity, respectively). These results demonstrate that UniDesign faithfully captures the mutual preference between natural PAMs and native PIAAs, suggesting it is a useful tool for engineering CRISPR-Cas and other nucleic acid-interacting proteins. UniDesign is open-sourced at https://github.com/tommyhuangthu/UniDesign.

Circular RNAs (circRNAs) are single-stranded and covalently closed non-coding RNA molecules originated from RNA splicing. Their functions include regulatory potential over other RNA species, such as microRNAs, messenger RNAs and RNA binding proteins. For circRNA identification, several algorithms are available and can be classified in two major types: pseudo-reference-based and split-alignment-based approaches. In general, the data generated from circRNA transcriptome initiatives is deposited on public specific databases, which provide a large amount of information on different species and functional annotations. In this review, we describe the main computational resources for the identification and characterization of circRNAs, covering the algorithms and predictive tools to evaluate its potential role in a particular transcriptomics project, including the public repositories containing relevant data and information for circRNAs, recapitulating their characteristics, reliability and amount of data reported.

Transcription factors (TFs) are key regulatory proteins that control the transcriptional rate of cells by binding short DNA sequences called transcription factor binding sites (TFBS) or motifs. Identifying and characterizing TFBS is fundamental to understanding the regulatory mechanisms governing the transcriptional state of cells. During the last decades, several experimental methods have been developed to recover DNA sequences containing TFBS. In parallel, computational methods have been proposed to discover and identify TFBS motifs based on these DNA sequences. This is one of the most widely investigated problems in bioinformatics and is referred to as the motif discovery problem. In this manuscript, we review classical and novel experimental and computational methods developed to discover and characterize TFBS motifs in DNA sequences, highlighting their advantages and drawbacks. We also discuss open challenges and future perspectives that could fill the remaining gaps in the field.

Since the 1980s, dozens of computational methods have addressed the problem of predicting RNA secondary structure. Among them are those that follow standard optimization approaches and, more recently, machine learning (ML) algorithms. The former were repeatedly benchmarked on various datasets. The latter, on the other hand, have not yet undergone extensive analysis that could suggest to the user which algorithm best fits the problem to be solved. In this review, we compare 15 methods that predict the secondary structure of RNA, of which 6 are based on deep learning (DL), 3 on shallow learning (SL) and 6 control methods on non-ML approaches. We discuss the ML strategies implemented and perform three experiments in which we evaluate the prediction of (I) representatives of the RNA equivalence classes, (II) selected Rfam sequences and (III) RNAs from new Rfam families. We show that DL-based algorithms (such as SPOT-RNA and UFold) can outperform SL and traditional methods if the data distribution is similar in the training and testing set. However, when predicting 2D structures for new RNA families, the advantage of DL is no longer clear, and its performance is inferior or equal to that of SL and non-ML methods.

BACKGROUND: Ubiquitous presence of short extrachromosomal circular DNAs (eccDNAs) in eukaryotic cells has perplexed generations of biologists. Their widespread origins in the genome lacking apparent specificity led some studies to conclude their formation as random or near-random. Despite this, the search for specific formation of short eccDNA continues with a recent surge of interest in biomarker development. RESULTS: To shed new light on the conflicting views on short eccDNAs' randomness, here we present DeepCircle, a bioinformatics framework incorporating convolution- and attention-based neural networks to assess their predictability. Short human eccDNAs from different datasets indeed have low similarity in genomic locations, but DeepCircle successfully learned shared DNA sequence features to make accurate cross-datasets predictions (accuracy: convolution-based models: 79.65 ± 4.7%, attention-based models: 83.31 ± 4.18%). CONCLUSIONS: The excellent performance of our models shows that the intrinsic predictability of eccDNAs is encoded in the sequences across tissue origins. Our work demonstrates how the perceived lack of specificity in genomics data can be re-assessed by deep learning models to uncover unexpected similarity.

MOTIVATION: Viruses have coevolved with their hosts for over millions of years and learned to escape the host's immune system. Although not all genetic changes in viruses are deleterious, some significant mutations lead to the escape of neutralizing antibodies and weaken the immune system, which increases infectivity and transmissibility, thereby impeding the development of antiviral drugs or vaccines. Accurate and reliable identification of viral escape mutational sequences could be a good indicator for therapeutic design. We developed a computational model that recognizes significant mutational sequences based on escape feature identification using natural language processing along with prior knowledge of experimentally validated escape mutants. RESULTS: Our machine learning-based computational approach can recognize the significant spike protein sequences of severe acute respiratory syndrome coronavirus 2 using sequence data alone. This modelling approach can be applied to other viruses, such as influenza, monkeypox and HIV using knowledge of escape mutants and relevant protein sequence datasets. AVAILABILITY: Complete source code and pre-trained models for escape prediction of severe acute respiratory syndrome coronavirus 2 protein sequences are available on Github at https://github.com/PremSinghBist/Sars-CoV-2-Escape-Model.git. The dataset is deposited to Zenodo at: doi: 10.5281/zenodo.7142638. The Python scripts are easy to run and customize as needed. CONTACT: premsing212@jbnu.ac.kr.

The ability to identify B-cell epitopes is an essential step in vaccine design, immunodiagnostic tests and antibody production. Several computational approaches have been proposed to identify, from an antigen protein or peptide sequence, which residues are more likely to be part of an epitope, but have limited performance on relatively homogeneous data sets and lack interpretability, limiting biological insights that could otherwise be obtained. To address these limitations, we have developed epitope1D, an explainable machine learning method capable of accurately identifying linear B-cell epitopes, leveraging two new descriptors: a graph-based signature representation of protein sequences, based on our well-established Cutoff Scanning Matrix algorithm and Organism Ontology information. Our model achieved Areas Under the ROC curve of up to 0.935 on cross-validation and blind tests, demonstrating robust performance. A comprehensive comparison to alternative methods using distinct benchmark data sets was also employed, with our model outperforming state-of-the-art tools. epitope1D represents not only a significant advance in predictive performance, but also allows biologically meaningful features to be combined and used for model interpretation. epitope1D has been made available as a user-friendly web server interface and application programming interface at https://biosig.lab.uq.edu.au/epitope1d/.

Network pharmacology is an emerging area of systematic drug research that attempts to understand drug actions and interactions with multiple targets. Network pharmacology has changed the paradigm from 'one-target one-drug' to highly potent 'multi-target drug'. Despite that, this synergistic approach is currently facing many challenges particularly mining effective information such as drug targets, mechanism of action, and drug and organism interaction from massive, heterogeneous data. To overcome bottlenecks in multi-target drug discovery, computational algorithms are highly welcomed by scientific community. Machine learning (ML) and especially its subfield deep learning (DL) have seen impressive advances. Techniques developed within these fields are now able to analyze and learn from huge amounts of data in disparate formats. In terms of network pharmacology, ML can improve discovery and decision making from big data. Opportunities to apply ML occur in all stages of network pharmacology research. Examples include screening of biologically active small molecules, target identification, metabolic pathways identification, protein-protein interaction network analysis, hub gene analysis and finding binding affinity between compounds and target proteins. This review summarizes the premier algorithmic concepts of ML in network pharmacology and forecasts future opportunities, potential applications as well as several remaining challenges of implementing ML in network pharmacology. To our knowledge, this study provides the first comprehensive assessment of ML approaches in network pharmacology, and we hope that it encourages additional efforts toward the development and acceptance of network pharmacology in the pharmaceutical industry.

The analysis of super-enhancers (SEs) has recently attracted attention in elucidating the molecular mechanisms of cancer and other diseases. SEs are genomic structures that strongly induce gene expression and have been reported to contribute to the overexpression of oncogenes. Because the analysis of SEs and integrated analysis with other data are performed using large amounts of genome-wide data, artificial intelligence technology, with machine learning at its core, has recently begun to be utilized. In promoting precision medicine, it is important to consider information from SEs in addition to genomic data; therefore, machine learning technology is expected to be introduced appropriately in terms of building a robust analysis platform with a high generalization performance. In this review, we explain the history and principles of SE, and the results of SE analysis using state-of-the-art machine learning and integrated analysis with other data are presented to provide a comprehensive understanding of the current status of SE analysis in the field of medical biology. Additionally, we compared the accuracy between existing machine learning methods on the benchmark dataset and attempted to explore the kind of data preprocessing and integration work needed to make the existing algorithms work on the benchmark dataset. Furthermore, we discuss the issues and future directions of current SE analysis.

The design of enzyme catalytic stability is of great significance in medicine and industry. However, traditional methods are time-consuming and costly. Hence, a growing number of complementary computational tools have been developed, e.g. ESMFold, AlphaFold2, Rosetta, RosettaFold, FireProt, ProteinMPNN. They are proposed for algorithm-driven and data-driven enzyme design through artificial intelligence (AI) algorithms including natural language processing, machine learning, deep learning, variational autoencoder/generative adversarial network, message passing neural network (MPNN). In addition, the challenges of design of enzyme catalytic stability include insufficient structured data, large sequence search space, inaccurate quantitative prediction, low efficiency in experimental validation and a cumbersome design process. The first principle of the enzyme catalytic stability design is to treat amino acids as the basic element. By designing the sequence of an enzyme, the flexibility and stability of the structure are adjusted, thus controlling the catalytic stability of the enzyme in a specific industrial environment or in an organism. Common indicators of design goals include the change in denaturation energy (ΔΔG), melting temperature (ΔTm), optimal temperature (Topt), optimal pH (pHopt), etc. In this review, we summarized and evaluated the enzyme design in catalytic stability by AI in terms of mechanism, strategy, data, labeling, coding, prediction, testing, unit, integration and prospect.