Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

Open Access Highly Accessed Research article

Identification of properties important to protein aggregation using feature selection

Yaping Fang12, Shan Gao2, David Tai2, C Russell Middaugh3 and Jianwen Fang24*

Author Affiliations

1 College of Science, Institute for Computer Applications, Huazhong Agricultural University, Wuhan 430070, P.R. China

2 Applied Bioinformatics Laboratory, University of Kansas, 2034 Becker Drive, Lawrence, KS 66047, USA

3 Department of Pharmaceutical Chemistry, University of Kansas, 2030 Becker Drive, Lawrence, KS 66047, USA

4 Biometric Research Branch, Division of Cancer Treatment and Diagnosis, National Cancer Institute, 9609 Medical Center Dr, Rockville, MD 20850, USA

For all author emails, please log on.

BMC Bioinformatics 2013, 14:314  doi:10.1186/1471-2105-14-314

The electronic version of this article is the complete one and can be found online at:

Received:7 August 2012
Accepted:1 October 2013
Published:28 October 2013

© 2013 Fang et al.; licensee BioMed Central Ltd.

This is an open access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.



Protein aggregation is a significant problem in the biopharmaceutical industry (protein drug stability) and is associated medically with over 40 human diseases. Although a number of computational models have been developed for predicting aggregation propensity and identifying aggregation-prone regions in proteins, little systematic research has been done to determine physicochemical properties relevant to aggregation and their relative importance to this important process. Such studies may result in not only accurately predicting peptide aggregation propensities and identifying aggregation prone regions in proteins, but also aid in discovering additional underlying mechanisms governing this process.


We use two feature selection algorithms to identify 16 features, out of a total of 560 physicochemical properties, presumably important to protein aggregation. Two predictors (ProA-SVM and ProA-RF) using selected features are built for predicting peptide aggregation propensity and identifying aggregation prone regions in proteins. Both methods are compared favourably to other state-of-the-art algorithms in cross validation. The identified important properties are fairly consistent with previous studies and bring some new insights into protein and peptide aggregation. One interesting new finding is that aggregation prone peptide sequences have similar properties to signal peptide and signal anchor sequences.


Both predictors are implemented in a freely available web application ( webcite). We suggest that the quaternary structure of protein aggregates, especially soluble oligomers, may allow the formation of new molecular recognition signals that guide aggregate targeting to specific cellular sites.

Aggregation; Amyloid; Peptide; Prediction; Feature selection; Machine learning


Protein aggregation has been intensely studied experimentally and computationally because the aggregation of protein drugs is of significant concern. It is encountered routinely during the protein refolding, purification, formulation, storage and shipping processes [1,2]. Moreover, it is associated with over 40 human diseases, such as Alzheimer’s, Parkinson, Huntington, prion diseases, and type II diabetes [3]. Interestingly, recently several functional amyloids have been found that play an important role in cellular biology and caused no measurable cytotoxicity [4]. Despite extensive research efforts, the underlying mechanisms of protein aggregation are not completely understood [5]. Many common phenomena related to aggregation, however, have been observed in various experiments [6]. For example, a small segment of one protein can be involved in aggregation while the rest retains a native-like structure. Some short de novo peptides can also form fibrils that closely resemble those formed by natural amyloid proteins. Experiments have confirmed many small peptides with lengths as short as 7 [7], 6 [8], 5 [9], and even 4 [10] residues can form aggregates. Swapping an aggregation prone segment from an amyloidogenic protein to a non-amyloidogenic homolog can trigger amyloid formation [11]. These observations suggest that short aggregation prone regions of sequence and structural specificity, rather than full-length sequences, can induce the formation of most if not all aggregates. Although in vivo amyloid disease aggregates may show different characteristics from those formed from protein drugs, as the former are well ordered entities containing cross beta structure fibers while the later are frequently amorphous entities, current prevailing theories consider both amyloid fibers and amorphous aggregates are formed from partially-folded intermediates [12]. Therefore, both amorphous aggregates and fibers may contain similar aggregation prone motifs [13].

A number of computational methods have been developed for predicting peptide aggregation propensities and identifying aggregation prone regions in whole protein sequences [14]. Notable methods include TANGO [15], PAGE [9], FoldAmyloid [16,17], Zyggegator [18], AGGRESCAN [19], and Pafig [20]. In all of these methods, with the exception of Pafig, a small number of physicochemical properties were empirically chosen to develop predictive models. For example, Chiti et al. [21] developed an empirical model using hydrophobicity, charge and propensity to predict aggregation rates. The model was later extended to a seven-parameter model designated Zyggegator for predicting absolute aggregation rates [22]. In both models, parameters were fitted using experimental data. Tartaglia et al. [3] instead developed a model using physicochemical properties without any free parameters. PAGE includes more properties such as aromatic residue number, parallel or anti-parallel configuration, and accessible surface area [9]. TANGO is a statistical mechanics algorithm for predicting β-aggregation in peptides and proteins. It is based on the assumption that the core regions of an aggregate are fully buried [15]. FoldAmyloid uses packing density which represents the average number of residues within a contact radius of 8.0 Å for 20 amino acid residues obtained from a database consists of protein with sequence identity less than 25% as well as the probability of hydrogen bond formation [23]. It has been demonstrated that regions that possess high packing density can be responsible for amyloidogenic properties. AGGRESCAN is a sequence based aggregation prediction tool based on an aggregation propensity scale for each of the 20 amino acids, which is derived from experimental data [19].

