pLoc-mVirus: Predict subcellular localization of multi-location virus proteins via incorporating the optimal GO information into general PseAAC

Efficient computational model for classification of protein localization images using Extended Threshold Adjacency Statistics and Support Vector Machines

BACKGROUND AND OBJECTIVE

Discriminative and informative feature extraction is the core requirement for accurate and efficient classification of protein subcellular localization images so that drug development could be more effective. The objective of this paper is to propose a novel modification in the Threshold Adjacency Statistics technique and enhance its discriminative power.

METHODS

In this work, we utilized Threshold Adjacency Statistics from a novel perspective to enhance its discrimination power and efficiency. In this connection, we utilized seven threshold ranges to produce seven distinct feature spaces, which are then used to train seven SVMs. The final prediction is obtained through the majority voting scheme. The proposed ETAS-SubLoc system is tested on two benchmark datasets using 5-fold cross-validation technique.

RESULTS

We observed that our proposed novel utilization of TAS technique has improved the discriminative power of the classifier. The ETAS-SubLoc system has achieved 99.2% accuracy, 99.3% sensitivity and 99.1% specificity for Endogenous dataset outperforming the classical Threshold Adjacency Statistics technique. Similarly, 91.8% accuracy, 96.3% sensitivity and 91.6% specificity values are achieved for Transfected dataset.

CONCLUSIONS

Simulation results validated the effectiveness of ETAS-SubLoc that provides superior prediction performance compared to the existing technique. The proposed methodology aims at providing support to pharmaceutical industry as well as research community towards better drug designing and innovation in the fields of bioinformatics and computational biology. The implementation code for replicating the experiments presented in this paper is available at: https://drive.google.com/file/d/0B7IyGPObWbSqRTRMcXI2bG5CZWs/view?usp=sharing.

Heterodimer Binding Scaffolds Recognition via the Analysis of Kinetically Hot Residues

Physical interactions between proteins are often difficult to decipher. The aim of this paper is to present an algorithm that is designed to recognize binding patches and supporting structural scaffolds of interacting heterodimer proteins using the Gaussian Network Model (GNM). The recognition is based on the (self) adjustable identification of kinetically hot residues and their connection to possible binding scaffolds. The kinetically hot residues are residues with the lowest entropy, i.e., the highest contribution to the weighted sum of the fastest modes per chain extracted via GNM. The algorithm adjusts the number of fast modes in the GNM's weighted sum calculation using the ratio of predicted and expected numbers of target residues (contact and the neighboring first-layer residues). This approach produces very good results when applied to dimers with high protein sequence length ratios. The protocol's ability to recognize near native decoys was compared to the ability of the residue-level statistical potential of Lu and Skolnick using the Sternberg and Vakser decoy dimers sets. The statistical potential produced better overall results, but in a number of cases its predicting ability was comparable, or even inferior, to the prediction ability of the adjustable GNM approach. The results presented in this paper suggest that in heterodimers at least one protein has interacting scaffold determined by the immovable, kinetically hot residues. In many cases, interacting proteins (especially if being of noticeably different sizes) either behave as a rigid lock and key or, presumably, exhibit the opposite dynamic behavior. While the binding surface of one protein is rigid and stable, its partner's interacting scaffold is more flexible and adaptable.

Prediction of Apoptosis Protein's Subcellular Localization by Fusing Two Different Descriptors Based on Evolutionary Information

The apoptosis protein has a central role in the development and the homeostasis of an organism. Obtaining information about the subcellular localization of apoptosis protein is very helpful to understand the apoptosis mechanism and the function of this protein. Prediction of apoptosis protein's subcellular localization is a challenging task, and currently the existing feature extraction methods mainly rely on the protein's primary sequence. In this paper we develop a feature extraction model based on two different descriptors of evolutionary information, which contains the 192 frequencies of triplet codons (FTC) in the RNA sequence derived from the protein's primary sequence and the 190 features from a detrended forward moving-average cross-correlation analysis (DFMCA) based on a position-specific scoring matrix (PSSM) generated by the PSI-BLAST program. Hence, this model is called FTC-DFMCA-PSSM. A 382-dimensional (382D) feature vector is constructed on the ZD98, ZW225 and CL317 datasets. Then a support vector machine is adopted as classifier, and the jackknife cross-validation test method is used for evaluating the accuracy. The overall prediction accuracies are further improved by an objective and rigorous jackknife test. Our model not only broadens the source of the feature information, but also provides a more accurate and reliable automated calculation method for the prediction of apoptosis protein's subcellular localization.

