A Useful Tool for the Identification of DNA-binding Proteins Using Graph Convolutional Network

2020 ◽  
Vol 18 ◽  
Author(s):  
Dasheng Chen ◽  
Leyi Wei
Keyword(s):  
Neural Networks ◽  
Dna Binding ◽  
Protein Sequence ◽  
Binding Proteins ◽  
Dna Binding Proteins ◽  
Protein Classification ◽  
Sequence Information ◽  
Convolutional Network ◽  
Data Set ◽  
Graph Neural Networks

Background:: Both DNAs and proteins are important components of living organisms. DNA-binding proteins are a kind of helicase, which is a protein specifically responsible for binding to DNA single stranded regions. It plays a key role in the function of various biomolecules. Although there are some prediction methods for the DNA-binding proteins sequences, the use of graph neural networks in this research is still limited. Objective:: In this article, using graph neural networks, we developed a novel predictor GCN-DBP for protein classification prediction. Method:: Each protein sequence is treated as a document in this study, and then document is segmented according to the concept of k-mer. This research aims to use document word relationships and word co-occurrence as a corpus to construct a text graph. Then, the predictor learns protein sequence information by two-layer graph convolutional networks. Results:: In order to compare the proposed method with other four existing methods, we have conducted more experiments. Finally, we tested GCN-DBP on the independent data set PDB2272. Its accuracy reached 64.17% and MCC reached 28.32%. Conclusion:: The results show that the proposed method is superior to the other four methods and will be a useful tool for protein classification.

scholarly journals Protein Sequence Comparison and DNA-binding Protein Identification with Generalized PseAAC and Graphical Representation

2018 ◽  
Vol 21 (2) ◽  
pp. 100-110 ◽  
Author(s):  
Chun Li ◽  
Jialing Zhao ◽  
Changzhong Wang ◽  
Yuhua Yao
Keyword(s):  
Dna Binding ◽  
Protein Sequence ◽  
Protein Identification ◽  
Binding Proteins ◽  
Graphical Representation ◽  
Sequence Data ◽  
Protein Sequences ◽  
Dna Binding Proteins ◽  
Support Vector ◽  
Letter Sequence

Aim and Objective: The rapid increase in the amount of protein sequence data available leads to an urgent need for novel computational algorithms to analyze and compare these sequences. This study is undertaken to develop an efficient computational approach for timely encoding protein sequences and extracting the hidden information. Methods: Based on two physicochemical properties of amino acids, a protein primary sequence was converted into a three-letter sequence, and then a graph without loops and multiple edges and its geometric line adjacency matrix were obtained. A generalized PseAAC (pseudo amino acid composition) model was thus constructed to characterize a protein sequence numerically. Results: By using the proposed mathematical descriptor of a protein sequence, similarity comparisons among β-globin proteins of 17 species and 72 spike proteins of coronaviruses were made, respectively. The resulting clusters agreed well with the established taxonomic groups. In addition, a generalized PseAAC based SVM (support vector machine) model was developed to identify DNA-binding proteins. Experiment results showed that our method performed better than DNAbinder, DNA-Prot, iDNA-Prot and enDNA-Prot by 3.29-10.44% in terms of ACC, 0.056-0.206 in terms of MCC, and 1.45-15.76% in terms of F1M. When the benchmark dataset was expanded with negative samples, the presented approach outperformed the four previous methods with improvement in the range of 2.49-19.12% in terms of ACC, 0.05-0.32 in terms of MCC, and 3.82- 33.85% in terms of F1M. Conclusion: These results suggested that the generalized PseAAC model was very efficient for comparison and analysis of protein sequences, and very competitive in identifying DNA-binding proteins.

scholarly journals A Model Stacking Framework for Identifying DNA Binding Proteins by Orchestrating Multi-View Features and Classifiers

Genes ◽  
2018 ◽  
Vol 9 (8) ◽  
pp. 394 ◽  
Author(s):  
Xiu-Juan Liu ◽  
Xiu-Jun Gong ◽  
Hua Yu ◽  
Jia-Hui Xu
Keyword(s):  
Dna Binding ◽  
Binding Proteins ◽  
Structural Information ◽  
Dna Binding Proteins ◽  
Feature Representation ◽  
Training Dataset ◽  
Evolutionary Information ◽  
Sequence Information ◽  
Coupled Models ◽  
Loosely Coupled

