Skip navigation

Main Menu

Global Menu




tab menu

  • View
  • All
  • Mathematics
  • Physics
  • Computational Sciences
  • Center for Advanced Computation

Seminar View

TITLE Protein structure modeling and refinement by global optimization in CASP12
KIAS AUTHORS Lee, Jooyoung,Hong, Seung Hwan,Joung, InSuk,Flores-Canales, Jose C.,Manavalan, Balachandran,Cheng, Qianyi,Heo, Seungryong,Kim, Jong Yun,Lee, Sun Young,Nam, Mikyung,Joo, Keehyoung,Lee, In-Ho,Lee, Sung Jong
ABSTRACT For protein structure modeling in the CASP12 experiment, we have developed a new protocol based on our previous CASP11 approach. The global optimization method of conformational space annealing (CSA) was applied to 3 stages of modeling: multiple sequence-structure alignment, three-dimensional (3D) chain building, and side-chain re-modeling. For better template selection and model selection, we updated our model quality assessment (QA) method with the newly developed SVMQA (support vector machine for quality assessment). For 3D chain building, we updated our energy function by including restraints generated from predicted residue-residue contacts. New energy terms for the predicted secondary structure and predicted solvent accessible surface area were also introduced. For difficult targets, we proposed a new method, LEEab, where the template term played a less significant role than it did in LEE, complemented by increased contributions from other terms such as the predicted contact term. For TBM (template-based modeling) targets, LEE performed better than LEEab, but for FM targets, LEEab was better. For model refinement, we modified our CASP11 molecular dynamics (MD) based protocol by using explicit solvents and tuning down restraint weights. Refinement results from MD simulations that used a new augmented statistical energy term in the force field were quite promising. Finally, when using inaccurate information (such as the predicted contacts), it was important to use the Lorentzian function for which the maximal penalty arising from wrong information is always bounded.
  • before page
  • list
  • next page
Seminar List