Protein structure prediction (PSP) suites can predict 'neartive' protein models. However, not always these predicted models are close to the tive structure with enough precision to be useful for biologists. The literature to date demonstrates that one of the best techniques to predict 'near-tive' 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 tive states. In experiments we demonstrated that our new method generates models that are close to their tive conformations. For structures in the test set, it obtained an average RMSD of 5.09`and an average best TM-Score of 0.47 when no local optimisation was applied. However, by applying local optimisation to our algorithm, additiol improvements were achieved.
PRIB 2013 (2013)
Unless otherwise indicated, works by Griffith University Scholars are © Griffith University. For further details please refer to the University Intellectual Property Policy.