Your browser doesn't support javascript.
loading
: 20 | 50 | 100
1 - 7 de 7
2.
Brief Bioinform ; 25(1)2023 11 22.
Article En | MEDLINE | ID: mdl-38145947

Determining the RNA binding preferences remains challenging because of the bottleneck of the binding interactions accompanied by subtle RNA flexibility. Typically, designing RNA inhibitors involves screening thousands of potential candidates for binding. Accurate binding site information can increase the number of successful hits even with few candidates. There are two main issues regarding RNA binding preference: binding site prediction and binding dynamical behavior prediction. Here, we propose one interpretable network-based approach, RNet, to acquire precise binding site and binding dynamical behavior information. RNetsite employs a machine learning-based network decomposition algorithm to predict RNA binding sites by analyzing the local and global network properties. Our research focuses on large RNAs with 3D structures without considering smaller regulatory RNAs, which are too small and dynamic. Our study shows that RNetsite outperforms existing methods, achieving precision values as high as 0.701 on TE18 and 0.788 on RB9 tests. In addition, RNetsite demonstrates remarkable robustness regarding perturbations in RNA structures. We also developed RNetdyn, a distance-based dynamical graph algorithm, to characterize the interface dynamical behavior consequences upon inhibitor binding. The simulation testing of competitive inhibitors indicates that RNetdyn outperforms the traditional method by 30%. The benchmark testing results demonstrate that RNet is highly accurate and robust. Our interpretable network algorithms can assist in predicting RNA binding preferences and accelerating RNA inhibitor design, providing valuable insights to the RNA research community.


Computational Biology , RNA-Binding Proteins , Computational Biology/methods , RNA-Binding Proteins/metabolism , Algorithms , Binding Sites , RNA/metabolism
3.
Int J Mol Sci ; 24(6)2023 Mar 13.
Article En | MEDLINE | ID: mdl-36982570

RNA regulates various biological processes, such as gene regulation, RNA splicing, and intracellular signal transduction. RNA's conformational dynamics play crucial roles in performing its diverse functions. Thus, it is essential to explore the flexibility characteristics of RNA, especially pocket flexibility. Here, we propose a computational approach, RPflex, to analyze pocket flexibility using the coarse-grained network model. We first clustered 3154 pockets into 297 groups by similarity calculation based on the coarse-grained lattice model. Then, we introduced the flexibility score to quantify the flexibility by global pocket features. The results show strong correlations between the flexibility scores and root-mean-square fluctuation (RMSF) values, with Pearson correlation coefficients of 0.60, 0.76, and 0.53 in Testing Sets I-III. Considering both flexibility score and network calculations, the Pearson correlation coefficient was increased to 0.71 in flexible pockets on Testing Set IV. The network calculations reveal that the long-range interaction changes contributed most to flexibility. In addition, the hydrogen bonds in the base-base interactions greatly stabilize the RNA structure, while backbone interactions determine RNA folding. The computational analysis of pocket flexibility could facilitate RNA engineering for biological or medical applications.


RNA , RNA/genetics , Nucleic Acid Conformation
4.
Life (Basel) ; 13(3)2023 Mar 01.
Article En | MEDLINE | ID: mdl-36983828

Proteins and RNAs are primary biomolecules that are involved in most biological processes [...].

5.
Int J Mol Sci ; 23(13)2022 Jun 21.
Article En | MEDLINE | ID: mdl-35805909

RNA-protein complexes regulate a variety of biological functions. Thus, it is essential to explore and visualize RNA-protein structural interaction features, especially pocket interactions. In this work, we develop an easy-to-use bioinformatics resource: RPpocket. This database provides RNA-protein complex interactions based on sequence, secondary structure, and pocket topology analysis. We extracted 793 pockets from 74 non-redundant RNA-protein structures. Then, we calculated the binding- and non-binding pocket topological properties and analyzed the binding mechanism of the RNA-protein complex. The results showed that the binding pockets were more extended than the non-binding pockets. We also found that long-range forces were the main interaction for RNA-protein recognition, while short-range forces strengthened and optimized the binding. RPpocket could facilitate RNA-protein engineering for biological or medical applications.


Proteins , RNA , Binding Sites , Databases, Protein , Ligands , Models, Molecular , Proteins/chemistry
6.
Phys Chem Chem Phys ; 24(17): 10124-10133, 2022 May 04.
Article En | MEDLINE | ID: mdl-35416807

Evaluating the protein-ligand binding affinity is a substantial part of the computer-aided drug discovery process. Most of the proposed computational methods predict protein-ligand binding affinity using either limited full-length protein 3D structures or simple full-length protein sequences as the input features. Thus, protein-ligand binding affinity prediction remains a fundamental challenge in drug discovery. In this study, we proposed a novel deep learning-based approach, DLSSAffinity, to accurately predict the protein-ligand binding affinity. Unlike the existing methods, DLSSAffinity uses the pocket-ligand structural pairs as the local information to predict short-range direct interactions. Besides, DLSSAffinity also uses the full-length protein sequence and ligand SMILES as the global information to predict long-range indirect interactions. We tested DLSSAffinity on the PDBbind benchmark. The results showed that DLSSAffinity achieves Pearson's R = 0.79, RMSE = 1.40, and SD = 1.35 on the test set. Comparing DLSSAffinity with the existing state-of-the-art deep learning-based binding affinity prediction methods, the DLSSAffinity model outperforms other models. These results demonstrate that combining global sequence and local structure information as the input features of a deep learning model can improve the accuracy of protein-ligand binding affinity prediction.


Deep Learning , Amino Acid Sequence , Ligands , Protein Binding , Proteins/chemistry
7.
BMC Bioinformatics ; 20(1): 617, 2019 Nov 29.
Article En | MEDLINE | ID: mdl-31783725

BACKGROUND: The kinase pocket structural information is important for drug discovery targeting cancer or other diseases. Although some kinase sequence, structure or drug databases have been developed, the databases cannot be directly used in the kinase drug study. Therefore, a comprehensive database of human kinase protein pockets is urgently needed to be developed. RESULTS: Here, we have developed HKPocket, a comprehensive Human Kinase Pocket database. This database provides sequence, structure, hydrophilic-hydrophobic, critical interactions, and druggability information including 1717 pockets from 255 kinases. We further divided these pockets into 91 pocket clusters using structural and position features in each kinase group. The pocket structural information would be useful for preliminary drug screening. Then, the potential drugs can be further selected and optimized by analyzing the sequence conservation, critical interactions, and hydrophobicity of identified drug pockets. HKPocket also provides online visualization and pse files of all identified pockets. CONCLUSION: The HKPocket database would be helpful for drug screening and optimization. Besides, drugs targeting the non-catalytic pockets would cause fewer side effects. HKPocket is available at http://zhaoserver.com.cn/HKPocket/HKPocket.html.


Databases, Protein , Drug Design , Protein Kinases/metabolism , Software , Amino Acid Sequence , Binding Sites , Humans , Ligands , Protein Conformation , Protein Kinases/chemistry
...