scholarly journals Prediction of post-translational modification sites using multiple kernel support vector machine

PeerJ ◽  
2017 ◽  
Vol 5 ◽  
pp. e3261 ◽  
Author(s):  
BingHua Wang ◽  
Minghui Wang ◽  
Ao Li
Keyword(s):  
Protein Function ◽  
Predictive Performance ◽  
Computational Prediction ◽  
Computational Method ◽  
Support Vector ◽  
Prediction Methods ◽  
Sequence Information ◽  
Post Translational Modification ◽  
Multiple Kernel ◽  
Local Sequence

Protein post-translational modification (PTM) is an important mechanism that is involved in the regulation of protein function. Considering the high-cost and labor-intensive of experimental identification, many computational prediction methods are currently available for the prediction of PTM sites by using protein local sequence information in the context of conserved motif. Here we proposed a novel computational method by using the combination of multiple kernel support vector machines (SVM) for predicting PTM sites including phosphorylation, O-linked glycosylation, acetylation, sulfation and nitration. To largely make use of local sequence information and site-modification relationships, we developed a local sequence kernel and Gaussian interaction profile kernel, respectively. Multiple kernels were further combined to train SVM for efficiently leveraging kernel information to boost predictive performance. We compared the proposed method with existing PTM prediction methods. The experimental results revealed that the proposed method performed comparable or better performance than the existing prediction methods, suggesting the feasibility of the developed kernels and the usefulness of the proposed method in PTM sites prediction.

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 Mal-Prec: computational prediction of protein Malonylation sites via machine learning based feature integration

BMC Genomics ◽  
2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Xin Liu ◽  
Liang Wang ◽  
Jian Li ◽  
Junfeng Hu ◽  
Xiao Zhang
Keyword(s):  
Cross Validation ◽  
Chemical Properties ◽  
Principal Component ◽  
Computational Prediction ◽  
Computational Method ◽  
Support Vector ◽  
Data Sets ◽  
Post Translational Modification ◽  
Human Proteins ◽  
Fold Cross Validation

Abstract Background Malonylation is a recently discovered post-translational modification that is associated with a variety of diseases such as Type 2 Diabetes Mellitus and different types of cancers. Compared with experimental identification of malonylation sites, computational method is a time-effective process with comparatively low costs. Results In this study, we proposed a novel computational model called Mal-Prec (Malonylation Prediction) for malonylation site prediction through the combination of Principal Component Analysis and Support Vector Machine. One-hot encoding, physio-chemical properties, and composition of k-spaced acid pairs were initially performed to extract sequence features. PCA was then applied to select optimal feature subsets while SVM was adopted to predict malonylation sites. Five-fold cross-validation results showed that Mal-Prec can achieve better prediction performance compared with other approaches. AUC (area under the receiver operating characteristic curves) analysis achieved 96.47 and 90.72% on 5-fold cross-validation of independent data sets, respectively. Conclusion Mal-Prec is a computationally reliable method for identifying malonylation sites in protein sequences. It outperforms existing prediction tools and can serve as a useful tool for identifying and discovering novel malonylation sites in human proteins. Mal-Prec is coded in MATLAB and is publicly available at https://github.com/flyinsky6/Mal-Prec, together with the data sets used in this study.

A novel network-based computational method to predict protein phosphorylation on tyrosine sites

2015 ◽  
Vol 13 (06) ◽  
pp. 1542005 ◽  
Author(s):  
Binghua Wang ◽  
Minghui Wang ◽  
Yujie Jiang ◽  
Dongdong Sun ◽  
Xiaoyi Xu
Keyword(s):  
Tyrosine Phosphorylation ◽  
Computational Methods ◽  
Computational Method ◽  
Superior Performance ◽  
Sequence Information ◽  
Bayesian Decision ◽  
Post Translational Modification ◽  
Cellular Processes ◽  
Local Sequence