While these methods have generally resulted in good prediction accuracies, little systematic research has been done to determine peptide properties relevant to aggregation and their relative importance. Although Pafig uses machine learning methods to identify features relevant to aggregation, the number of the selected features is very large (41 features). Therefore it is very difficult to evaluate the biological relevance of each selected feature.

The goal of this study is to use feature selection algorithms to identify a small number of features important to protein aggregation. The removal of irrelevant or redundant features often improves the performance of learning models, providing faster and more cost-effective predictions. More importantly, this procedure may provide a better understanding of properties important to aggregation. Therefore, an investigation into physicochemical factors affecting protein aggregation has dual aims, precisely predicting protein aggregation propensities and discovering additional underlying mechanisms governing this important process.

In this study, we initially collect comparatively large training and test datasets from literature. A set of nine classification algorithms are used to test the classifiability of the datasets and define a baseline for performance evaluation of feature selection. We then apply two feature selection methods based on support vector machine (SVM) [24] and Random Forest (RF) [25] algorithms to rank 560 numeric features. SVM and RF classifiers, named ProA-SVM and ProA-RF respectively, with selected features are built, cross-validated and compared to five state-of-the-art methods. To test the reliability of selected features and robustness of the learned models, a leave-one-protein-out (LOPO) cross validation is conducted. Finally, we use our predictors to calculate aggregation propensity profiles for some well-studied proteins to identify aggregation prone regions and compare them to experimental results and other predictive methods.

One interesting finding of this study is that aggregation prone peptide sequences share similar properties with signal peptide and signal anchor sequences. This is supported by our finding that this model for aggregation can be used to accurately distinguish signal peptides from non-signal peptides. A possible relationship between aggregation and localization is also discussed.

Results and discussion

Baseline classification of samples using nine algorithms

We first constructed 9 classifiers based on 9 commonly used algorithms and then used these classifiers to establish a performance baseline. The performance of the classifiers was evaluated using the standard 10-fold cross validation. The accuracies of the predictions range from 0.717 (RPART) to 0.797 (GBM) (Table 1). The results show good classifiability on the dataset AP1. Therefore it is feasible to predict peptide propensities using collected features by machine learning methods.

Table 1. Performance of 9 classifiers before and after feature selection

Feature selection

We use two feature selection methods, namely SVM-RFE and RF-IS, to select features which are important to protein aggregation. The feature selection procedure of both approaches starts with the full set of features and then iteratively eliminates a number or a fraction of the least important features, as determined by the SVM-RFE and RF-IS algorithms. To determine the optimal set of features, the accuracy of the cross validation in each iteration is calculated and plotted against the number of selected features (Figure 1), leading to a selection of the top 7 features by the SVM-RFE method and the top 10 features by the RF-IS method (Table 2). These numbers are chosen because they both represent the first significant minimums with near-best performance while the numbers of features are significantly smaller than the ones with the best performance. For example, in the RF-IS case the best performance is achieved by the model with 24 features. It is clear that the performance gain from the 14 additional features is insignificant from the one with 10 features (Figure 1).

thumbnailFigure 1. Dependency of classification performance on the numbers of selected features A) Classification error plotted against the number of feature selected by SVM-RFE, B) OOB error plotted against the number of feature selected by RF-IE. “Class error” equals to 1 minus classification accuracy, and “OOB error” is the abbreviation of out-of-bag (OOB) error rate which represents error rate for classification.

Table 2. Selected top features using SVM-RFE and RF-IS

Evaluation of feature selection performance

We constructed a group of 9 classifiers using the top 7 features selected by the SVM-RFE method and another group of 9 classifiers with the top 10 features selected by RF-IS to evaluate the efficacy of feature selection. The results of the cross-validation of all classifiers on the dataset AP1 are shown in Table 1. It is observed that, 1) the top 10 features result in improved performance for all 9 tested algorithm; 2) the top 7 features produce enhanced performance of 5 classifiers (SVM, RPART, PLS, KNN and NB), and reduced in the remaining four. Overall, the feature selection process is very effective in removing a significant number of features (> 98%) while improving the performance. In addition, the results imply that selected features are important to the aggregation propensities of those peptides.

We further evaluated the selected 10 and 7 features using LOPO cross-validation. The LOPO results show that SVM and RF achieve good performance (Table 3). Therefore, we applied SVM and RF to build 2 predictors for practical uses: ProA-SVM (Protein Aggregation SVM Predictor) and ProA-RF (Protein Aggregation RF predictor).

