Cargando…
A knowledge-driven approach for crystallographic protein model completion
One of the most cumbersome and time-demanding tasks in completing a protein model is building short missing regions or ‘loops’. A method is presented that uses structural and electron-density information to build the most likely conformations of such loops. Using the distribution of angles and dihed...
Autores principales: | , , , , , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
International Union of Crystallography
2008
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2467521/ https://www.ncbi.nlm.nih.gov/pubmed/18391408 http://dx.doi.org/10.1107/S0907444908001558 |
_version_ | 1782157467852996608 |
---|---|
author | Joosten, Krista Cohen, Serge X. Emsley, Paul Mooij, Wijnand Lamzin, Victor S. Perrakis, Anastassis |
author_facet | Joosten, Krista Cohen, Serge X. Emsley, Paul Mooij, Wijnand Lamzin, Victor S. Perrakis, Anastassis |
author_sort | Joosten, Krista |
collection | PubMed |
description | One of the most cumbersome and time-demanding tasks in completing a protein model is building short missing regions or ‘loops’. A method is presented that uses structural and electron-density information to build the most likely conformations of such loops. Using the distribution of angles and dihedral angles in pentapeptides as the driving parameters, a set of possible conformations for the C(α) backbone of loops was generated. The most likely candidate is then selected in a hierarchical manner: new and stronger restraints are added while the loop is built. The weight of the electron-density correlation relative to geometrical considerations is gradually increased until the most likely loop is selected on map correlation alone. To conclude, the loop is refined against the electron density in real space. This is started by using structural information to trace a set of models for the C(α) backbone of the loop. Only in later steps of the algorithm is the electron-density correlation used as a criterion to select the loop(s). Thus, this method is more robust in low-density regions than an approach using density as a primary criterion. The algorithm is implemented in a loop-building program, Loopy, which can be used either alone or as part of an automatic building cycle. Loopy can build loops of up to 14 residues in length within a couple of minutes. The average root-mean-square deviation of the C(α) atoms in the loops built during validation was less than 0.4 Å. When implemented in the context of automated model building in ARP/wARP, Loopy can increase the completeness of the built models. |
format | Text |
id | pubmed-2467521 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2008 |
publisher | International Union of Crystallography |
record_format | MEDLINE/PubMed |
spelling | pubmed-24675212009-03-05 A knowledge-driven approach for crystallographic protein model completion Joosten, Krista Cohen, Serge X. Emsley, Paul Mooij, Wijnand Lamzin, Victor S. Perrakis, Anastassis Acta Crystallogr D Biol Crystallogr Research Papers One of the most cumbersome and time-demanding tasks in completing a protein model is building short missing regions or ‘loops’. A method is presented that uses structural and electron-density information to build the most likely conformations of such loops. Using the distribution of angles and dihedral angles in pentapeptides as the driving parameters, a set of possible conformations for the C(α) backbone of loops was generated. The most likely candidate is then selected in a hierarchical manner: new and stronger restraints are added while the loop is built. The weight of the electron-density correlation relative to geometrical considerations is gradually increased until the most likely loop is selected on map correlation alone. To conclude, the loop is refined against the electron density in real space. This is started by using structural information to trace a set of models for the C(α) backbone of the loop. Only in later steps of the algorithm is the electron-density correlation used as a criterion to select the loop(s). Thus, this method is more robust in low-density regions than an approach using density as a primary criterion. The algorithm is implemented in a loop-building program, Loopy, which can be used either alone or as part of an automatic building cycle. Loopy can build loops of up to 14 residues in length within a couple of minutes. The average root-mean-square deviation of the C(α) atoms in the loops built during validation was less than 0.4 Å. When implemented in the context of automated model building in ARP/wARP, Loopy can increase the completeness of the built models. International Union of Crystallography 2008-04-01 2008-03-19 /pmc/articles/PMC2467521/ /pubmed/18391408 http://dx.doi.org/10.1107/S0907444908001558 Text en © International Union of Crystallography 2008 http://journals.iucr.org/services/termsofuse.html This is an open-access article distributed under the terms described at http://journals.iucr.org/services/termsofuse.html. |
spellingShingle | Research Papers Joosten, Krista Cohen, Serge X. Emsley, Paul Mooij, Wijnand Lamzin, Victor S. Perrakis, Anastassis A knowledge-driven approach for crystallographic protein model completion |
title | A knowledge-driven approach for crystallographic protein model completion |
title_full | A knowledge-driven approach for crystallographic protein model completion |
title_fullStr | A knowledge-driven approach for crystallographic protein model completion |
title_full_unstemmed | A knowledge-driven approach for crystallographic protein model completion |
title_short | A knowledge-driven approach for crystallographic protein model completion |
title_sort | knowledge-driven approach for crystallographic protein model completion |
topic | Research Papers |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2467521/ https://www.ncbi.nlm.nih.gov/pubmed/18391408 http://dx.doi.org/10.1107/S0907444908001558 |
work_keys_str_mv | AT joostenkrista aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT cohensergex aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT emsleypaul aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT mooijwijnand aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT lamzinvictors aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT perrakisanastassis aknowledgedrivenapproachforcrystallographicproteinmodelcompletion AT joostenkrista knowledgedrivenapproachforcrystallographicproteinmodelcompletion AT cohensergex knowledgedrivenapproachforcrystallographicproteinmodelcompletion AT emsleypaul knowledgedrivenapproachforcrystallographicproteinmodelcompletion AT mooijwijnand knowledgedrivenapproachforcrystallographicproteinmodelcompletion AT lamzinvictors knowledgedrivenapproachforcrystallographicproteinmodelcompletion AT perrakisanastassis knowledgedrivenapproachforcrystallographicproteinmodelcompletion |