Post-translational modifications are important for regulating cellular functions. Although traditional experimental methods accurately identify PTM sites, they are time-consuming. In this study, we propose a novel model capable of predicting 17 types of PTMs through multi-modal integration and AlphaFold predictions. Our model employs an enhanced CNN-transformer architecture to capture local dependencies within the sequence, while incorporating structural features and evolutionary patterns to effectively capture complex spatial relationships and global contextual dependencies. Through rigorous cross-validation and testing, our model demonstrates exceptional performance, achieving area under the curve scores of 96.5%, 91.6%, 91.0%, and 89.5% for the prediction of hydroxylation, malonylation, O-linked glycosylation, and phosphorylation, respectively. Notably, our model accurately identified known phosphorylation sites on tau and two recently identified residues linked to pre-tangle stages and early Alzheimer's disease pathology. This work not only deepens the understanding of PTMs but also holds promise for advancing future research in the prediction of PTM sites and functional annotation.

Abstract Motivation Membrane permeability represents a critical bottleneck in cyclic peptide drug development, limiting the clinical translation of these therapeutically attractive molecules despite their inherent stability and structural diversity. Current computational models for predicting cyclic peptide membrane permeability (CPMP) exhibit insufficient accuracy for early-stage drug screening, hampering the efficiency of lead optimization in pharmaceutical pipelines. Methodology In this study, we introduce a novel multi-source feature fusion model called MSF-CPMP, which aims to increase the accuracy of predicted CPMP. The MSF-CPMP model incorporates three features extracted from SMILES sequences, graph-based molecular structures, and physicochemical properties of cyclic peptides. Results By benchmarking with other machine learning and deep learning-based methods, MSF-CPMP achieved the highest levels of the evaluation metrics such as accuracy of 0.9062 and AUROC of 0.9546, and further validated MSF-CPMP robustness in learning capabilities and efficacy of its multi-source fusion. MSF-CPMP has been validated on FDA-approved cyclic peptide therapeutics, demonstrating strong predictive power for clinical candidates. Our result demonstrates that MSF-CPMP outperforms other methods in predicting CPMP, providing a practical computational tool for accelerating drug screening and reducing attrition rates in cyclic peptide drug discovery, thereby advancing precision-guided pharmaceutical development. Availability Code is available at https://github.com/wanglabhku/MSF-CPMP

The interactions between transcription factors (TFs) and the target genes could provide a basis for constructing gene regulatory networks (GRNs) for mechanistic understanding of various biological complex processes. From gene expression data, particularly single-cell transcriptomic data containing rich cell-to-cell variations, it is highly desirable to infer TF-gene interactions (TGIs) using deep learning technologies. Numerous models or software including deep learning-based algorithms have been designed to identify transcriptional regulatory relationships between TFs and the downstream genes. However, these methods do not significantly improve predictions of TGIs due to some limitations regarding constructing underlying interactive structures linking regulatory components. In this study, we introduce a deep learning framework, DeepTGI, that encodes gene expression profiles from single-cell and/or bulk transcriptomic data and predicts TGIs with high accuracy. Our approach could fuse the features extracted from Auto-encoder with self-attention mechanism and other networks and could transform multihead attention modules to define representative features. By comparing it with other models or methods, DeepTGI exhibits its superiority to identify more potential TGIs and to reconstruct the GRNs and, therefore, could provide broader perspectives for discovery of more biological meaningful TGIs and for understanding transcriptional gene regulatory mechanisms.

MOTIVATION: Peptides and their derivatives hold potential as therapeutic agents. The rising interest in developing peptide drugs is evidenced by increasing approval rates by the FDA of USA. To identify the most potential peptides, study on peptide-protein interactions (PepPIs) presents a very important approach but poses considerable technical challenges. In experimental aspects, the transient nature of PepPIs and the high flexibility of peptides contribute to elevated costs and inefficiency. Traditional docking and molecular dynamics simulation methods require substantial computational resources, and the predictive accuracy of their results remain unsatisfactory. RESULTS: To address this gap, we proposed TPepPro, a Transformer-based model for PepPI prediction. We trained TPepPro on a dataset of 19,187 pairs of peptide-protein complexes with both sequential and structural features. TPepPro utilizes a strategy that combines local protein sequence feature extraction with global protein structure feature extraction. Moreover, TPepPro optimizes the architecture of structural featuring neural network in BN-ReLU arrangement, which notably reduced the amount of computing resources required for PepPIs prediction. According to comparison analysis, the accuracy reached 0.855 in TPepPro, achieving an 8.1% improvement compared to the second-best model TAGPPI. TPepPro achieved an AUC of 0.922, surpassing the second-best model TAGPPI with 0.844. Moreover, the newly developed TPepPro identify certain PepPIs that can be validated according to previous experimental evidence, thus indicating the efficiency of TPepPro to detect high potential PepPIs that would be helpful for amino acid drug applications. AVAILABILITY AND IMPLEMENTATION: The source code of TPepPro is available at https://github.com/wanglabhku/TPepPro.