Table 3. Results of LOPO cross-validation

Comparison with other methods

ProA-SVM and ProA-RF were compared on the dataset AP1 (See Methods) with five state-of-the-art sequence-based predictors, namely AGGRESCAN, TANGO, PAGE, FoldAmyloid, and ZYGGREGATOR. To display the outputs of these predictors together, their values are scaled into the numeric range of 0 to 1 (Figure 2). Considering their different predictive thresholds, the ROC (Receiver Operator Characteristic) curves are used to evaluate the performance of all predictors. Figure 2 clearly shows that the best performance is achieved by ProA-RF with an AUC (Area Under the ROC Curve) of 0.8954, followed by ProA-SVM with 0.8674, ZYGGREGATOR with 0.8395, AAGRESCAN with 0.8336, FoldAmyloid with 0.7946, PAGE with 0.7303, and TANGO with 0.7121. Based on the ROC curve, if the predictive threshold (false positive rate) is set as 0.2, the TN, FN, TP and FP are shown in the following Table 4. It can be seen that the best performance is achieved by ProA-RF with accuracy 0.8192. The followings are ProA-SVM (0.7910), ZYGGREGATOR (0.7768), AAGRESCAN (0.7316), FoldAmyloid (0.7119), TANGO (0.6610) and PAGE (0.6554). Although ProA-RF and ProA-SVM have better or comparable performance to other algorithms, caution should be taken in interpreting the comparison results because of the different data sets and validation strategies used to build these models. The results, nevertheless, clearly demonstrate that the feature selection procedure used in the study is able to identify features important to aggregation.

thumbnailFigure 2. The receiver operator characteristic (ROC) curves curve for different methods. Area Under the ROC Curve (AUC): ProA-RF: 0.8929; ProA-SVM: 0.8680, ZYGGREGATOR: 0.8395; AAGRESCAN: 0.8336; FoldAmyloid: 0.7946; PAGE: 0.7303, TANGO: 0.7121.

Table 4. Comparison results with other methods

Application to Identification of aggregation prone regions

To compare the ability to identify aggregation prone regions on entire sequences with those of other methods, we use ProA-SVM and ProA-RF to generate aggregation propensity profiles of 37 proteins using sliding windows of length 7. The models are built using the LOPO approach and therefore both predictors scan and predict regions on one protein based on a model built on all other proteins.

In most cases, the predictions of all methods are in good agreement with the experiment data. Nevertheless, in some cases the methods developed in this study can identify more true positives and true negatives than other approaches. One example is the aggregation profile of the microtubule-associated protein tau (P10636-8), whose function is involved in promoting microtubule assembly and stability. It has been experimentally validated that tau is involved in Alzheimer’s disease [26]. Figure 3 shows the aggregation propensity profiles by 7 predictors of the region 244–368 in tau. All 7 predictors are able to identify a nonamyloidogenic region 253LKNVKSKIGSTE264 and an amyloidogenic region 304GKVQIVYK311. Nevertheless, our methods correctly predict the nonamyloidogenic regions 244QTAPVPMPD252 and 339VKSE342, which are predicted as amyloidogenic regions by most of other methods.

thumbnailFigure 3. The predicted aggregation regions of tau protein (region 244–368) by different methods. A. The predicted aggregation propensity profiles of ProA-SVM (dashed line), ProA-RF (solid line); B. The predicted aggregation propensity profiles of ZYGGREGATOR (blue), AAGRESCAN (red), FoldAmyloid (black), PAGE (purple), and TANGO (green). “A” and “N” indicate experimentally confirmed aggregation and non-aggregation regions, respectively.

Analysis of selected features

The 16 features from the union of top 7 and top 10 features can be roughly grouped into 5 different categories (Table 2): aggregation propensities (“X15925383”), hydrophobicity (“ROSM880105”, “VENT840101”, “PONP800105”, “ZIMJ680101”,“CASG920101” and “WILM950102”), propensities of secondary structure or conformation (“RICJ880117”, “ROBB760110”, “PRAM900103”, “LEVM780102”, “PALJ810111” and PRAM900103), energy (“GUYH850101” and “VHEG790101”), and accessibility (“PONP800107”). The index “X15925383” calculated using the ZYGGREGATOR method (Pagg, pH=7) can be decomposed into the properties of hydrophobicity, secondary structure propensities and net charge. Thus these results are consistent with previous findings that hydrophobicity, charges, secondary structure propensities of residues play important roles in the aggregation process. A detailed annotation of selected features is provided in Additional file 1.

Additional file 1. Selected features and their AAindex records.

Format: DOC Size: 52KB Download file

This file can be viewed with: Microsoft Word ViewerOpen Data

Properties relevant to protein aggregation are important to signal peptides