Nowadays, various machine learning-based approaches using sequence information alone have been proposed for identifying DNA-binding proteins, which are crucial to many cellular processes, such as DNA replication, DNA repair and DNA modification. Among these methods, building a meaningful feature representation of the sequences and choosing an appropriate classifier are the most trivial tasks. Disclosing the significances and contributions of different feature spaces and classifiers to the final prediction is of the utmost importance, not only for the prediction performances, but also the practical clues of biological experiment designs. In this study, we propose a model stacking framework by orchestrating multi-view features and classifiers (MSFBinder) to investigate how to integrate and evaluate loosely-coupled models for predicting DNA-binding proteins. The framework integrates multi-view features including Local_DPP, 188D, Position-Specific Scoring Matrix (PSSM)_DWT and autocross-covariance of secondary structures(AC_Struc), which were extracted based on evolutionary information, sequence composition, physiochemical properties and predicted structural information, respectively. These features are fed into various loosely-coupled classifiers such as SVM and random forest. Then, a logistic regression model was applied to evaluate the contributions of these individual classifiers and to make the final prediction. When performing on the training dataset PDB1075, the proposed method achieves an accuracy of 83.53%. On the independent dataset PDB186, the method achieves an accuracy of 81.72%, which outperforms many existing methods. These results suggest that the framework is able to orchestrate various predicted models flexibly with good performances.

scholarly journals PredPSD: A Gradient Tree Boosting Approach for Single-Stranded and Double-Stranded DNA Binding Protein Prediction

Molecules ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 98 ◽  
Author(s):  
Changgeng Tan ◽  
Tong Wang ◽  
Wenyi Yang ◽  
Lei Deng
Keyword(s):  
Dna Binding ◽  
Binding Proteins ◽  
Dna Binding Proteins ◽  
Computational Method ◽  
Sequence Information ◽  
Feature Subset ◽  
Single Stranded Dna ◽  
Cell Functions ◽  
Double Stranded Dna ◽  
Maximal Relevance

Interactions between proteins and DNAs play essential roles in many biological processes. DNA binding proteins can be classified into two categories. Double-stranded DNA-binding proteins (DSBs) bind to double-stranded DNA and are involved in a series of cell functions such as gene expression and regulation. Single-stranded DNA-binding proteins (SSBs) are necessary for DNA replication, recombination, and repair and are responsible for binding to the single-stranded DNA. Therefore, the effective classification of DNA-binding proteins is helpful for functional annotations of proteins. In this work, we propose PredPSD, a computational method based on sequence information that accurately predicts SSBs and DSBs. It introduces three novel feature extraction algorithms. In particular, we use the autocross-covariance (ACC) transformation to transform feature matrices into fixed-length vectors. Then, we put the optimal feature subset obtained by the minimal-redundancy-maximal-relevance criterion (mRMR) feature selection algorithm into the gradient tree boosting (GTB). In 10-fold cross-validation based on a benchmark dataset, PredPSD achieves promising performances with an AUC score of 0.956 and an accuracy of 0.912, which are better than those of existing methods. Moreover, our method has significantly improved the prediction accuracy in independent testing. The experimental results show that PredPSD can significantly recognize the binding specificity and differentiate DSBs and SSBs.

Identification of DNA-Binding Proteins by Multiple Kernel Support Vector Machine and Sequence Information

2020 ◽  
Vol 17 (4) ◽  
pp. 302-310
Author(s):  
Yijie Ding ◽  
Feng Chen ◽  
Xiaoyi Guo ◽  
Jijun Tang ◽  
Hongjie Wu
Keyword(s):  
Support Vector Machine ◽  
Dna Binding ◽  
Binding Proteins ◽  
Dna Binding Proteins ◽  
Computational Method ◽  
Support Vector ◽  
Sequence Information ◽  
Data Sets ◽  
Multiple Kernel ◽  
Kernel Support Vector Machine

Background: The DNA-binding proteins is an important process in multiple biomolecular functions. However, the tradition experimental methods for DNA-binding proteins identification are still time consuming and extremely expensive. Objective: In past several years, various computational methods have been developed to detect DNAbinding proteins. However, most of them do not integrate multiple information. Methods: In this study, we propose a novel computational method to predict DNA-binding proteins by two steps Multiple Kernel Support Vector Machine (MK-SVM) and sequence information. Firstly, we extract several feature and construct multiple kernels. Then, multiple kernels are linear combined by Multiple Kernel Learning (MKL). At last, a final SVM model, constructed by combined kernel, is built to predict DNA-binding proteins. Results: The proposed method is tested on two benchmark data sets. Compared with other existing method, our approach is comparable, even better than other methods on some data sets. Conclusion: We can conclude that MK-SVM is more suitable than common SVM, as the classifier for DNA-binding proteins identification.

scholarly journals PredDBP-Stack: Prediction of DNA-Binding Proteins from HMM Profiles using a Stacked Ensemble Method

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Jun Wang ◽  
Huiwen Zheng ◽  
Yang Yang ◽  
Wanyue Xiao ◽  
Taigang Liu
Keyword(s):  
Dna Binding ◽  
Binding Proteins ◽  
Transition Probability ◽  
Dna Binding Proteins ◽  
Computational Method ◽  
Superior Performance ◽  
Sequence Information ◽  
Experimental Approaches ◽  
Wet Lab ◽  
Two Stages

