从已知二级结构预测蛋白质三级模型的组合距离约束方法

Gareth Chelvanayagam , Lukas Knecht , Thomas Jenny , Steven A Benner , Gaston H Gonnet
{"title":"从已知二级结构预测蛋白质三级模型的组合距离约束方法","authors":"Gareth Chelvanayagam ,&nbsp;Lukas Knecht ,&nbsp;Thomas Jenny ,&nbsp;Steven A Benner ,&nbsp;Gaston H Gonnet","doi":"10.1016/S1359-0278(98)00023-6","DOIUrl":null,"url":null,"abstract":"<div><p><strong>Background</strong>: Distance geometry methods allow protein structures to be constructed using a large number of distance constraints, which can be elucidated by experimental techniques such as NMR. New methods for gleaning tertiary structural information from multiple sequence alignments make it possible for distance constraints to be predicted from sequence information alone. The basic distance geometry method can thus be applied using these empirically derived distance constraints. Such an approach, which incorporates a novel combinatoric procedure, is reported here.</p><p><strong>Results</strong>: Given the correct sheet topology and disulfide formations, the fully automated procedure is generally able to construct native-like C<em>α</em> models for eight small<em>β</em>-protein structures. When the sheet topology was unknown but disulfide connectivities were included, all sheet topologies were explored by the combinatorial procedure. Using a simple geometric evaluation scheme, models with the correct sheet topology were ranked first in four of the eight example cases, second in three examples and third in one example. If neither the sheet topology nor the disulfide connectivities were given<em>a priori</em>, all combinations of sheet topologies and disulfides were explored by the combinatorial procedure. The evaluation scheme ranked the correct topology within the top five folds for half the example cases.</p><p><strong>Conclusions</strong>: The combinatorial procedure is a useful technique for identifying a limited number of low-resolution candidate folds for small, disulfide-rich, <em>β</em>-protein structures. Better results are obtained, however, if correct disulfide connectivities are known in advance. Combinatorial distance constraints can be applied whenever there are a sufficiently small number of finite connectivities.</p></div>","PeriodicalId":79488,"journal":{"name":"Folding & design","volume":"3 3","pages":"Pages 149-160"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1359-0278(98)00023-6","citationCount":"14","resultStr":"{\"title\":\"A combinatorial distance-constraint approach to predicting protein tertiary models from known secondary structure\",\"authors\":\"Gareth Chelvanayagam ,&nbsp;Lukas Knecht ,&nbsp;Thomas Jenny ,&nbsp;Steven A Benner ,&nbsp;Gaston H Gonnet\",\"doi\":\"10.1016/S1359-0278(98)00023-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><strong>Background</strong>: Distance geometry methods allow protein structures to be constructed using a large number of distance constraints, which can be elucidated by experimental techniques such as NMR. New methods for gleaning tertiary structural information from multiple sequence alignments make it possible for distance constraints to be predicted from sequence information alone. The basic distance geometry method can thus be applied using these empirically derived distance constraints. Such an approach, which incorporates a novel combinatoric procedure, is reported here.</p><p><strong>Results</strong>: Given the correct sheet topology and disulfide formations, the fully automated procedure is generally able to construct native-like C<em>α</em> models for eight small<em>β</em>-protein structures. When the sheet topology was unknown but disulfide connectivities were included, all sheet topologies were explored by the combinatorial procedure. Using a simple geometric evaluation scheme, models with the correct sheet topology were ranked first in four of the eight example cases, second in three examples and third in one example. If neither the sheet topology nor the disulfide connectivities were given<em>a priori</em>, all combinations of sheet topologies and disulfides were explored by the combinatorial procedure. The evaluation scheme ranked the correct topology within the top five folds for half the example cases.</p><p><strong>Conclusions</strong>: The combinatorial procedure is a useful technique for identifying a limited number of low-resolution candidate folds for small, disulfide-rich, <em>β</em>-protein structures. Better results are obtained, however, if correct disulfide connectivities are known in advance. Combinatorial distance constraints can be applied whenever there are a sufficiently small number of finite connectivities.</p></div>\",\"PeriodicalId\":79488,\"journal\":{\"name\":\"Folding & design\",\"volume\":\"3 3\",\"pages\":\"Pages 149-160\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1359-0278(98)00023-6\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Folding & design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1359027898000236\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Folding & design","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1359027898000236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

背景:距离几何方法允许使用大量的距离约束来构建蛋白质结构,这可以通过NMR等实验技术来阐明。从多个序列比对中收集三级结构信息的新方法使得仅从序列信息中预测距离约束成为可能。因此,基本的距离几何方法可以使用这些经验推导的距离约束来应用。这种方法,其中包括一个新的组合过程,在这里报告。结果:给定正确的薄片拓扑结构和二硫化物结构,全自动程序通常能够为八种小β蛋白结构构建类似天然的Cα模型。当薄片拓扑结构未知,但包含二硫化物连接时,通过组合过程探索所有薄片拓扑结构。使用简单的几何评价方案,具有正确薄片拓扑的模型在8个示例中有4个示例中排名第一,在3个示例中排名第二,在1个示例中排名第三。如果薄片拓扑结构和二硫化物的连通性都没有事先给定,则通过组合过程探索薄片拓扑结构和二硫化物的所有组合。在一半的示例中,评估方案将正确的拓扑排在前5位。结论:组合程序是一种有用的技术,用于鉴定少量的低分辨率候选折叠,用于小的,富含二硫化物的β-蛋白结构。然而,如果事先知道正确的二硫化物连通性,则会得到更好的结果。只要有足够少的有限连通性,就可以应用组合距离约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A combinatorial distance-constraint approach to predicting protein tertiary models from known secondary structure

Background: Distance geometry methods allow protein structures to be constructed using a large number of distance constraints, which can be elucidated by experimental techniques such as NMR. New methods for gleaning tertiary structural information from multiple sequence alignments make it possible for distance constraints to be predicted from sequence information alone. The basic distance geometry method can thus be applied using these empirically derived distance constraints. Such an approach, which incorporates a novel combinatoric procedure, is reported here.

Results: Given the correct sheet topology and disulfide formations, the fully automated procedure is generally able to construct native-like Cα models for eight smallβ-protein structures. When the sheet topology was unknown but disulfide connectivities were included, all sheet topologies were explored by the combinatorial procedure. Using a simple geometric evaluation scheme, models with the correct sheet topology were ranked first in four of the eight example cases, second in three examples and third in one example. If neither the sheet topology nor the disulfide connectivities were givena priori, all combinations of sheet topologies and disulfides were explored by the combinatorial procedure. The evaluation scheme ranked the correct topology within the top five folds for half the example cases.

Conclusions: The combinatorial procedure is a useful technique for identifying a limited number of low-resolution candidate folds for small, disulfide-rich, β-protein structures. Better results are obtained, however, if correct disulfide connectivities are known in advance. Combinatorial distance constraints can be applied whenever there are a sufficiently small number of finite connectivities.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信