Among 16 selected features, two are related to protein translocation. “VHEG790101” is the free energy of transferring amino acids from aqueous solution to a lipophilic phase [27], and “PRAM900103” is the statistics of the relative frequency of beta-sheets distributed in signal and nascent peptides [28]. There are 6 features related to hydrophobic properties such as ROSM880105, VENT840101, PONP800105, ZIMJ680101, CASG920101 and WILM950102. It is consistent with previous publications that signal peptide and signal anchor sequences have a distinct hydrophobic region [29].

This observation suggests that peptides with a tendency to aggregate may have similar properties with signal peptides and signal anchors. To test this hypothesis, we downloaded the SignalP version 2.0 dataset (SP) which contains 4 groups of signal peptides and signal anchors [30] (See Methods) and tested them by ProA-SVM and ProA-RF (Tables 4, 5). The accuracy of the predictions by ProA-SVM on the test dataset SP reaches 0.8346 (Table 5), which is even higher than the accuracy of 0.805 obtained in the predictions on the training set AP1. The accuracy of the predictions by ProA-RF (0.77) is also fairly good. Therefore models built on AP1 with selected features can be used to predict signal peptides and signal anchors, indicating aggregation-prone fragments share similar physicochemical properties with these two types of functional sequences.

Table 5. Results of testing ProA-SVM and ProA-RF on the SP dataset

While it is interesting that aggregation prone peptides share common properties with signal peptides and signal anchors, the results are not particularly surprising since both aggregation and localization processes are associated with inter-molecular hydrophobic interactions. This observation, nevertheless, raises an interesting question whether aggregation prone regions of a protein determine the deposition site of protein aggregates since it has been observed that protein aggregates are deposited at specific cellular sites [31]. We suggest that the quaternary structure of protein aggregates, especially soluble oligomers, may allow the formation of new molecular recognition signals that guide aggregate targeting to specific cellular sites. If this hypothesis is confirmed, it will help us to better understand the molecular basis for protein aggregation and may have significant implications for developing new therapeutic strategies for treating protein aggregation related diseases.


Datasets construction

We compiled a set of peptides known to form or not form aggregates determined experimentally from the literature. After removing ambiguous entries, we obtained a set of 354 samples (peptides) including 184 positives and 170 negatives. 297 samples originated from 37 proteins (the similarity is below 25%) but 57 of them are de novo peptides. The average lengths of positives and negatives are 12.72 and 12.6 residues while the corresponding standard deviations are 8.23 and 5.53, respectively. Considering the confusion of protein names and sequences in the literature, we referred these peptide sequences to the UniProtKB/Swiss-Prot database and used their UniProtKB/Swiss-Prot IDs as their unique identifiers wherever possible. All entries of Aggregation Propensity dataset 1 (AP1) and their original references are provided in Additional file 2.

Additional file 2. The dataset AP1 (Aggregation Propensity 1).

Format: DOC Size: 1.4MB Download file

This file can be viewed with: Microsoft Word ViewerOpen Data

We obtained signal peptide data (SP) from the SignalP version 2.0, which was previously used for identifying prokaryotic and eukaryotic signal peptides and predicting their cleavage sites [32]. SP contains 4 non-redundant datasets in which signal peptides and signal anchors are designated as positive samples and others as negative samples:

1. EUKSIG.reduc: 2250 Eukaryotes signal peptides (1125 positives and 1125 negatives);

2. EUKANC.reduc: 133 Eukaryotes signal anchors (67 positives and 66 negatives);

3. GRAM+SIG.reduc: 338 Gram-positive bacteria signal peptides (169 positives and 169 negatives).

4. GRAM-SIG.reduc: 700 Gram-negative bacteria signal peptides (350 positives and 350 negatives).

Feature extraction and peptide encoding

We compiled a collection of 560 features including 544 physicochemical properties obtained from AAindex database [33] and 16 additional features collected from published literatures (Additional file 3). All features were scaled into a range between 0 and 1. Each peptide is encoded by an array of 560 features, each of which is the average of corresponding features of the amino acid residues in the peptide. Thus, the ith sample peptide is represented by 560 features in a form of <a onClick="popup('','MathML',630,470);return false;" target="_blank" href="">View MathML</a>. If a peptide or a protein contains an amino acid residue with ‘NA’ value for a particular physicochemical property in AAindex, this amino acid are not used to calculate the average value for this physicochemical property.

Additional file 3. 16 additional features collected from published literatures.

Format: DOC Size: 89KB Download file

This file can be viewed with: Microsoft Word ViewerOpen Data

Classification algorithms

We use nine different classification algorithms to establish a performance baseline for classification and to test the efficacy of feature selection. These 9 algorithms include: SVMs [24], RF [25], Generalized Boosted Models (GBM) [34], Recursive Partitioning And Regression Trees (RPART) [35], Neural Network (NNet) [36], Partial Least Squares (PLS) [37], K Nearest Neighbours (KNN) [38], Naive Bayes (NB) [39], and Ada Boost (Ada) [40]. These algorithms are implemented in R using the caret package [41] in this study. The following is a brief description of these algorithms. Details can be found in the manual of the caret package and references cited therein. The specific commands including parameter tuning of each method used in the study can be found in the Additional file 4.