Phosphorylation plays a great role in regulating a variety of cellular processes and the identification of tyrosine phosphorylation sites is fundamental for understanding the post-translational modification (PTM) regulation processes. Although a lot of computational methods have been developed, most of them only concern local sequence information and few studies focus on the tyrosine sites with in situ PTM information, which refers to different types of PTM occurring on the same modification site. In this study, by constructing the site-modification network that efficiently incorporates in situ PTM information, we introduce a novel network-based computational method, site-modification network-based inference (SMNBI) to predict tyrosine phosphorylation. In order to verify the effectiveness of the proposed method, we compare it with other network-based computational methods. The results clearly show the superior performance of SMNBI. Besides, we extensively compare SMNBI with other sequence-based methods including SVM and Bayesian decision theory. The evaluation demonstrates the power of site-modification network in predicting tyrosine phosphorylation. The proposed method is freely available at http://bioinformatics.ustc.edu.cn/smnbi/ .

scholarly journals Characterization and identification of lysine crotonylation sites based on machine learning method on both plant and mammalian

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Rulan Wang ◽  
Zhuo Wang ◽  
Hongfei Wang ◽  
Yuxuan Pang ◽  
Tzong-Yi Lee
Keyword(s):  
Machine Learning ◽  
Predictive Performance ◽  
Support Vector ◽  
Machine Learning Method ◽  
Learning Method ◽  
Post Translational Modification ◽  
Cellular Regulation ◽  
Histone Protein ◽  
Independent Test ◽  
Small Dataset

AbstractLysine crotonylation (Kcr) is a type of protein post-translational modification (PTM), which plays important roles in a variety of cellular regulation and processes. Several methods have been proposed for the identification of crotonylation. However, most of these methods can predict efficiently only on histone or non-histone protein. Therefore, this work aims to give a more balanced performance in different species, here plant (non-histone) and mammalian (histone) are involved. SVM (support vector machine) and RF (random forest) were employed in this study. According to the results of cross-validations, the RF classifier based on EGAAC attribute achieved the best predictive performance which performs competitively good as existed methods, meanwhile more robust when dealing with imbalanced datasets. Moreover, an independent test was carried out, which compared the performance of this study and existed methods based on the same features or the same classifier. The classifiers of SVM and RF could achieve best performances with 92% sensitivity, 88% specificity, 90% accuracy, and an MCC of 0.80 in the mammalian dataset, and 77% sensitivity, 83% specificity, 70% accuracy and 0.54 MCC in a relatively small dataset of mammalian and a large-scaled plant dataset respectively. Moreover, a cross-species independent testing was also carried out in this study, which has proved the species diversity in plant and mammalian.

scholarly journals Incorporating Amino Acids Composition and Functional Domains for Identifying Bacterial Toxin Proteins

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Min-Gang Su ◽  
Chien-Hsun Huang ◽  
Tzong-Yi Lee ◽  
Yu-Ju Chen ◽  
Hsin-Yi Wu
Keyword(s):  
Amino Acids ◽  
Cell Biology ◽  
Predictive Performance ◽  
Computational Prediction ◽  
Amino Acid Sequences ◽  
Bacterial Toxins ◽  
Bacterial Toxin ◽  
Support Vector ◽  
Functional Domain ◽  
Domain Information

Aside from pathogenesis, bacterial toxins also have been used for medical purpose such as drugs for cancer and immune diseases. Correctly identifying bacterial toxins and their types (endotoxins and exotoxins) has great impact on the cell biology study and therapy development. However, experimental methods for bacterial toxins identification are time-consuming and labor-intensive, implying an urgent need for computational prediction. Thus, we are motivated to develop a method for computational identification of bacterial toxins based on amino acid sequences and functional domain information. In this study, a nonredundant dataset of 167 bacterial toxins including 77 exotoxins and 90 endotoxins is adopted to learn the predictive model by using support vector machines (SVMs). The cross-validation evaluation shows that the SVM models trained with amino acids and dipeptides composition could yield an accuracy of 96.07% and 92.50%, respectively. For discriminating endotoxins from exotoxins, the SVM models trained with amino acids and dipeptides composition have achieved an accuracy of 95.71% and 92.86%, respectively. After incorporating functional domain information, the predictive performance is further improved. The proposed method has been demonstrated to be able to more effectively identify and classify bacterial toxins than the other two features on independent dataset, which may aid in bacterial biomedical development.