A transcriptional regulatory network (TRN) is a collection of transcription regulators with their associated downstream genes, which is highly condition-specific. Understanding how cell states can be programmed through small molecules/drugs or conditions by modulating the whole gene expression system granted us the potential to amend abnormal cells and cure diseases. Condition Orientated Regulatory Networks (CORN, https://qinlab.sysu.edu.cn/home) is a library of condition (small molecule/drug treatments and gene knockdowns)-based transcriptional regulatory sub-networks (TRSNs) that come with an online TRSN matching tool. It allows users to browse condition-associated TRSNs or match those TRSNs by inputting transcriptomic changes of interest. CORN utilizes transcriptomic changes data after specific conditional treatment in cells, and in vivo transcription factor (TF) binding data in cells, by combining TF binding information and calculations of significant expression alterations of TFs and genes after the conditional treatments, TRNs under the effect of different conditions were constructed. In short, CORN associated 1805 different types of specific conditions (small molecule/drug treatments and gene knockdowns) to 9553 TRSNs in 25 human cell lines, involving 204TFs. By linking and curating specific conditions to responsive TRNs, the scientific community can now perceive how TRNs are altered and controlled by conditions alone in an organized manner for the first time. This study demonstrated with examples that CORN can aid the understanding of molecular pathology, pharmacology and drug repositioning, and screened drugs with high potential for cancer and coronavirus disease 2019 (COVID-19) treatments.

Cell fate conversion by overexpressing defined factors is a powerful tool in regenerative medicine. However, identifying key factors for cell fate conversion requires laborious experimental efforts; thus, many of such conversions have not been achieved yet. Nevertheless, cell fate conversions found in many published studies were incomplete as the expression of important gene sets could not be manipulated thoroughly. Therefore, the identification of master transcription factors for complete and efficient conversion is crucial to render this technology more applicable clinically. In the past decade, systematic analyses on various single-cell and bulk OMICs data have uncovered numerous gene regulatory mechanisms, and made it possible to predict master gene regulators during cell fate conversion. By virtue of the sparse structure of master transcription factors and the group structure of their simultaneous regulatory effects on the cell fate conversion process, this study introduces a novel computational method predicting master transcription factors based on group sparse optimization technique integrating data from multi-OMICs levels, which can be applicable to both single-cell and bulk OMICs data with a high tolerance of data sparsity. When it is compared with current prediction methods by cross-referencing published and validated master transcription factors, it possesses superior performance. In short, this method facilitates fast identification of key regulators, give raise to the possibility of higher successful conversion rate and in the hope of reducing experimental cost.

In this paper, we investigate a group sparse optimization problem via $\ell_{p,q}$ regularization in three aspects: theory, algorithm and application. In the theoretical aspect, by introducing a notion of group restricted eigenvalue condition, we establish an oracle property and a global recovery bound of order $\mathcal{O}(\lambda^\frac{2}{2-q})$ for any point in a level set of the $\ell_{p,q}$ regularization problem, and by virtue of modern variational analysis techniques, we also provide a local analysis of recovery bound of order $\mathcal{O}(\lambda^2)$ for a path of local minima. In the algorithmic aspect, we apply the well-known proximal gradient method to solve the $\ell_{p,q}$ regularization problems, either by analytically solving some specific $\ell_{p,q}$ regularization subproblems, or by using the Newton method to solve general $\ell_{p,q}$ regularization subproblems. In particular, we establish a local linear convergence rate of the proximal gradient method for solving the $\ell_{1,q}$ regularization problem under some mild conditions and by first proving a second-order growth condition. As a consequence, the local linear convergence rate of proximal gradient method for solving the usual $\ell_{q}$ regularization problem ($0<q<1$) is obtained. Finally in the aspect of application, we present some numerical results on both the simulated data and the real data in gene transcriptional regulation.

MOTIVATION: Inferring gene-regulatory networks is very crucial in decoding various complex mechanisms in biological systems. Synthesis of a fully functional transcriptional factor/protein from DNA involves series of reactions, leading to a delay in gene regulation. The complexity increases with the dynamic delay induced by other small molecules involved in gene regulation, and noisy cellular environment. The dynamic delay in gene regulation is quite evident in high-temporal live cell lineage-imaging data. Although a number of gene-network-inference methods are proposed, most of them ignore the associated dynamic time delay. RESULTS: Here, we propose DDGni (dynamic delay gene-network inference), a novel gene-network-inference algorithm based on the gapped local alignment of gene-expression profiles. The local alignment can detect short-term gene regulations, that are usually overlooked by traditional correlation and mutual Information based methods. DDGni uses 'gaps' to handle the dynamic delay and non-uniform sampling frequency in high-temporal data, like live cell imaging data. Our algorithm is evaluated on synthetic and yeast cell cycle data, and Caenorhabditis elegans live cell imaging data against other prominent methods. The area under the curve of our method is significantly higher when compared to other methods on all three datasets. AVAILABILITY: The program, datasets and supplementary files are available at http://www.jjwanglab.org/DDGni/.