Department of Biochemistry & Biophysics, Texas A&M University, College Station, TX, 77843, USA.
Graduate Group in Biochemistry & Molecular Biophysics, Perelman School of Medicine, University of Pennsylvania, Philadelphia, PA, 19014, USA.
Nat Commun. 2023 Mar 21;14(1):1556. doi: 10.1038/s41467-023-37219-z.
Assignment of resonances of nuclear magnetic resonance (NMR) spectra to specific atoms within a protein remains a labor-intensive and challenging task. Automation of the assignment process often remains a bottleneck in the exploitation of solution NMR spectroscopy for the study of protein structure-dynamics-function relationships. We present an approach to the assignment of backbone triple resonance spectra of proteins. A Bayesian statistical analysis of predicted and observed chemical shifts is used in conjunction with inter-spin connectivities provided by triple resonance spectroscopy to calculate a pseudo-energy potential that drives a simulated annealing search for the most optimal set of resonance assignments. Termed Bayesian Assisted Assignments by Simulated Annealing (BARASA), a C++ program implementation is tested against systems ranging in size to over 450 amino acids including examples of intrinsically disordered proteins. BARASA is fast, robust, accommodates incomplete and incorrect information, and outperforms current algorithms - especially in cases of sparse data and is sufficiently fast to allow for real-time evaluation during data acquisition.
在蛋白质中,将核磁共振(NMR)谱的共振分配给特定的原子仍然是一项劳动密集型且具有挑战性的任务。分配过程的自动化通常仍然是利用溶液 NMR 光谱学研究蛋白质结构-动态-功能关系的瓶颈。我们提出了一种用于蛋白质的骨架三共振谱分配的方法。贝叶斯统计分析预测和观察到的化学位移与三共振光谱提供的自旋间连接相结合,以计算伪能势,该势驱动模拟退火搜索以获得最佳的共振分配集。该方法称为通过模拟退火的贝叶斯辅助分配(BARASA),其 C++程序实现已针对大小超过 450 个氨基酸的系统进行了测试,包括无序蛋白质的示例。BARASA 速度快、稳健、可适应不完整和不正确的信息,并且优于当前的算法 - 特别是在数据稀疏的情况下,并且足够快,可以在数据采集过程中进行实时评估。