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 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.

Prediction of DNA-binding proteins by interaction fusion feature representation and selective ensemble

2019 ◽  
Vol 163 ◽  
pp. 598-610 ◽  
Author(s):  
Wenjie You ◽  
Zijiang Yang ◽  
Guangbao Guo ◽  
Xiu-Feng Wan ◽  
Guoli Ji
Keyword(s):  
Dna Binding ◽  
Binding Proteins ◽  
Dna Binding Proteins ◽  
Feature Representation ◽  
Selective Ensemble ◽  
Fusion Feature

A Review of DNA-binding Proteins Prediction Methods

2019 ◽  
Vol 14 (3) ◽  
pp. 246-254 ◽  
Author(s):  
Kaiyang Qu ◽  
Leyi Wei ◽  
Quan Zou
Keyword(s):  
Machine Learning ◽  
Dna Binding ◽  
Binding Proteins ◽  
Dna Binding Proteins ◽  
Feature Representation ◽  
Biological Information ◽  
Prediction Methods ◽  
And Performance ◽  
Future Work ◽  
Work First

Background:DNA-binding proteins, binding to DNA, widely exist in living cells, participating in many cell activities. They can participate some DNA-related cell activities, for instance DNA replication, transcription, recombination, and DNA repair.Objective:Given the importance of DNA-binding proteins, studies for predicting the DNA-binding proteins have been a popular issue over the past decades. In this article, we review current machine-learning methods which research on the prediction of DNA-binding proteins through feature representation methods, classifiers, measurements, dataset and existing web server.Method:The prediction methods of DNA-binding protein can be divided into two types, based on amino acid composition and based on protein structure. In this article, we accord to the two types methods to introduce the application of machine learning in DNA-binding proteins prediction.Results:Machine learning plays an important role in the classification of DNA-binding proteins, and the result is better. The best ACC is above 80%.Conclusion:Machine learning can be widely used in many aspects of biological information, especially in protein classification. Some issues should be considered in future work. First, the relationship between the number of features and performance must be explored. Second, many features are used to predict DNA-binding proteins and propose solutions for high-dimensional spaces.

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.

scholarly journals enDNA-Prot: Identification of DNA-Binding Proteins by Applying Ensemble Learning

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Ruifeng Xu ◽  
Jiyun Zhou ◽  
Bin Liu ◽  
Lin Yao ◽  
Yulan He ◽  
...  
Keyword(s):  
Dna Binding ◽  
Ensemble Learning ◽  
Protein Identification ◽  
Binding Proteins ◽  
Binding Protein ◽  
Regulation Of Gene Expression ◽  
Dna Binding Protein ◽  
Dna Binding Proteins ◽  
Training Dataset ◽  
Regulation Of Transcription

DNA-binding proteins are crucial for various cellular processes, such as recognition of specific nucleotide, regulation of transcription, and regulation of gene expression. Developing an effective model for identifying DNA-binding proteins is an urgent research problem. Up to now, many methods have been proposed, but most of them focus on only one classifier and cannot make full use of the large number of negative samples to improve predicting performance. This study proposed a predictor called enDNA-Prot for DNA-binding protein identification by employing the ensemble learning technique. Experiential results showed that enDNA-Prot was comparable with DNA-Prot and outperformed DNAbinder and iDNA-Prot with performance improvement in the range of 3.97–9.52% in ACC and 0.08–0.19 in MCC. Furthermore, when the benchmark dataset was expanded with negative samples, the performance of enDNA-Prot outperformed the three existing methods by 2.83–16.63% in terms of ACC and 0.02–0.16 in terms of MCC. It indicated that enDNA-Prot is an effective method for DNA-binding protein identification and expanding training dataset with negative samples can improve its performance. For the convenience of the vast majority of experimental scientists, we developed a user-friendly web-server for enDNA-Prot which is freely accessible to the public.

Sign in / Sign up

Export Citation Format

Share Document