iDNA6mA-PseKNC: Identifying DNA N6-methyladenosine sites by incorporating nucleotide physicochemical properties into PseKNC

N⁶-methyladenine (6mA) is one kind of post-replication modification (PTM or PTRM) occurring in a wide range of DNA sequences. Accurate identification of its sites will be very helpful for revealing the biological functions of 6mA, but it is time-consuming and expensive to determine them by experiments alone. Unfortunately, so far, no bioinformatics tool is available to do so. To fill in such an empty area, we have proposed a novel predictor called iDNA6mA-PseKNC that is established by incorporating nucleotide physicochemical properties into Pseudo K-tuple Nucleotide Composition (PseKNC). It has been observed via rigorous cross-validations that the predictor's sensitivity (Sn), specificity (Sp), accuracy (Acc), and stability (MCC) are 93%, 100%, 96%, and 0.93, respectively. For the convenience of most experimental scientists, a user-friendly web server for iDNA6mA-PseKNC has been established at http://lin-group.cn/server/iDNA6mA-PseKNC, by which users can easily obtain their desired results without the need to go through the complicated mathematical equations involved.

Assessing the Performances of Protein Function Prediction Algorithms from the Perspectives of Identification Accuracy and False Discovery Rate

The function of a protein is of great interest in the cutting-edge research of biological mechanisms, disease development and drug/target discovery. Besides experimental explorations, a variety of computational methods have been designed to predict protein function. Among these in silico methods, the prediction of BLAST is based on protein sequence similarity, while that of machine learning is also based on the sequence, but without the consideration of their similarity. This unique characteristic of machine learning makes it a good complement to BLAST and many other approaches in predicting the function of remotely relevant proteins and the homologous proteins of distinct function. However, the identification accuracies of these in silico methods and their false discovery rate have not yet been assessed so far, which greatly limits the usage of these algorithms. Herein, a comprehensive comparison of the performances among four popular prediction algorithms (BLAST, SVM, PNN and KNN) was conducted. In particular, the performance of these methods was systematically assessed by four standard statistical indexes based on the independent test datasets of 93 functional protein families defined by UniProtKB keywords. Moreover, the false discovery rates of these algorithms were evaluated by scanning the genomes of four representative model organisms (Homo sapiens, Arabidopsis thaliana, Saccharomyces cerevisiae and Mycobacterium tuberculosis). As a result, the substantially higher sensitivity of SVM and BLAST was observed compared with that of PNN and KNN. However, the machine learning algorithms (PNN, KNN and SVM) were found capable of substantially reducing the false discovery rate (SVM < PNN < KNN). In sum, this study comprehensively assessed the performance of four popular algorithms applied to protein function prediction, which could facilitate the selection of the most appropriate method in the related biomedical research.

iRSpot-ADPM: Identify recombination spots by incorporating the associated dinucleotide product model into Chou's pseudo components

Gene recombination is a key process to produce hereditary differences. Recombination spot identification plays an important role in revealing genome evolution and promoting DNA function study. However, traditional experiments are not good at identifying recombination spot with huge amounts of DNA sequences springed up by sequencing. At present, some machine learning methods have been proposed to speed up this identification process. However, the correlations between nucleotides pairs at different positions along DNA sequence is often ignored, which reflects the important sequence order information. For this purpose, this study proposes a novel feature extraction method, called iRSpot-ADPM, based on DNA property in a given DNA sequence. 85 features are selected from the original feature set according to the weights calculated by support vector machine. Five-fold cross validation tests on two widely used benchmark datasets indicate that the proposed method outperforms its existing counterparts on the individual specificity(Spec), Matthews correlation coefficient(MCC) value and overall accuracy(OA). The experimental results show that the proposed method is effective for accurate recombination spot identification. Moreover, it is anticipated that the proposed method could be extended to other biology sequence and be helpful in future research. The datasets and Matlab source codes can be download from the URL: http://stxy.neuq.edu.cn/info/1095/1157.htm.

A proteome-wide systems toxicological approach deciphers the interaction network of chemotherapeutic drugs in the cardiovascular milieu

