BMC Bioinformatics · 2016 · 49 citations · 55 references
Life SciencesBiochemistryBioinformaticsProtein FoldingProtein Structure PredictionStructural BioinformaticsProtein Fold RecognitionProtein Sequence AnalysisProtein StructureProtein Structure ModelingCross-validationFeature Combination StrategiesGradient Boosting TreesMean Absolute ErrorProtein FoldsRegression TreesSolvent Accessibility PredictionSolvent Accessible Surface Area
BACKGROUND: Protein solvent accessibility prediction is a pivotal intermediate step towards modeling protein tertiary structures directly from one-dimensional sequences. It also plays an important part in identifying protein folds and domains. Although some methods have been presented to the protein solvent accessibility prediction in recent years, the performance is far from satisfactory. In this work, we propose PredRSA, a computational method that can accurately predict relative solvent accessible surface area (RSA) of residues by exploring various local and global sequence features which have been observed to be associated with solvent accessibility. Based on these features, a novel and efficient approach, Gradient Boosted Regression Trees (GBRT), is first adopted to predict RSA. RESULTS: Experimental results obtained from 5-fold cross-validation based on the Manesh-215 dataset show that the mean absolute error (MAE) and the Pearson correlation coefficient (PCC) of PredRSA are 9.0 % and 0.75, respectively, which are better than that of the existing methods. Moreover, we evaluate the performance of PredRSA using an independent test set of 68 proteins. Compared with the state-of-the-art approaches (SPINE-X and ASAquick), PredRSA achieves a significant improvement on the prediction quality. CONCLUSIONS: Our experimental results show that the Gradient Boosted Regression Trees algorithm and the novel feature combination are quite effective in relative solvent accessibility prediction. The proposed PredRSA method could be useful in assisting the prediction of protein structures by applying the predicted RSA as useful restraints.
55
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
The Pfam Protein Families Database
Alex Bateman · Nucleic Acids Research · 2002 · 14.2K citations · Full text
Robust Estimation of a Location Parameter
Peter J. Huber · The Annals of Mathematical Statistics · 1964 · 7K citations · Full text