Additional file 4. Commands of the classification algorithms used in the study.

Format: TXT Size: 6KB Download fileOpen Data

The SVM algorithm is a supervised learning method, which can be used for classification or regression. It derives parameters of the maximum-margin to construct an optimized separating hyperplane by solving the optimization. The fit of SVM classifiers includes the selection of kernel, the kernel's parameters, and soft margin parameter C.

The Random Forest algorithm is an ensemble machine learning method that utilizes many independent decision trees to perform classification or regression. Each of the member trees is built on bootstrap samples from the training data by a random subset of available variables. Each Random Forest model built in this study consists of 500 decision trees. The number of variable randomly sampled in each tree is , where M is the number of total variables.

GBM integrates the concept of boosting methods with that of classification or regression trees. Using GBM for classification is to build a sequence of simple decision trees, where each successive tree is for the prediction residuals of the preceding tree. A learned function must be chosen from a restricted class of functions to most closely approximate the gradient of the loss function.

RPART is a method used to create decision trees and iteratively split the data on each of the nodes using user-specified splitting criteria. The algorithm chooses the split that partitions the data into separate nodes such that it minimizes the sum of the squared deviations of the mean in all of those nodes. The process continues until it satisfies a user-specified stopping criterion.

NNet is a computational model that imitates the structure and function of biological neural networks. It is typically defined by three types of parameters: the interconnection pattern between neurons, the learning process for updating the weights of the interconnections, and the activation function. The NNet used in this study is a feed-forward neural network with single hidden layer.

PLS is an extension of the multiple linear regression model, bearing some relation to principal component analysis. A PLS model is acquired by projecting the predicted variables and the observable variables into a new space. The PLS can be used for classification and regression.

KNN is one of the simplest machine learning algorithms. In KNN classification, a sample is assigned to the class with most common amongst its k nearest neighbors (k is a positive integer) by a majority vote of its neighbors. Despite its simplicity, KNN is often shown good performance comparable to other state-of-the-art algorithms.

NB uses the Bayes rule to compute the posterior probability of a categorical class variable, with the conditional independence assumption. One advantage of NB is that the decoupling of the class conditional feature distributions in calculation alleviates the problem known as the “curse of dimensionality.” Another advantage is that NB does not need to accurately estimate the absolute accuracy of each class because the classification outcome is determined by the relative probabilities of all classes.

Ada is an adaptive algorithm that can be used to build a series of classifiers, where subsequent classifiers are adapted in favor of those instances misclassified by previous classifiers. Although Ada can be sensitive to noisy data and statistics outliers, it has been found that it is often less susceptible to the overfitting problem than many other learning algorithms.


In this study, feature selection is executed using two state-of-the-art algorithms, SVM based recursive feature elimination (SVM-RFE) [42] and a Random Forest importance spectrum based feature selection algorithm (RF-IS) [43]. SVM-RFE is based on a backward sequential selection, which starts with all the features and removes one feature each time. The removed feature is the one whose removal minimizes the variation of weights. In this work, SVM-RFE uses linear kernel and C type SVMs [24].

RF-IS eliminates iteratively a number or a fraction of the least important features. Random Forest uses two methods to measure the importance, including the mean decrease in accuracy and mean decrease in node impurity measured by the Gini index. The second approach is used in this study and 20% fraction of features (default values in R package varSelRF ) [43] is removed in each loop. The features are selected in this approach using the command varSelRF(trainX, trainY, = 1, mtryFactor = 1, ntree = 500, ntreeIterat = 200, vars.drop.num = NULL, vars.drop.frac = 0.2, whole.range = TRUE, recompute.var.imp = TRUE, verbose = FALSE, returnFirstForest = TRUE, fitted.rf = NULL).

Cross validation

We use the standard 10-fold and Leave-One-Protein-Out (LOPO) cross validation methods to estimate the performance of classifiers. In 10-fold cross validation, we randomly split the AP1 into ten equal portions. We use nine portions as the training dataset and the remaining one as the test dataset. All parameters are fitted using an “inner” 10-fold cross validation in order to avoid potential overfitting problem. The procedure is repeated nine more times until each portion is used as the testing dataset once. LOPO mimics real-world applications by grouping all of the peptides (samples) according to the proteins to which they belong. We obtain 37 protein groups and a non-protein group comprising all de novo peptides. In LOPO cross validation, the test dataset consists of samples from one protein or the non-protein group, with all other samples included in the training dataset.

Performance comparison to other methods