Onco-cardiology is critical for the management of cancer therapeutics since many of the anti-cancer agents are associated with cardiotoxicity. Therefore, the major aim of the current study is to employ a novel in silico method combined with experimental validation to explore off-targets and prioritize the enriched molecular pathways related to the specific cardiovascular events other than their intended targets by deriving relationship between drug-target-pathways and cardiovascular complications in order to help onco-cardiologists for the management of strategies to minimize cardiotoxicity. A systems biological understanding of the multi-target effects of a drug requires prior knowledge of proteome-wide binding profiles. In order to achieve the above, we have utilized PharmMapper, a web-based tool that uses a reverse pharmacophore mapping approach (spatial arrangement of features essential for a molecule to interact with a specific target receptor), along with KEGG for exploring the pathway relationship. In the validation part of the study, predicted protein targets and signalling pathways were strengthened with existing datasets of DrugBank and antibody arrays specific to vascular endothelial growth factor (VEGF) signalling in the case of 5-fluorouracil as direct experimental evidence. The current systems toxicological method illustrates the potential of the above big-data in supporting the knowledge of onco-cardiological indications which may lead to the generation of a decision making catalogue in future therapeutic prescription.

Onco-cardiology is critical for the management of cancer therapeutics since many of the anti-cancer agents are associated with cardiotoxicity.

Identification of preterm birth based on RQA analysis of electrohysterograms

BACKGROUND AND OBJECTIVE

Common methods for data analysis are mainly based on linear concepts, but in recent years nonlinear dynamics methods have been introduced. It is a well-known fact that In typical biological systems lack of stationarity and rather sudden changes of state are the properties distinguishing them from each other. There is an urgent need to better understand the mechanical activity of the myometrium (its contractility) to find a solution for preterm delivery problem, the largest cause of neonatal deaths and morbidity. The electrohysterographic signal (EHG) is a good non-linear, bioelectrical indicator for the detection and identification of term and preterm birth.

METHODS

The material of the study consists of EHG signals, obtained from 20 patients between the 24th and the 28th week of pregnancy with threatened preterm labor. The women were divided into two groups: those delivering after more than 7 days - group A (n = 10) and women delivering within 7 days - group B (n = 10). In this paper, an analysis of bioelectrical signals was performed by recurrence quantification analysis (RQA) and principal component analysis (PCA) to distinguish particular patterns for term and preterm birth. To date, these methods have not been used for the evaluation of bioelectrical activity in the uterus. To train novel classifiers for the EHG signals Support Vectors Machine classifications (multiclass SVM) was used. Statistical analysis was performed by means of non-parametric Mann-Whitney test.

RESULTS

From among eleven parameters obtained from recurrence quantification analysis, five most appropriate were chosen: Recurrence Rate, Determinism, Laminarity, Entropy and Recurrence Period Density Entropy. Significant increase (p < .001) of Recurrence Rate was found in patients from group B, while increase of parameters, besides Laminarity, was found in patients from group A. The accuracy of classification obtained as a result of the analysis increased to 83,32%.

CONCLUSION

We showed that the respectively selected recurrence quantificators obtained for that time series could be used to classify all those signals to the appropriate group. The proposed analysis could help in detecting preterm labor based on the EHG signal dynamics.

pLoc-mGneg: Predict subcellular localization of Gram-negative bacterial proteins by deep gene ontology learning via general PseAAC

Information of the proteins' subcellular localization is crucially important for revealing their biological functions in a cell, the basic unit of life. With the avalanche of protein sequences generated in the postgenomic age, it is highly desired to develop computational tools for timely identifying their subcellular locations based on the sequence information alone. The current study is focused on the Gram-negative bacterial proteins. Although considerable efforts have been made in protein subcellular prediction, the problem is far from being solved yet. This is because mounting evidences have indicated that many Gram-negative bacterial proteins exist in two or more location sites. Unfortunately, most existing methods can be used to deal with single-location proteins only. Actually, proteins with multi-locations may have some special biological functions important for both basic research and drug design. In this study, by using the multi-label theory, we developed a new predictor called "pLoc-mGneg" for predicting the subcellular localization of Gram-negative bacterial proteins with both single and multiple locations. Rigorous cross-validation on a high quality benchmark dataset indicated that the proposed predictor is remarkably superior to "iLoc-Gneg", the state-of-the-art predictor for the same purpose. For the convenience of most experimental scientists, a user-friendly web-server for the novel predictor has been established at http://www.jci-bioinfo.cn/pLoc-mGneg/, by which users can easily get their desired results without the need to go through the complicated mathematics involved.