Distance dependency and minimum amino acid alphabets for decoy scoring potentials
Identifieur interne : 000584 ( Main/Curation ); précédent : 000583; suivant : 000585Distance dependency and minimum amino acid alphabets for decoy scoring potentials
Auteurs : Susanne Pape [Allemagne] ; Franziska Hoffgaard [Allemagne] ; Mirjam Dür [Allemagne] ; Kay Hamacher [Allemagne]Source :
- Journal of Computational Chemistry [ 0192-8651 ] ; 2013-01-05.
English descriptors
- KwdEn :
Abstract
The validity and accuracy of a proposed tertiary structure of a protein can be assessed in several ways. Scoring such a structure by a knowledge‐based potential is a well‐known approach in molecular biophysics, an important task in structure prediction and refinement, and a key step in several experiments on protein structures. Although several parameterizations for such models have been derived over the course of time, improvements in accuracy by explicitly using continuous distance information have not been suggested yet. We close this methodological gap by formulating the parameterization of a protein structure model as a linear program. Optimization of the parameters was performed using amino acid distances calculated for the residues in topology rich 2830 protein structures. We show the capability of our derived model to discriminate between native structures and decoys for a diverse set of proteins. In addition, we discuss the effect of reduced amino acid alphabets on the model. In contrast to studies focusing on binary contact schemes (without considering distance dependencies and proposing five symbols as optimal alphabet size), we find an accurate protein alphabet size to contain at least five symbols, preferably more, to assure a satisfactory fold recognition capability. © 2012 Wiley Periodicals, Inc.
Url:
DOI: 10.1002/jcc.23099
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001A82
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001965
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000047
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :000587
Links to Exploration step
ISTEX:A65A4831A5DF7ED8072E5017802D7704EE764AD2Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Distance dependency and minimum amino acid alphabets for decoy scoring potentials</title><author><name sortKey="Pape, Susanne" sort="Pape, Susanne" uniqKey="Pape S" first="Susanne" last="Pape">Susanne Pape</name></author><author><name sortKey="Hoffgaard, Franziska" sort="Hoffgaard, Franziska" uniqKey="Hoffgaard F" first="Franziska" last="Hoffgaard">Franziska Hoffgaard</name></author><author><name sortKey="Dur, Mirjam" sort="Dur, Mirjam" uniqKey="Dur M" first="Mirjam" last="Dür">Mirjam Dür</name></author><author><name sortKey="Hamacher, Kay" sort="Hamacher, Kay" uniqKey="Hamacher K" first="Kay" last="Hamacher">Kay Hamacher</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A65A4831A5DF7ED8072E5017802D7704EE764AD2</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1002/jcc.23099</idno><idno type="url">https://api.istex.fr/document/A65A4831A5DF7ED8072E5017802D7704EE764AD2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A82</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A82</idno><idno type="wicri:Area/Istex/Curation">001965</idno><idno type="wicri:Area/Istex/Checkpoint">000047</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000047</idno><idno type="wicri:doubleKey">0192-8651:2013:Pape S:distance:dependency:and</idno><idno type="wicri:Area/Main/Merge">000587</idno><idno type="wicri:Area/Main/Curation">000584</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Distance dependency and minimum amino acid alphabets for decoy scoring potentials</title><author><name sortKey="Pape, Susanne" sort="Pape, Susanne" uniqKey="Pape S" first="Susanne" last="Pape">Susanne Pape</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Mathematics, Friedrich‐Alexander University Erlangen‐Nürnberg, Erlangen</wicri:regionArea><placeName><settlement type="city">Erlangen</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Moyenne-Franconie</region></placeName></affiliation></author><author><name sortKey="Hoffgaard, Franziska" sort="Hoffgaard, Franziska" uniqKey="Hoffgaard F" first="Franziska" last="Hoffgaard">Franziska Hoffgaard</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Chemistry, TU Dortmund, Darmstadt</wicri:regionArea><placeName><region type="land" nuts="1">Hesse (Land)</region><region type="district" nuts="2">District de Darmstadt</region><settlement type="city">Darmstadt</settlement></placeName></affiliation></author><author><name sortKey="Dur, Mirjam" sort="Dur, Mirjam" uniqKey="Dur M" first="Mirjam" last="Dür">Mirjam Dür</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Mathematics, University of Trier, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation></author><author><name sortKey="Hamacher, Kay" sort="Hamacher, Kay" uniqKey="Hamacher K" first="Kay" last="Hamacher">Kay Hamacher</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Computational Biology Group, Department of Biology, TU Darmstadt, Darmstadt</wicri:regionArea><placeName><region type="land" nuts="1">Hesse (Land)</region><region type="district" nuts="2">District de Darmstadt</region><settlement type="city">Darmstadt</settlement></placeName></affiliation><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Computational Biology Group, Department of Biology, TU Darmstadt, Darmstadt</wicri:regionArea><placeName><region type="land" nuts="1">Hesse (Land)</region><region type="district" nuts="2">District de Darmstadt</region><settlement type="city">Darmstadt</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Computational Chemistry</title><title level="j" type="abbrev">J. Comput. Chem.</title><idno type="ISSN">0192-8651</idno><idno type="eISSN">1096-987X</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2013-01-05">2013-01-05</date><biblScope unit="volume">34</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="10">10</biblScope><biblScope unit="page" to="20">20</biblScope></imprint><idno type="ISSN">0192-8651</idno></series><idno type="istex">A65A4831A5DF7ED8072E5017802D7704EE764AD2</idno><idno type="DOI">10.1002/jcc.23099</idno><idno type="ArticleID">JCC23099</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0192-8651</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>amino acid interactions</term><term>linear programming</term><term>optimization</term><term>protein structure</term><term>structure threading</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The validity and accuracy of a proposed tertiary structure of a protein can be assessed in several ways. Scoring such a structure by a knowledge‐based potential is a well‐known approach in molecular biophysics, an important task in structure prediction and refinement, and a key step in several experiments on protein structures. Although several parameterizations for such models have been derived over the course of time, improvements in accuracy by explicitly using continuous distance information have not been suggested yet. We close this methodological gap by formulating the parameterization of a protein structure model as a linear program. Optimization of the parameters was performed using amino acid distances calculated for the residues in topology rich 2830 protein structures. We show the capability of our derived model to discriminate between native structures and decoys for a diverse set of proteins. In addition, we discuss the effect of reduced amino acid alphabets on the model. In contrast to studies focusing on binary contact schemes (without considering distance dependencies and proposing five symbols as optimal alphabet size), we find an accurate protein alphabet size to contain at least five symbols, preferably more, to assure a satisfactory fold recognition capability. © 2012 Wiley Periodicals, Inc.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000584 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 000584 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:A65A4831A5DF7ED8072E5017802D7704EE764AD2
|texte= Distance dependency and minimum amino acid alphabets for decoy scoring potentials
}}
| This area was generated with Dilib version V0.6.31. |  |