- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
BioMed Research International
Volume 2013 (2013), Article ID 263829, 7 pages
SubMito-PSPCP: Predicting Protein Submitochondrial Locations by Hybridizing Positional Specific Physicochemical Properties with Pseudoamino Acid Compositions
1School of Computer Science and Technology, Tianjin University, Tianjin 300072, China
2Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin University, Tianjin 300072, China
Received 12 May 2013; Revised 10 July 2013; Accepted 20 July 2013
Academic Editor: Lei Chen
Copyright © 2013 Pufeng Du and Yuan Yu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Knowing the submitochondrial location of a mitochondrial protein is an important step in understanding its function. We developed a new method for predicting protein submitochondrial locations by introducing a new concept: positional specific physicochemical properties. With the framework of general form pseudoamino acid compositions, our method used only about 100 features to represent protein sequences, which is much simpler than the existing methods. On the dataset of SubMito, our method achieved over 93% overall accuracy, with 98.60% for inner membrane, 93.90% for matrix, and 70.70% for outer membrane, which are comparable to all state-of-the-art methods. As our method can be used as a general method to upgrade all pseudoamino-acid-composition-based methods, it should be very useful in future studies. We implement our method as an online service: SubMito-PSPCP.
Mitochondrion is a type of membrane-enclosed subcellular organelle that can be found in most eukaryotic cells . It is involved in many biological processes, such as energy metabolism, programmed cell death, and ionic homeostasis . Every mitochondrion can be divided into four subcompartments, including inner membrane, outer membrane, intermembrane space, and the matrix. The proteins in mitochondria can vary in different tissues and organisms. For example, human mitochondria may contain about 600 different proteins , while over 900 proteins were found in mouse mitochondria . Mitochondria have been reported to be related in several human diseases and may play an important role in the aging process .
Computational identification of protein subcellular locations has become a challenge in the last decade. Recently, the research in this area focused on four different topics: (1) the prediction of multisites protein subcellular localization [6–9]; (2) the prediction of protein sub-subcellular locations , including the prediction of protein subnuclear locations, submitochondrial locations, and subchloroplast locations; (3) the prediction of topology-specific protein subcellular locations [11, 12]; and (4) the prediction of conditional mislocated protein subcellular locations . Several promising results have been achieved in these four topics. Li et al. did a serial of interesting work to predict multisites protein subcellular localization by introducing the multilabel classification methods [14–16]. Lin et al. presented a serial of impressive results in predicting protein submitochondrial and subchloroplast locations [17, 18]. They also achieved great success in applying computational approaches in identifying Golgi-resident protein types as well as mycobacterial membrane protein types [19, 20].
Over the last few years, several studies focused on reporting computational methods to predict protein submitochondrial locations. Du and Li started this topic by proposing the SubMito system and the first benchmarking dataset . Nanni and Lumini introduced a genetic-algorithm-based method to select sequence-based protein descriptors . Shi et al. introduced the wavelet-SVM method to improve the prediction performance . Fan and Li proposed a hybrid method using six different types of descriptors with incremental diversity algorithm as a feature selection procedure . Zakeri et al. employed anther hybrid method to incorporate sequence-based descriptors, functional domain descriptors, and secondary structure information . Lin et al. proposed to use the overrepresented tetrapeptides to predict the protein submitochondrial locations . All of these methods improved the prediction accuracy on the same benchmarking dataset [26, 27].
With the increment of prediction accuracy, the complexity of algorithms and the dimensions of the feature vector to represent the protein sequence are also increasing. Du and Li started this topic by using 1080 dimensional vectors. Nanni and Lumini created 15 artificial features by combining several hundreds of different features. Shi et al. employed the discrete wavelet transformation and summary statistics to reduce the dimensions of features. Fan and Li introduced thousands of original features and used incremental diversity algorithm to reduce them to 613 dimensions. Zakeri et al. combined over a thousand different features in their method. Lin et al. used 160,000 original features and reduced them to 1302 dimensions using a confidence parameter. Except, SubMito, all the state-of-the-art methods were using different machine-learning-based algorithms to reduce the feature dimensions. It seems that the key to improve the prediction performance is to choose the right dimension reduction algorithms.
Although the dimension reduction algorithms are consolidated based on statistics and are supported well by the underlying mathematical theories, it is usually difficult to reason the selected dimensions in a biological sense. We admit that the dimension reduction algorithms are effective and useful. It should be regarded as a powerful tool to improve the prediction performance of bioinformatics predictors. However, in this paper, we would present a method that can produce comparable prediction performance with only about 100 dimensions of features and without using any dimensional reduction algorithm.
2. Materials and Methods
There are several datasets existing for predicting submitochondrial locations. These datasets are always extracted from UniProt database with several filtering procedures. Since the methods, which were proposed along with these datasets, may have different requirement to the dataset, there are differences in the filtering procedures. In order to reflect the most recent advances in the available data as well as demonstrating the prediction power of the current method, two datasets were adopted in the current study. One dataset was directly extracted from the most recent version of UniProt database, and the other is the SubMito dataset that was published by Du and Li.
The procedures for filtering the raw data from UniProt database are described as follows: First, the reviewed sequences in the UniProt database, which are annotated with subcellular location “mitochondrion,” were retrieved using the UniProt online query and retrieval system. Secondly, the sequences were screened to ensure every sequence has a uniquely annotated submitochondrial location among the four locations: mitochondrial inner membrane, mitochondrial outer membrane, mitochondrial matrix, and mitochondrial intermembrane space. Due to the limited number of multi-sites submitochondrial proteins, we do not consider them in the current study. Thirdly, the sequences which are fragment of other proteins are excluded. The remaining sequences are processed using the CD-HIT program to remove the highly homologues sequences. The identity cutoff was set to 40% in the CD-HIT program. Finally, the submitochondrial locations, which contain less than 15 sequences, were discarded. The remaining 983 sequences compose the dataset of this study. Among the 983 sequences, there are 661 sequences from inner membrane, 177 sequences from matrix, and 145 sequences from outer membrane. We use this dataset as the basis to train and test our method. This dataset was denoted as the SML3-983 dataset in the current study.
The dataset of SubMito was also adopted as the basis for comparing the performance of our method to other existing methods, as all existing methods reported jackknife test performance on this dataset. The SubMito dataset contains 317 protein sequences from 3 submitochondrial locations, including 131 sequences from inner membrane, 41 sequences from outer membrane and 145 sequences from matrix. The pairwise sequence similarity in the dataset is lower than 40%. This dataset was denoted by the SML3-317 dataset in the current study. The summary of both datasets is shown in Table 1.
2.2. Sequence Representations
In order to improve the performance in predicting protein subcellular localizations, one of the keys is to represent the protein sequences with an effective discrete numerical form, which is able to reflect the intrinsic correlation with their localizations . The PseAACs (pseudoamino acid compositions) have been commonly used to represent protein sequences in predicting their subcellular locations . It is also extended recently to represent nucleotide sequences as well . The basic idea of the PseAAC is to extract the sequence order information with the autocorrelation coefficients of the protein sequence if every residue on the protein sequence can be represented with a number . The physicochemical properties of amino acids, like hydrophobicity and hydrophilicity values, were used for this purpose .
Biology is a natural science with historical dimensions. In the evolution history, the mutations in DNA level may produce the changes of single residues or insertion or deletion of several residues on the protein sequences. However, the function and the localization of the protein may remain unchanged. Therefore, we should investigate a group of evolutionary related protein sequences rather than a single protein sequence, which will make it easy to determine which residues are relatively more important in preserving the function and the localization of the protein. In recent years, the PsePSSM (pseudopositional specific scoring matrix), which applies the pseudoamino acid composition concept on the PSSM (positional specific scoring matrix), was widely applied in representing protein sequences [33–36].
Next, we propose a method that replaces the physicochemical properties in the PseAAC with the PSPCP (positional specific physicochemical properties), which can be derived from the PSSM and the existing physicochemical properties.
Let be a protein sequence with length , where ,,…, are the residues on the protein sequence. By searching against the SwissProt database using PSI-BLAST program  with three iterations and 0.001 as the e-value threshold, a PSSM can be produced as follows: where is a score generated by the PSI-BLAST. This score described the propensity of the th residue on the protein sequence that is being changed to the th type of amino acid during the evolutionary process.
Because of the PSSM generation process in PSI-BLAST, this number can be either positive or negative. It can also vary in a large range. In order to make every element in (1) within the range , a conversion was performed to create a standardized matrix as follows: where
Let be the th physicochemical property of the th type of residue. We now use the th physicochemical property to derive a PSPCP for on the protein sequence , as given by where is the PSPCP derived from the th physicochemical property for and is the normalized th physicochemical property of the th type of residues. It can be computed as follows: where
We now use the PSPCP to replace the physicochemical properties in the amphiphilic pseudoamino acid compositions (AmPseAAC) . We compute the following twenty descriptors to replace the amino acid compositions in the AmPseAAC:
The pseudofactor that describes the th tier sequence-order effect with the PSPCP, which is derived from the th physiochemical property, can be formulated as (8)
Given the parameters, and , and types of physicochemical properties, we create descriptors for protein as follows: where should be in the range () and can be a positive integer less than the length of the shortest sequence in the benchmarking dataset.
The protein can be represented as a dimension vector as
When the PSSM is not available, would be assumed. The whole sequence representation would automatically degrade to AmPseAAC.
2.3. Prediction Algorithm
We use SVM (support vector machine) as the prediction algorithm in this study. It searches for an optimal separating hyperplane, which maximizes the margin in feature space . We used an RBF (radial basis function) kernel in this study, as the RBF kernel is the most flexible and the most widely used kernel function. The RBF kernel function can be formulated as follows: where is a parameter, and are dimension vectors representing proteins and , and “” is the operator that computes the Euclidean length of a vector.
2.4. Performance Evaluations
The jackknife test, which is deemed to be the most objective and rigorous protocol for evaluating predictive bioinformatics methods, was applied in evaluating the performance of our method . The following summary statistics were used to measure the prediction performance: where is the prediction accuracy for the th location, is the Mathew’s correlation coefficient  for the th location, is the overall prediction accuracy, and , , , and are the numbers of true positives, true negatives, false positives, and false negatives of the th location in the jackknife test, respectively.
2.5. Parameter Calibrations
There are several parameters in our method. The value of these parameters will affect the prediction performance of our method. These parameters were calibrated to optimize the jackknife test overall accuracy. Nine different types of physicochemical properties, which are the same as the SubMito method, were applied in this method. These physicochemical properties can be found in Table 2. The parameters and were selected by enumerations. The parameter was enumerated in the range 0.05 to 1.0 with step 0.05. The parameter was enumerated in the range 2 to 20 with step 1. Altogether, 380 combinations of and were tested. For every combination, a grid search was carried out using LIBSVM software package  to optimize the jackknife test performance by finding the best values of the parameters and , which are the cost parameters in training SVM models.
3. Results and Discussions
3.1. Prediction Performance
The jackknife test on SML3-983 dataset was shown in Table 3. The optimal performance was achieved when , , , and . The optimal jackknife test performance on SML3-983 was 89.01%.
Since all existing methods reported their jackknife test performance on SML3-317 dataset, we also optimized our method on that dataset for a performance comparison. On SML3-317 dataset, we achieved the best performance when , , , and . The optimal performance of our method on SML3-317 was listed in Table 4 with the comparison to the other existing methods.
On SML3-317 dataset, the overall prediction accuracy of our method achieved over 93%, which is comparable to all state-of-the-art methods. Obviously, some other methods have achieved about 1% higher overall accuracy than our method. Nevertheless, no existing method achieved better prediction accuracy on all three submitochondrial locations. It should also be noticed that our method achieved 98% accuracy on the inner membrane class, which is higher than SubIdent, MitoLoc, and Fan and Li’s method. The only method that has higher prediction accuracy on the inner membrane class is the TetraMito. However, TetraMito has a lower MCC value on the inner membrane class, which indicates that the 100% accuracy on the inner membrane class may be on the cost of decreasing accuracy of the other locations. As anticipated, TetraMito has only 66% prediction accuracy on the outer membrane class with a similar MCC value to our method. The only drawback of our method is the performance on matrix. The prediction accuracy is slightly lower than existing methods. However, the MCC on matrix location is still higher than most of the existing methods. Therefore, it is fair to say that our method is comparable to all state-of-the-art methods in predicting protein submitochondrial locations.
To further validate the performance of our method, we carried out an independent dataset test. For both SML3-983 and SML3-317 datasets, 80% sequences were randomly selected as the training dataset. The predictor was trained with these 80% sequences. The prediction performance was estimated using the remaining 20% sequences. These procedures were repeated 20 times for every dataset. The average prediction performance and the standard deviation of the accuracy were shown in Table 5. The independent dataset test performance is similar to the jackknife test performance. These results proved that the performance of our method was not overestimated.
3.2. Advantages of PSPCP
In the method section, we have already described how to generate the PSPCP features. We will now discuss why we use (4) to define a replacement of physicochemical properties in the PseAAC.
The protein functions, including its subcellular locations, are largely determined by the physicochemical properties of the residues on the sequence. However, not all residues contribute to the protein functions equally. Some of the residues are important, while others are not. In the evolutionary process, the important residues tend to be conserved, or at least can only vary to limited types that possess similar physicochemical properties. But the unimportant residues would not be conserved. Thus, we can assume that all unimportant residues would have similar replacement propensity patterns in the evolutionary history. Although it is difficult to figure out which residue is important and which is not, based on our assumption, the average physicochemical properties in the evolution history would be similar for all unimportant residues. Thus, if we compute the average physicochemical properties in the evolution history, the important residues would possess physicochemical properties that are much more different to those unimportant ones. This is why we use PSPCP, which is the average physicochemical properties of all residues in the evolution history, to replace the conventional physicochemical properties in the PseAAC.
Developing novel methods for predicting protein submitochondrial locations is not only a race of prediction performance. There are many different quality terms other than prediction accuracy that can be used to describe how good a prediction method is. There are two major advantages of our method, the simpleness and the potential to improve all existing PseAAC-based methods.
The feature vectors in all state-of-the-art methods usually have several hundreds to over a thousand dimensions, which is a number much larger than the number of the samples in the benchmarking dataset. In the general concept of machine learning, a feature vector with lower dimensions is usually preferred when a similar performance can be achieved when other conditions are the same. Our method uses only about 100 dimensions feature vectors, which is lower in dimension than all existing methods except SubIdent.
Our method also has the potential to improve all existing PseAAC-based methods. Actually, the current method only replaces the physicochemical properties in the SubMito method with the PSPCP, which is derived from the same physicochemical properties in SubMito and the PSSM information. This simple replacement resulted in 8% performance improvement, which proved that the PSSM information is very useful in classifying protein sequences. Our method also gives a simple and effective way on how to integrate the PSSM information into all existing PseAAC-based methods. PsePSSM, which only extracts the information from PSSM, has achieved great success. Therefore, it can be anticipated that our method, which integrates PSSM within the PseAAC, could start a new way to utilize PSSM information more efficiently.
As pointed out by TetraMito, the GO-based methods usually achieve better performances, like Fan and Li’s work. There is no doubt that GO-based methods are very useful in computationally determining protein subcellular locations. In the view of a user, today’s GO-based methods require the same input as the sequence-based ab initio methods and provide a better result, which is very promising in practical studies. However, this cannot conceal the following fact. When a protein sequence was given to predict its locations, the performance of GO-based methods relies on whether similar sequences of the given sequence can be found in the UniProtKB database. Therefore, almost every existing GO-based method tried to incorporate some sequence-based information as its complement. Our method provides a perfect complement to the GO-based methods, as all GO-based methods, which used to incorporate PseAAC as the complement, can now be upgraded to use PSPCP within PseAAC. Actually, these methods can work side by side to help each other in a practical study.
3.3. Software Availability
We have developed an online service called SubMito-PSPCP. This service can be accessed using the following URL: http://www.pufengdu.org/srv/bioinfo/submito-pspcp/. The datasets SML3-983 and SML3-317 can both be downloaded from the “download” page of this service.
We developed a computational method that can predict the protein submitochondrial locations. We proposed the positional specific physicochemical properties concept and used this concept along with the pseudoamino acid compositions to generate protein descriptors. With only about 100 dimensions of the descriptors, we achieved comparable prediction performance to those methods using over a thousand descriptors. We hope this method can be an alternative choice in predicting protein submitochondrial locations.
This work was supported by the National Science Foundation of China (NSFC 61005041), Specialized Research Fund for the Doctoral Program of Higher Education (SRFDP 20100032120039), Tianjin Natural Science Foundation (no. 12JCQNJC02300), China Postdoctoral Science Foundation (2012T50240 and 2013M530114), and the Seed Foundation of Tianjin University (nos. 60302006 and 60302024).
- K. Henze and W. Martin, “Evolutionary biology: essence of mitochondri,” Nature, vol. 426, no. 6963, pp. 127–128, 2003.
- H. M. McBride, M. Neuspiel, and S. Wasiak, “Mitochondria: more than just a powerhouse,” Current Biology, vol. 16, no. 14, pp. R551–R560, 2006.
- S. W. Taylor, E. Fahy, B. Zhang et al., “Characterization of the human heart mitochondrial proteome,” Nature Biotechnology, vol. 21, no. 3, pp. 281–286, 2003.
- J. Zhang, X. Li, M. Mueller et al., “Systematic characterization of the murine mitochondrial proteome using functionally validated cardiac mitochondria,” Proteomics, vol. 8, no. 8, pp. 1564–1575, 2008.
- E. J. Lesnefsky, S. Moghaddas, B. Tandler, J. Kerner, and C. L. Hoppel, “Mitochondrial dysfunction in cardiac disease: ischemia—reperfusion, aging, and heart failure,” Journal of Molecular and Cellular Cardiology, vol. 33, no. 6, pp. 1065–1089, 2001.
- Z.-C. Wu, X. Xiao, and K.-C. Chou, “ILoc-Plant: a multi-label classifier for predicting the subcellular localization of plant proteins with both single and multiple sites,” Molecular Biosystems, vol. 7, no. 12, pp. 3287–3297, 2011.
- P. Du and C. Xu, “Predicting multisite protein subcellular locations: progress and challenges,” Expert Review of Proteomics, vol. 10, no. 3, pp. 227–237, 2013.
- K.-C. Chou, “Some remarks on predicting multi-label attributes in molecular biosystems,” Molecular BioSystems, vol. 9, no. 6, pp. 1092–1100, 2013.
- L. Li, Y. Zhang, L. Zou et al., “An ensemble classifier for eukaryotic protein subcellular location prediction using gene ontology categories and amino acid hydrophobicity,” PLoS ONE, vol. 7, no. 1, Article ID e31057, 2012.
- P. Du, T. Li, and X. Wang, “Recent progress in predicting protein sub-subcellular locations,” Expert Review of Proteomics, vol. 8, no. 3, pp. 391–404, 2011.
- A. Pierleoni, P. L. Martelli, and R. Casadio, “MemLoci: predicting subcellular localization of membrane proteins in eukaryotes,” Bioinformatics, vol. 27, no. 9, pp. 1224–1230, 2011.
- P. Du, Y. Tian, and Y. Yan, “Subcellular localization prediction for human internal and organelle membrane proteins with projected gene ontology scores,” Journal of Theoretical Biology, vol. 313, pp. 61–67, 2012.
- K. Lee, K. Byun, W. Hong, et al., “Proteome-wide discovery of mislocated proteins in cancer,” Genome Research, 2013.
- G.-Z. Li, X. Wang, X. Hu, J.-M. Liu, and R.-W. Zhao, “Multilabel learning for protein subcellular location prediction. Ieee Trans,” Nanobioscience, vol. 11, no. 3, pp. 237–243, 2012.
- X. Wang, G.-Z. Li, and W.-C. Lu, “Virus-ECC-mPLoc: a multi-label predictor for predicting the subcellular localization of virus proteins with both single and multiple sites based on a general form of Chou’s pseudo amino acid composition,” Protein & Peptide Letters, vol. 20, no. 3, pp. 309–317, 2013.
- X. Wang and G.-Z. Li, “A multi-label predictor for identifying the subcellular locations of singleplex and multiplex eukaryotic proteins,” PLos ONE, vol. 7, no. 5, Article ID e36317, 2012.
- H. Lin, W. Chen, L.-F. Yuan, Z.-Q. Li, and H. Ding, “Using over-represented tetrapeptides to predict protein submitochondria locations,” Acta Biotheoretica, vol. 61, no. 2, pp. 259–268, 2013.
- H. Lin, C. Ding, L.-F. Yuan, et al., “Predicting subchloroplast locations of proteins based on the general form of Chou’s pseudo amino acid composition: approached from optimal tripeptide composition,” International Journal of Biomathematics, vol. 6, no. 2, Article ID 1350003, 2013.
- C. Ding, L.-F. Yuan, S.-H. Guo, H. Lin, and W. Chen, “Identification of mycobacterial membrane proteins and their types using over-represented tripeptide compositions,” Journal of Proteomics, vol. 77, pp. 321–328, 2012.
- H. Ding, S.-H. Guo, E.-Z. Deng, et al., “Prediction of Golgi-resident protein types by using feature selection technique,” Chemometrics and Intelligent Laboratory Systems, vol. 124, pp. 9–13, 2013.
- P. Du and Y. Li, “Prediction of protein submitochondria locations by hybridizing pseudo-amino acid composition with various physicochemical features of segmented sequence,” BMC Bioinformatics, vol. 7, article 518, 2006.
- L. Nanni and A. Lumini, “Genetic programming for creating Chou's pseudo amino acid based features for submitochondria localization,” Amino Acids, vol. 34, no. 4, pp. 653–660, 2008.
- S.-P. Shi, J.-D. Qiu, X.-Y. Sun et al., “Identify submitochondria and subchloroplast locations with pseudo amino acid composition: approach from the strategy of discrete wavelet transform feature extraction,” Biochimica et Biophysica Acta, vol. 1813, no. 3, pp. 424–430, 2011.
- G.-L. Fan and Q.-Z. Li, “Predicting protein submitochondria locations by combining different descriptors into the general form of Chou's pseudo amino acid composition,” Amino Acids, vol. 43, no. 2, pp. 545–555, 2012.
- P. Zakeri, B. Moshiri, and M. Sadeghi, “Prediction of protein submitochondria locations based on data fusion of various features of sequences,” Journal of Theoretical Biology, vol. 269, no. 1, pp. 208–216, 2011.
- Y. Zeng, Y. Guo, R. Xiao, L. Yang, L. Yu, and M. Li, “Using the augmented Chou's pseudo amino acid composition for predicting protein submitochondria locations based on auto covariance approach,” Journal of Theoretical Biology, vol. 259, no. 2, pp. 366–372, 2009.
- S. Mei, “Multi-kernel transfer learning based on Chou's PseAAC formulation for protein submitochondria localization,” Journal of Theoretical Biology, vol. 293, pp. 121–130, 2012.
- K.-C. Chou, “Pseudo amino acid composition and its applications in bioinformatics, proteomics and system biology,” Current Proteomics, vol. 6, no. 4, pp. 262–274, 2009.
- K.-C. Chou, “Some remarks on protein attribute prediction and pseudo amino acid composition,” Journal of Theoretical Biology, vol. 273, no. 1, pp. 236–247, 2011.
- W. Chen, P.-M. Feng, H. Lin, and K.-C. Chou, “iRSpot-PseDNC: identify recombination spots with pseudo dinucleotide composition,” Nucleic Acids Research, vol. 41, no. 6, article e68, 2013.
- K.-C. Chou, “Using amphiphilic pseudo amino acid composition to predict enzyme subfamily classes,” Bioinformatics, vol. 21, no. 1, pp. 10–19, 2005.
- K.-C. Chou, “Prediction of protein cellular attributes using pseudo-amino acid composition,” Proteins, vol. 43, no. 3, pp. 246–255, 2001.
- W.-Z. Lin, J.-A. Fang, X. Xiao, and K.-C. Chou, “iLoc-Animal: a multi-label learning classifier for predicting subcellular localization of animal proteins,” Molecular BioSystems, vol. 9, no. 4, pp. 634–644, 2013.
- K.-C. Chou, Z.-C. Wu, and X. Xiao, “iLoc-Euk: a multi-label classifier for predicting the subcellular localization of singleplex and multiplex eukaryotic proteins,” PLoS ONE, vol. 6, no. 3, Article ID e18258, 2011.
- K.-C. Chou, Z.-C. Wu, and X. Xiao, “ILoc-Hum: using the accumulation-label scale to predict subcellular locations of human proteins with both single and multiple sites,” Molecular BioSystems, vol. 8, no. 2, pp. 629–641, 2012.
- H.-B. Shen and K.-C. Chou, “Nuc-PLoc: a new web-server for predicting protein subnuclear localization by fusing PseAA composition and PsePSSM,” Protein Engineering, Design and Selection, vol. 20, no. 11, pp. 561–567, 2007.
- S. F. Altschul, T. L. Madden, A. A. Schäffer et al., “Gapped BLAST and PSI-BLAST: a new generation of protein database search programs,” Nucleic Acids Research, vol. 25, no. 17, pp. 3389–3402, 1997.
- V. N. Vapnik, The Nature of Statistical Learning Theory, Springer, New York, NY, USA.
- H.-B. Shen, J. Yang, and K.-C. Chou, “Methodology development for predicting subcellular localization and other attributes of proteins,” Expert Review of Proteomics, vol. 4, no. 4, pp. 453–463, 2007.
- P. Baldi, S. Brunak, Y. Chauvin, C. A. F. Andersen, and H. Nielsen, “Assessing the accuracy of prediction algorithms for classification: an overview,” Bioinformatics, vol. 16, no. 5, pp. 412–424, 2000.
- C.-C. Chang and C.-J. Lin, “LIBSVM: a library for support vector machines,” ACM Transactions on Intelligent Systems and Technology, vol. 227, no. 3, pp. 1–27, 2011.