Improving the Prediction of Protein Structural Class for Low-Similarity Sequences by Incorporating Evolutionaryand Structural Information

2016 ◽  
Vol 20 (3) ◽  
pp. 402-411 ◽  
Author(s):  
Liang Kong ◽  
◽  
Lingfu Kong ◽  
Rong Jing ◽  
Keyword(s):  
Protein Function ◽  
Structural Information ◽  
Sequence Similarity ◽  
Computational Method ◽  
Evolutionary Information ◽  
Support Vector ◽  
Local Alignment ◽  
Class Prediction ◽  
Structural Class ◽  
Protein Structural Class

Protein structural class prediction is beneficial to study protein function, regulation and interactions. However, protein structural class prediction for low-similarity sequences (i.e., below 40% in pairwise sequence similarity) remains a challenging problem at present. In this study, a novel computational method is proposed to accurately predict protein structural class for low-similarity sequences. This method is based on support vector machine in conjunction with integrated features from evolutionary information generated with position specific iterative basic local alignment search tool (PSI-BLAST) and predicted secondary structure. Various prediction accuracies evaluated by the jackknife tests are reported on two widely-used low-similarity benchmark datasets (25PDB and 1189), reaching overall accuracies 89.3% and 87.9%, which are significantly higher than those achieved by state-of-the-art in protein structural class prediction. The experimental results suggest that our method could serve as an effective alternative to existing methods in protein structural classification, especially for low-similarity sequences.

scholarly journals Computational Prediction of Protein-Protein Interactions in Plants Using Only Sequence Information

2021 ◽  
Author(s):  
Jie. Pan ◽  
Zhu Hong. You ◽  
Li Ping. Li ◽  
Chang-Qing. Yu ◽  
Xin-Ke. Zhan
Keyword(s):  
Plant Cell ◽  
Protein Interactions ◽  
Cell Function ◽  
Functional Organization ◽  
Computational Prediction ◽  
Support Vector ◽  
Svm Classifier ◽  
Sequence Information ◽  
Protein Protein Interactions ◽  
Representation Scheme

Abstract Protein-protein interactions (PPIs) in plants plays a significant role in plant biology and functional organization of cells. Although, a large amount of plant PPIs data have been generated by high-throughput techniques, but due to the complexity of plant cell, the PPIs pairs currently obtained by experimental methods cover only a small fraction of the complete plant PPIs network. In addition, the experimental approaches for identifying PPIs in plants are laborious, time-consuming, and costly. Hence, it is highly desirable to develop more efficient approaches to detect PPIs in plants. In this study, we present a novel computational model combining weighted sparse representation-based classifier (WSRC) with a novel inverse fast Fourier transform (IFFT) representation scheme which was adopted in position specific scoring matrix (PSSM) to extract features from plant protein sequence. When performed the proposed method on the plants PPIs dataset of Mazie, Rice and Arabidopsis thaliana (Arabidopsis), we achieved excellent results with high accuracies of 89.12%, 84.72% and 71.74%, respectively. To further assess the prediction performance of the proposed approach, we compared it with the state-of-art support vector machine (SVM) classifier. To the best of our knowledge, we are the first to employ protein sequences information to predict PPIs in plants. Experimental results demonstrate that the proposed method has a great potential to become a powerful tool for exploring the plant cell function.

scholarly journals Towards region-specific propagation of protein functions

2018 ◽  
Author(s):  
Da Chen Emily Koo ◽  
Richard Bonneau
Keyword(s):  
Protein Level ◽  
Protein Function ◽  
Predictive Performance ◽  
Function Prediction ◽  
Amino Acid Sequences ◽  
Prediction Methods ◽  
Functional Evaluation ◽  
Domain Family ◽  
Starting Point ◽  
Go Terms