DNA-binding proteins (DBPs) play vital roles in all aspects of genetic activities. However, the identification of DBPs by using wet-lab experimental approaches is often time-consuming and laborious. In this study, we develop a novel computational method, called PredDBP-Stack, to predict DBPs solely based on protein sequences. First, amino acid composition (AAC) and transition probability composition (TPC) extracted from the hidden markov model (HMM) profile are adopted to represent a protein. Next, we establish a stacked ensemble model to identify DBPs, which involves two stages of learning. In the first stage, the four base classifiers are trained with the features of HMM-based compositions. In the second stage, the prediction probabilities of these base classifiers are used as inputs to the meta-classifier to perform the final prediction of DBPs. Based on the PDB1075 benchmark dataset, we conduct a jackknife cross validation with the proposed PredDBP-Stack predictor and obtain a balanced sensitivity and specificity of 92.47% and 92.36%, respectively. This outcome outperforms most of the existing classifiers. Furthermore, our method also achieves superior performance and model robustness on the PDB186 independent dataset. This demonstrates that the PredDBP-Stack is an effective classifier for accurately identifying DBPs based on protein sequence information alone.

scholarly journals Sequence Based DNA-Binding Protein Prediction

2021 ◽  
Vol 9 (6) ◽  
pp. 44-48
Author(s):  
Farisa T S ◽  
Elizabeth Isaac
Keyword(s):  
Dna Binding ◽  
Protein Sequence ◽  
Solvent Accessibility ◽  
Binding Protein ◽  
Differential Evolution Algorithm ◽  
Prediction Method ◽  
Dna Binding Protein ◽  
Support Vector ◽  
Sequence Information ◽  
Data Set

Protein and DNA have vital role in our biological processes. For accurately predicting DNA binding protein, develop a new sequence based prediction method from the protein sequence. Sequence based method only considers the protein sequence information as input. For accurately predicting DBP, first develop a reliable benchmark data set from the protein data bank. Second, using Amino Acid Composition (AAC), Position Specific Scoring Matrix (PSSM), Predicted Solvent Accessibility (PSA), and Predicted Probabilities of DNA-Binding Sites (PDBS) to produce four specific protein sequence baselines. Using a differential evolution algorithm, weights of the properties are taught. Based on those attained properties, merge the characteristics with weights to create an original super feature. And tensor-flow is used to paralyze the weights. A suitable feature selection algorithm of tensor flow’s binary classifier is used to extract the excellent subset from weighted feature vector. The training sample set is obtained in the training process, after generating final features. The classification is learned through the support vector machine and the tensor flow. And the output is measured using a tensor surface. The choice is done on the basis of threshold of likelihood and protein with above-threshold chance is considered to be DBP and others are non-DBP.

scholarly journals Identification of DNA-Binding Proteins Using Support Vector Machine with Sequence Information

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xin Ma ◽  
Jiansheng Wu ◽  
Xiaoyun Xue
Keyword(s):  
Support Vector Machine ◽  
Dna Binding ◽  
Binding Proteins ◽  
Query Protein ◽  
Dna Binding Proteins ◽  
Evolutionary Information ◽  
Support Vector ◽  
Sequence Information ◽  
Novel Approach ◽  
Matthew’S Correlation Coefficient

DNA-binding proteins are fundamentally important in understanding cellular processes. Thus, the identification of DNA-binding proteins has the particularly important practical application in various fields, such as drug design. We have proposed a novel approach method for predicting DNA-binding proteins using only sequence information. The prediction model developed in this study is constructed by support vector machine-sequential minimal optimization (SVM-SMO) algorithm in conjunction with a hybrid feature. The hybrid feature is incorporating evolutionary information feature, physicochemical property feature, and two novel attributes. These two attributes use DNA-binding residues and nonbinding residues in a query protein to obtain DNA-binding propensity and nonbinding propensity. The results demonstrate that our SVM-SMO model achieves 0.67 Matthew's correlation coefficient (MCC) and 89.6% overall accuracy with 88.4% sensitivity and 90.8% specificity, respectively. Performance comparisons on various features indicate that two novel attributes contribute to the performance improvement. In addition, our SVM-SMO model achieves the best performance than state-of-the-art methods on independent test dataset.

scholarly journals DeepDBP: Deep neural networks for identification of DNA-binding proteins

2020 ◽  
Vol 19 ◽  
pp. 100318 ◽  
Author(s):  
Shadman Shadab ◽  
Md Tawab Alam Khan ◽  
Nazia Afrin Neezi ◽  
Sheikh Adilina ◽  
Swakkhar Shatabda
Keyword(s):  
Neural Networks ◽  
Dna Binding ◽  
Binding Proteins ◽  
Deep Neural Networks ◽  
Dna Binding Proteins
Sign in / Sign up

Export Citation Format

Share Document