A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins.
We present a fast ab initio method for the prediction of local conformations in proteins. The program, PETRA, selects polypeptide fragments from a computer-generated database (APD) encoding all possible peptide fragments up to twelve amino acids long. Each fragment is defined by a representative set...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2000
|
| _version_ | 1797075043065266176 |
|---|---|
| author | Deane, C Blundell, T |
| author_facet | Deane, C Blundell, T |
| author_sort | Deane, C |
| collection | OXFORD |
| description | We present a fast ab initio method for the prediction of local conformations in proteins. The program, PETRA, selects polypeptide fragments from a computer-generated database (APD) encoding all possible peptide fragments up to twelve amino acids long. Each fragment is defined by a representative set of eight straight phi/psi pairs, obtained iteratively from a trial set by calculating how fragments generated from them represent the protein databank (PDB). Ninety-six percent (96%) of length five fragments in crystal structures, with a resolution better than 1.5 A and less than 25% identity, have a conformer in the database with less than 1 A root-mean-square deviation (rmsd). In order to select segments from APD, PETRA uses a set of simple rule-based filters, thus reducing the number of potential conformations to a manageable total. This reduced set is scored and sorted using rmsd fit to the anchor regions and a knowledge-based energy function dependent on the sequence to be modelled. The best scoring fragments can then be optimized by minimization of contact potentials and rmsd fit to the core model. The quality of the prediction made by PETRA is evaluated by calculating both the differences in rmsd and backbone torsion angles between the final model and the native fragment. The average rmsd ranges from 1.4 A for three residue loops to 3.9 A for eight residue loops. |
| first_indexed | 2024-03-06T23:44:49Z |
| format | Journal article |
| id | oxford-uuid:7089e31a-b133-4bee-9e87-072b908010a0 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T23:44:49Z |
| publishDate | 2000 |
| record_format | dspace |
| spelling | oxford-uuid:7089e31a-b133-4bee-9e87-072b908010a02022-03-26T19:37:52ZA novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:7089e31a-b133-4bee-9e87-072b908010a0EnglishSymplectic Elements at Oxford2000Deane, CBlundell, TWe present a fast ab initio method for the prediction of local conformations in proteins. The program, PETRA, selects polypeptide fragments from a computer-generated database (APD) encoding all possible peptide fragments up to twelve amino acids long. Each fragment is defined by a representative set of eight straight phi/psi pairs, obtained iteratively from a trial set by calculating how fragments generated from them represent the protein databank (PDB). Ninety-six percent (96%) of length five fragments in crystal structures, with a resolution better than 1.5 A and less than 25% identity, have a conformer in the database with less than 1 A root-mean-square deviation (rmsd). In order to select segments from APD, PETRA uses a set of simple rule-based filters, thus reducing the number of potential conformations to a manageable total. This reduced set is scored and sorted using rmsd fit to the anchor regions and a knowledge-based energy function dependent on the sequence to be modelled. The best scoring fragments can then be optimized by minimization of contact potentials and rmsd fit to the core model. The quality of the prediction made by PETRA is evaluated by calculating both the differences in rmsd and backbone torsion angles between the final model and the native fragment. The average rmsd ranges from 1.4 A for three residue loops to 3.9 A for eight residue loops. |
| spellingShingle | Deane, C Blundell, T A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title | A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title_full | A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title_fullStr | A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title_full_unstemmed | A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title_short | A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins. |
| title_sort | novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins |
| work_keys_str_mv | AT deanec anovelexhaustivesearchalgorithmforpredictingtheconformationofpolypeptidesegmentsinproteins AT blundellt anovelexhaustivesearchalgorithmforpredictingtheconformationofpolypeptidesegmentsinproteins AT deanec novelexhaustivesearchalgorithmforpredictingtheconformationofpolypeptidesegmentsinproteins AT blundellt novelexhaustivesearchalgorithmforpredictingtheconformationofpolypeptidesegmentsinproteins |