AbstractMotivationDue to the nature of experimental annotation, most protein function prediction methods operate at the protein-level, where functions are assigned to full-length proteins based on overall similarities. However, most proteins function by interacting with other proteins or molecules, and many functional associations should be limited to specific regions rather than the entire protein length. Most domain-centric function prediction methods depend on accurate domain family assignments to infer relationships between domains and functions, with regions that are unassigned to a known domain-family left out of functional evaluation. Given the abundance of residue-level annotations currently available, we present a function prediction methodology that automatically infers function labels of specific protein regions using protein-level annotations and multiple types of region-specific features.ResultsWe apply this method to local features obtained from InterPro, UniProtKB and amino acid sequences and show that this method improves both the accuracy and region-specificity of protein function transfer and prediction by testing on both human and yeast proteomes. We compare region-level predictive performance of our method against that of a whole-protein baseline method using a held-out dataset of proteins with structurally-verified binding sites and also compare protein-level temporal holdout predictive performances to expand the variety and specificity of GO terms we could evaluate. Our results can also serve as a starting point to categorize GO terms into site-specific and whole-protein terms and select prediction methods for different classes of GO terms.AvailabilityThe code is freely available at: https://github.com/ek1203/region_spec_func_pred

scholarly journals CAPICE: a computational method for Consequence-Agnostic Pathogenicity Interpretation of Clinical Exome variations

2019 ◽  
Author(s):  
Shuang Li ◽  
K. Joeri van der Velde ◽  
Dick de Ridder ◽  
Aalt D.J. van Dijk ◽  
Dimitrios Soudis ◽  
...  
Keyword(s):  
Web Application ◽  
Rare Variants ◽  
Computational Prediction ◽  
Computational Method ◽  
Prediction Methods ◽  
Pathogenic Variants ◽  
Manual Classification ◽  
Short Indels ◽  
Limited Accuracy ◽  
New Machine

ABSTRACTExome sequencing is now mainstream in clinical practice, however, identification of pathogenic Mendelian variants remains time consuming, partly because limited accuracy of current computational prediction methods leaves much manual classification. Here we introduce CAPICE, a new machine-learning based method for prioritizing pathogenic variants, including SNVs and short InDels, that outperforms best general (CADD, GAVIN) and consequence-type-specific (REVEL, ClinPred) computational prediction methods, for both rare and ultra-rare variants. CAPICE is easily integrated into diagnostic pipelines and is available as free and open source command-line software, file of pre-computed scores, and as a web application with web service API.

scholarly journals Identification of Protein Pupylation Sites Using Bi-Profile Bayes Feature Extraction and Ensemble Learning

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xiaowei Zhao ◽  
Jian Zhang ◽  
Qiao Ning ◽  
Pingping Sun ◽  
Zhiqiang Ma ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Correlation Coefficient ◽  
Posttranslational Modifications ◽  
Protein Identification ◽  
Matthews Correlation Coefficient ◽  
Predictive Performance ◽  
Computational Prediction ◽  
Training Dataset ◽  
Support Vector ◽  
Lysine Residues

Pupylation, one of the most important posttranslational modifications of proteins, typically takes place when prokaryotic ubiquitin-like protein (Pup) is attached to specific lysine residues on a target protein. Identification of pupylation substrates and their corresponding sites will facilitate the understanding of the molecular mechanism of pupylation. Comparing with the labor-intensive and time-consuming experiment approaches, computational prediction of pupylation sites is much desirable for their convenience and fast speed. In this study, a new bioinformatics tool named EnsemblePup was developed that used an ensemble of support vector machine classifiers to predict pupylation sites. The highlight of EnsemblePup was to utilize the Bi-profile Bayes feature extraction as the encoding scheme. The performance of EnsemblePup was measured with a sensitivity of 79.49%, a specificity of 82.35%, an accuracy of 85.43%, and a Matthews correlation coefficient of 0.617 using the 5-fold cross validation on the training dataset. When compared with other existing methods on a benchmark dataset, the EnsemblePup provided better predictive performance, with a sensitivity of 80.00%, a specificity of 83.33%, an accuracy of 82.00%, and a Matthews correlation coefficient of 0.629. The experimental results suggested that EnsemblePup presented here might be useful to identify and annotate potential pupylation sites in proteins of interest. A web server for predicting pupylation sites was developed.

Sign in / Sign up

Export Citation Format

Share Document