Suppr超能文献

Structure prediction of protein complexes by an NMR-based protein docking algorithm.

作者信息

Kohlbache O, Burchardt A, Moll A, Hildebrandt A, Bayer P, Lenhof H P

机构信息

Max-Planck-Institut für Informatik, Saarbrücken, Germany.

出版信息

J Biomol NMR. 2001 May;20(1):15-21. doi: 10.1023/a:1011216130486.

Abstract

Protein docking algorithms can be used to study the driving forces and reaction mechanisms of docking processes. They are also able to speed up the lengthy process of experimental structure elucidation of protein complexes by proposing potential structures. In this paper, we are discussing a variant of the protein-protein docking problem, where the input consists of the tertiary structures of proteins A and B plus an unassigned one-dimensional 1H-NMR spectrum of the complex AB. We present a new scoring function for evaluating and ranking potential complex structures produced by a docking algorithm. The scoring function computes a 'theoretical' 1H-NMR spectrum for each tentative complex structure and subtracts the calculated spectrum from the experimental one. The absolute areas of the difference spectra are then used to rank the potential complex structures. In contrast to formerly published approaches (e.g. [Morelli et al. (2000) Biochemistry, 39, 2530-2537]) we do not use distance constraints (intermolecular NOE constraints). We have tested the approach with four protein complexes whose three-dimensional structures are stored in the PDB data bank (Bernstein et al., 1977) and whose 1H-NMR shift assignments are available from the BMRB database. The best result was obtained for an example, where all standard scoring functions failed completely. Here, our new scoring function achieved an almost perfect separation between good approximations of the true complex structure and false positives.

摘要

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验