Suppr超能文献

利用Needleman-Wunsch算法对蛋白质结构进行快速无偏比较。

A fast unbiased comparison of protein structures by means of the Needleman-Wunsch algorithm.

作者信息

Rose J, Eisenmenger F

机构信息

Institute for Molecular Biology, Academy of Sciences, Berlin, Germany.

出版信息

J Mol Evol. 1991 Apr;32(4):340-54. doi: 10.1007/BF02102193.

Abstract

A fast dynamic programming algorithm for the spatial superposition of protein structure without prior knowledge of an initial alignment has been developed. The program was applied to serine proteases, hemoglobins, cytochromes C, small copper-binding proteins, and lysozymes. In most cases the existing structural homology could be detected in a completely unbiased way. The results of the method presented are in general agreement with other studies. Applying our method, the different alignment results obtained by other authors for serine proteases and cytochromes C can be classified in terms of different alignment parameters such as gap penalties or cut-off length. Limitations of the method are discussed.

摘要

已开发出一种快速动态规划算法,用于在无需初始比对先验知识的情况下进行蛋白质结构的空间叠加。该程序应用于丝氨酸蛋白酶、血红蛋白、细胞色素C、小型铜结合蛋白和溶菌酶。在大多数情况下,能够以完全无偏差的方式检测到现有的结构同源性。所提出方法的结果总体上与其他研究一致。应用我们的方法,其他作者针对丝氨酸蛋白酶和细胞色素C获得的不同比对结果可以根据不同的比对参数(如空位罚分或截止长度)进行分类。讨论了该方法的局限性。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验