We compare our methods with five state-of-the-art sequence-based methods including TANGO [15], PAGE [9], FoldAmyloid [23], Zyggregator [18], and AGGRESCAN [19]. To visualize and compare the results of those methods, outputs from these methods are scaled into a range of [0, 1]. Since different methods may use different classification thresholds, the area under the receiver operator characteristic (ROC) curve (AUC) is used to evaluate the performances of all methods. AUC is considered as a robust metric for classifier evaluation and comparison. An ROC curve is generated by varying the output threshold of a classifier and plotting the true positive rate (sensitivity) against the false positive rate (1 – specificity) for each threshold value. The ROC curve has been widely used in many protein aggregation studies as a standard threshold-independent metric [19,23]. We also provide the Matthews correlation coefficient (MCC) [44]for each method:

<a onClick="popup('','MathML',630,470);return false;" target="_blank" href="">View MathML</a>

Where TP is the number of true positives, TN the number of true negatives, FP the number of false positives and FN the number of false negatives. MCC is in the range between −1 and +1. A MCC of +1 represents a perfect prediction, 0 an average random prediction and −1 an inverse prediction.

Prediction of peptide aggregation propensities and calculation of aggregation propensity profile of the whole sequences

In this study we aim to develop models for predicting aggregation propensity of short peptides (i.e. 3–25 amino acid residues) and aggregation propensity profiles of longer peptides (> 25 amino acid residues) or entire proteins. The overall propensity of longer peptides or whole proteins is less significant since short aggregation prone regions, rather than the full-length sequences, are probably responsible for inducing the formation of most if not all aggregation.

Each short peptide is encoded using an input vector composed of selected features. For a longer peptide or complete protein sequence, a sliding symmetrical local window centered at a particular amino acid residue is used to scan the sequence. Each local window is also encoded with an input vector. The input vector is then used by the predictive models to calculate the aggregation propensity of the short peptide or local window. The predicted value, scaled to a range from 0 to 1, is assigned to the short peptide or the central residue of the window. The predicted values for all of the local windows from the N-terminus to the C-terminus provide an aggregation propensity profile for longer peptides or whole protein sequences. The short peptides or the regions with values above the threshold (default is 0.5) are considered as aggregation prone peptides or regions.

For predicting aggregation propensity profiles, we set the default window size to 7 amino acid residues. Using a shorter window may result in a profile with poor smoothness and a longer window may contain more than 2 or more aggregation prone regions [15]. In addition, experimental measurements and theoretical calculations have indicated that approximate 7 residues are required to span the distance of protofilaments [45]. Furthermore, the optimal window length in the FoldAmyloid algorithm was found to be 7 amino acid residues [23]. Based on these considerations, a window size of 7 amino acid residues is chosen as the default size.


In this study, 16 physicochemical properties have been identified important to protein aggregation. These findings confirm that hydrophobicity, secondary structure propensities and net charge play important roles in protein aggregation. Two sequence-based predictors (ProA-SVM and ProA-RF) are built to predict peptide aggregation propensities based on the SVMs and RF algorithms. Both predictors demonstrate good generalization abilities and can be used to identify aggregation prone regions of proteins. An interesting new finding is that aggregation peptides have similar properties to those of signal peptides and anchors, which indicates that the aggregation prone regions may also determine the deposition location of protein aggregates. We suggest that the quaternary structure of protein aggregates may allow the formation of neo- signals that guide aggregate targeting to specific cellular sites. If this hypothesis is confirmed, it will provide better understanding of the molecular basis for protein aggregation, and may have significant implications for developing new therapeutic strategies for treating protein aggregation related diseases.


ProA-SVM: Protein Aggregation SVM Predictor; ProA-RF: Protein Aggregation RF predictor; SVM: Support Vector Machine; RF: Random Forest; SVM-RFE: SVM based recursive feature elimination; RF-IS: Random Forest importance spectrum based feature selection; LOPO: leave-one-protein-out; GBM: Generalized Boosted Model; RPART: Recursive Partitioning And Regression Tree; NNet: Neural Network; PLS: Partial Least Square; KNN: K-Nearest Neighbour; NB: Naive Bayes; TP: The number of True Positive samples; FN: The number of False Negatives samples; FP: The number of False Positives samples; TN: The number of True Negatives samples; Ac: Accuracy; MCC: Matthews correlation coefficient.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

JF conceived the project. SG and YF carried out the study with input from CM and JF. YF, SG, CM and JF drafted the manuscript. All authors read and approved the final manuscript.


