蛋白质折叠比较的排列拓扑字符串。

Linus O Johannissen, William R Taylor
{"title":"蛋白质折叠比较的排列拓扑字符串。","authors":"Linus O Johannissen,&nbsp;William R Taylor","doi":"10.1093/protein/gzg128","DOIUrl":null,"url":null,"abstract":"<p><p>Using the definitions of protein folds encoded in a text string, a dynamic programming algorithm was devised to compare these and identify their largest common substructure and calculate the distance (in terms of the number of edit operations) that this lay from each structure. This provided a metric on which the folds were clustered into a 'phylogenetic' tree. This construction differs from previous automatic structure clustering algorithms as it has explicit representation of the structures at 'ancestral' branching nodes, even when these have no corresponding known structure. The resulting tree was compared with that compiled by an 'expert' in the field and while there was broad agreement, differences were found that resulted from differing degrees of emphasis being placed on the types of operations that can be used to transform structures. Some concluding speculations on the relationship of such trees to the evolutionary history and folding of the proteins are advanced.</p>","PeriodicalId":20902,"journal":{"name":"Protein engineering","volume":"16 12","pages":"949-55"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/protein/gzg128","citationCount":"21","resultStr":"{\"title\":\"Protein fold comparison by the alignment of topological strings.\",\"authors\":\"Linus O Johannissen,&nbsp;William R Taylor\",\"doi\":\"10.1093/protein/gzg128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Using the definitions of protein folds encoded in a text string, a dynamic programming algorithm was devised to compare these and identify their largest common substructure and calculate the distance (in terms of the number of edit operations) that this lay from each structure. This provided a metric on which the folds were clustered into a 'phylogenetic' tree. This construction differs from previous automatic structure clustering algorithms as it has explicit representation of the structures at 'ancestral' branching nodes, even when these have no corresponding known structure. The resulting tree was compared with that compiled by an 'expert' in the field and while there was broad agreement, differences were found that resulted from differing degrees of emphasis being placed on the types of operations that can be used to transform structures. Some concluding speculations on the relationship of such trees to the evolutionary history and folding of the proteins are advanced.</p>\",\"PeriodicalId\":20902,\"journal\":{\"name\":\"Protein engineering\",\"volume\":\"16 12\",\"pages\":\"949-55\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1093/protein/gzg128\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Protein engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/protein/gzg128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Protein engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/protein/gzg128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

使用在文本字符串中编码的蛋白质折叠的定义,设计了一个动态规划算法来比较它们,并确定它们最大的公共子结构,并计算它与每个结构的距离(根据编辑操作的数量)。这提供了一个度量,在这个度量上折叠被聚集成一个“系统发育”树。这种结构不同于以前的自动结构聚类算法,因为它在“祖先”分支节点上有明确的结构表示,即使这些节点没有相应的已知结构。将生成的树与该领域“专家”编制的树进行比较,虽然存在广泛的共识,但由于对可用于转换结构的操作类型的重视程度不同,发现了差异。最后对这类树与蛋白质的进化史和折叠的关系提出了一些结论性的推测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Protein fold comparison by the alignment of topological strings.

Using the definitions of protein folds encoded in a text string, a dynamic programming algorithm was devised to compare these and identify their largest common substructure and calculate the distance (in terms of the number of edit operations) that this lay from each structure. This provided a metric on which the folds were clustered into a 'phylogenetic' tree. This construction differs from previous automatic structure clustering algorithms as it has explicit representation of the structures at 'ancestral' branching nodes, even when these have no corresponding known structure. The resulting tree was compared with that compiled by an 'expert' in the field and while there was broad agreement, differences were found that resulted from differing degrees of emphasis being placed on the types of operations that can be used to transform structures. Some concluding speculations on the relationship of such trees to the evolutionary history and folding of the proteins are advanced.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of Novel Cellular Imaging Tools Using Protein Engineering High‐Throughput Mass Spectrometry Complements Protein Engineering Programming Novel Cancer Therapeutics: Design Principles for Chimeric Antigen Receptors Recent Advances in Cell Surface Display Technologies for Directed Protein Evolution Protein Engineering by Efficient Sequence Space Exploration Through Combination of Directed Evolution and Computational Design Methodologies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1