Abstract
Protein structure prediction (PSP) suites can predict ‘near-native’ protein models. However, not always these predicted models are close to the native structure with enough precision to be useful for biologists. The literature to date demonstrates that one of the best techniques to predict ‘near-native’ protein models is to use a fragment-based search strategy. Another technique that can help refine protein models is local optimisation. Local optimisation algorithms use the gradient of the function being optimised to suggest which move will bring the function value closer to its local minimum. In this work we combine the concepts of structural refinement through feature-based resampling, fragment-based PSP, and local optimisation to create an algorithm that can create protein models that are closer to their native states. In experiments we demonstrated that our new method generates models that are close to their native conformations. For structures in the test set, it obtained an average RMSD of 5.09\( \textrm{\AA}\) and an average best TM-Score of 0.47 when no local optimisation was applied. However, by applying local optimisation to our algorithm, additional improvements were achieved.
Chapter PDF
Similar content being viewed by others
References
Consortium, U.: The universal protein resource (uniprot) 2009. Nucleic Acids Research 37, D169–D174 (2009)
Folkman, L., Stantic, B., Sattar, A.: Sequence-only evolutionary and predicted structural features for the prediction of stability changes in protein mutants. BMC Bioinformatics 14(suppl. 2), S6 (2013)
Sali, A., Blundell, T.: Comparative protein modelling by satisfaction of spatial restraints. Journal of Molecular Biology 234(3), 779–815 (1993)
Zhang, Y., Skolnick, J.: Automated structure prediction of weakly homologous proteins on a genomic scale. PNAS 101(20), 7594–7599 (2004)
Simons, K.: et al. Prospects for ab initio protein structural genomics. Journal of Moleculer Biology 306, 1191–1199 (2001)
Meredith, D.: Rosetta tackles the extreme origami of protein folding. HHMI Bulletin 14, 20–23 (2001)
Zhang, Y.: Template-based modeling and free modeling by I-TASSER in CASP7. Proteins 8, 108–117 (2007)
Rohl, C., Strauss, C., Baker, D.: Protein structure prediction using rosetta. Methods Enzymology 383, 66–93 (2004)
Bonnans, J.: Numerical optimization: theoretical and practical aspects, 2nd edn. Springer (2006)
Liu, D., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical programming 45(1), 503–528 (1989)
Higgs, T., Stantic, B., Hoque, T., Sattar, A.: Genetic algorithm feature-based resampling for protein structure prediction. In: IEEE World Congress on Computational Intelligence, pp. 2665–2672 (2010)
Higgs, T., Stantic, B., Hoque, T., Sattar, A.: Refining genetic algorithm twin removal for high-resolution protein structure prediction. In: IEEE Congress on Evolutionary Computation CEC 2012, 251–258 (2012)
Folkman, L., Pullan, W., Stantic, B.: Generic parallel genetic algorithm framework for protein optimisation. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011, Part II. LNCS, vol. 7017, pp. 64–73. Springer, Heidelberg (2011)
CASP8: 8th community wide experiment on the critical assessment of techniques for protein structure prediction (2008), http://predictioncenter.org/casp8/ (last accessed: July 2012)
Carugo, O.: Statistical validation of the rootmeansquaredistance, a measure of protein structural proximity. Protein Engineering, Design and Selection 20(1), 3338 (2007)
Sayle, R.: Molecular visualization freeware and rasmol classic site (2009), http://www.umass.edu/microbio/rasmol/index2.htm (last accessed: February 2011)
Bowman, G., Pande, V.: Simulated tempering yields insight into the low-resolution rosetta scoring functions. Proteins: Structure, Function, and Bioinformatics 74, 777–788 (2009)
Shmygelska, A., Levitt, M.: Generalized ensemble methods for de nova structure prediction. PNAS 106(5), 1415–1420 (2009)
Zhang, Y., Skolnick, J.: Scoring function for automated assessment of protein structure template quality. Proteins 57, 702–710 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Higgs, T., Folkman, L., Stantic, B. (2013). Combining Protein Fragment Feature-Based Resampling and Local Optimisation. In: Ngom, A., Formenti, E., Hao, JK., Zhao, XM., van Laarhoven, T. (eds) Pattern Recognition in Bioinformatics. PRIB 2013. Lecture Notes in Computer Science(), vol 7986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39159-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-39159-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39158-3
Online ISBN: 978-3-642-39159-0
eBook Packages: Computer ScienceComputer Science (R0)