We are indebted to Professor Amedeo Caflisch, Professor Luis Serrano, and their research groups for providing the PAGE and TANGO programs. We also thank Dr. Max Kuhn for his help in using the caret package, and Dr. David Volkin for his review of the manuscript. This work was supported in part by the National Institutes of Health (NIH) Grant P01 AG12993 (PI: E. Michaelis).


  1. Ventura S, Villaverde A: Protein quality in bacterial inclusion bodies.

    Trends Biotechnol 2006, 24(4):179-185. PubMed Abstract | Publisher Full Text OpenURL

  2. Weiss WF, Young TM, Roberts CJ: Principles, Approaches, and Challenges for Predicting Protein Aggregation Rates and Shelf Life.

    J Pharm Sci-Us 2009, 98(4):1246-1277. Publisher Full Text OpenURL

  3. Tartaglia GG, Cavalli A, Pellarin R, Caflisch A: The role of aromaticity, exposed surface, and dipole moment in determining protein aggregation rates.

    Protein Sci 2004, 13(7):1939-1941. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  4. Badtke MP, Hammer ND, Chapman MR: Functional amyloids signal their arrival.

    Sci Signal 2009, 2(80):pe43. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  5. Olzscha H, Schermann SM, Woerner AC, Pinkert S, Hecht MH, Tartaglia GG, Vendruscolo M, Hayer-Hartl M, Hartl FU, Vabulas RM: Amyloid-like aggregates sequester numerous metastable proteins with essential cellular functions.

    Cell 2011, 144(1):67-78. PubMed Abstract | Publisher Full Text OpenURL

  6. Esteras-Chopo A, Serrano L, Lopez De La Paz M: The amyloid stretch hypothesis: recruiting proteins toward the dark side.

    Proc Natl Acad Sci USA 2005, 102(46):16672-16677. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  7. Nelson R, Sawaya MR, Balbirnie M, Madsen AO, Riekel C, Grothe R, Eisenberg D: Structure of the cross-beta spine of amyloid-like fibrils.

    Nature 2005, 435(7043):773-778. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  8. Thompson MJ, Sievers SA, Karanicolas J, Ivanova MI, Baker D, Eisenberg D: The 3D profile method for identifying fibril-forming segments of proteins.

    Proc Natl Acad Sci USA 2006, 103(11):4074-4078. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  9. Tartaglia GG, Cavalli A, Pellarin R, Caflisch A: Prediction of aggregation rate and aggregation-prone segments in polypeptide sequences.

    Protein Sci 2005, 14(10):2723-2734. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  10. Tjernberg L, Hosia W, Bark N, Thyberg J, Johansson J: Charge attraction and beta propensity are necessary for amyloid fibril formation from tetrapeptides.

    J Biol Chem 2002, 277(45):43243-43246. PubMed Abstract | Publisher Full Text OpenURL

  11. Galzitskaya OV: Regions which are Responsible for Swapping are also Responsible for Folding and Misfolding.

    Open Biochem J 2011, 5:27-36. PubMed Abstract | PubMed Central Full Text OpenURL

  12. Rousseau F, Schymkowitz J, Serrano L: Protein aggregation and amyloidosis: confusion of the kinds?

    Curr Opin Struct Biol 2006, 16(1):118-126. PubMed Abstract | Publisher Full Text OpenURL

  13. Wang XL, Das TK, Singh SK, Kumar S: Potential aggregation prone regions in biotherapeutics A survey of commercial monoclonal antibodies.

    Mabs 2009, 1(3):254-267. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  14. Caflisch A: Computational models for the prediction of polypeptide aggregation propensity.

    Curr Opin Chem Biol 2006, 10(5):437-444. PubMed Abstract | Publisher Full Text OpenURL

  15. Fernandez-Escamilla AM, Rousseau F, Schymkowitz J, Serrano L: Prediction of sequence-dependent and mutational effects on the aggregation of peptides and proteins.

    Nat Biotechnol 2004, 22(10):1302-1306. PubMed Abstract | Publisher Full Text OpenURL

  16. Galzitskaya OV, Garbuzynskiy SO, Lobanov MY: Expected packing density allows prediction of both amyloidogenic and disordered regions in protein chains.

    J Phys Condens Matter 2007, 19(28):1-15. OpenURL

  17. Garbuzynskiy SO, Lobanov MY, Galzitskaya OV: FoldAmyloid: a method of prediction of amyloidogenic regions from protein sequence.

    Bioinformatics (Oxford, England) 2010, 26(3):326-332. Publisher Full Text OpenURL

  18. Pawar AP, DuBay KF, Zurdo J, Chiti F, Vendruscolo M, Dobson CM: Prediction of "aggregation-prone" and "aggregation-susceptible" regions in proteins associated with neurodegenerative diseases.

    Journal of molecular biology 2005, 350(2):379-392. PubMed Abstract | Publisher Full Text OpenURL

  19. Conchillo-Sole O, de Groot NS, Aviles FX, Vendrell J, Daura X, Ventura S: AGGRESCAN: a server for the prediction and evaluation of "hot spots" of aggregation in polypeptides.

    BMC Bioinforma 2007, 8(65):1-17. OpenURL

  20. Tian J, Wu N, Guo J, Fan Y: Prediction of amyloid fibril-forming segments based on a support vector machine.

    BMC Bioinforma 2009, 10(Suppl 1):S45. BioMed Central Full Text OpenURL

  21. Chiti F, Stefani M, Taddei N, Ramponi G, Dobson CM: Rationalization of the effects of mutations on peptide and protein aggregation rates.

    Nature 2003, 424(6950):805-808. PubMed Abstract | Publisher Full Text OpenURL

  22. Dubay KF, Pawar AP, Chiti F, Zurdo J, Dobson CM, Vendruscolo M: Prediction of the absolute aggregation rates of amyloidogenic polypeptide chains.

    Journal of molecular biology 2004, 341(5):1317-1326. PubMed Abstract | Publisher Full Text OpenURL

  23. Galzitskaya OV, Garbuzynskiy SO, Lobanov MY: Prediction of amyloidogenic and disordered regions in protein chains.

    PLoS Comput Biol 2006, 2(12):1639-1648. OpenURL

  24. Vapnik VN: An overview of statistical learning theory.

    Ieee T Neural Networ 1999, 10(5):988-999. Publisher Full Text OpenURL

  25. Breiman L: Random forests.

    Mach Learn 2001, 45(1):5-32. Publisher Full Text OpenURL

  26. Mudher A, Lovestone S: Alzheimer's disease - do tauists and baptists finally shake hands?

    Trends Neurosci 2002, 25(1):22-26. PubMed Abstract | Publisher Full Text OpenURL

  27. von Heijne G, Blomberg C: Trans-membrane translocation of proteins.

    The direct transfer model. Eur J Biochem 1979, 97(1):175-181. OpenURL

  28. Prabhakaran M: The distribution of physical, chemical and conformational properties in signal and nascent peptides.

    Biochem J 1990, 269(3):691-696. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  29. Nielsen H, Brunak S, von Heijne G: Machine learning approaches for the prediction of signal peptides and other protein sorting signals.

    Protein engineering 1999, 12(1):3-9. PubMed Abstract | Publisher Full Text OpenURL

  30. Nielsen H, Engelbrecht J, Brunak S, VonHeijne G: Identification of prokaryotic and eukaryotic signal peptides and prediction of their cleavage sites.

    Protein engineering 1997, 10(1):1-6. Publisher Full Text OpenURL

  31. Tyedmers J, Mogk A, Bukau B: Cellular strategies for controlling protein aggregation.

    Nat Rev Mol Cell Bio 2010, 11(11):777-788. Publisher Full Text OpenURL

  32. Nielsen H, Krogh A: Prediction of signal peptides and signal anchors by a hidden Markov model.

    Proc Int Conf Intell Syst Mol Biol 1998, 6:122-130. PubMed Abstract OpenURL

  33. Kawashima S, Pokarowski P, Pokarowska M, Kolinski A, Katayama T, Kanehisa M: AAindex: amino acid index database, progress report 2008.

    Nucleic acids research 2008, 36:202-205. Publisher Full Text OpenURL

  34. Friedman JH: Greedy function approximation: a gradient boosting machine.

    Ann Stat 2001, 29(5):1189-1232. OpenURL

  35. Breiman L, Friedman JH, Olshen RA, Stone CJ: Classification and Regression Trees. Belmont, California: Wadsworth; 1984. OpenURL

  36. Rosenblatt F: The Perceptron - a Probabilistic model for information-storage and organization in the brain.

    Psychol Rev 1958, 65(6):386-408. PubMed Abstract OpenURL

  37. Haenlein M, Kaplan AM: A beginner's guide to partial least squares analysis.

    Underst Stat 2004, 3(4):283-297. Publisher Full Text OpenURL

  38. Cover TM, Hart PE: Nearest neighbor pattern classification.

    Ieee T Inform Theory 1967, 13(1):21-27. OpenURL

  39. Friedman N, Geiger D, Goldszmidt M: Bayesian network classifiers.

    Mach Learn 1997, 29(2–3):131-163. OpenURL

  40. Freund Y, Schapire RE: A decision-theoretic generalization of on-line learning and an application to boosting.

    J Comput Syst Sci 1997, 55(1):119-139. Publisher Full Text OpenURL

  41. Kuhn M: Building Predictive Models in R Using the caret Package.

    J Stat Softw 2008, 28(5):1-26. OpenURL

  42. Guyon S, Weston J, Barnhill S: Gene selection for cancer classification using support vector machines.

    Mach Learn 2002, 46:389-422. Publisher Full Text OpenURL

  43. Diaz-Uriarte R, Gene SF, Var Sel RF: A web-based tool and R package for gene selection and classification using random forest.

    BMC Bioinforma 2007, 8:328. BioMed Central Full Text OpenURL

  44. Baldi P, Brunak S, Chauvin Y, Andersen CA, Nielsen H: Assessing the accuracy of prediction algorithms for classification: an overview.

    Bioinformatics (Oxford, England) 2000, 16(5):412-424. Publisher Full Text OpenURL

  45. West MW, Wang WX, Patterson J, Mancias JD, Beasley JR, Hecht MH: De novo amyloid proteins from designed combinatorial libraries.

    Proc Natl Acad Sci USA 1999, 96(20):11211-11216. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL