• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验

高效子结构均方根偏差查询算法。

Efficient substructure RMSD query algorithms.

作者信息

Shibuya Tetsuo

机构信息

Human Genome Center, Institute of Medical Science, University of Tokyo, Minato-ku, Tokyo, Japan.

出版信息

J Comput Biol. 2007 Nov;14(9):1201-7. doi: 10.1089/cmb.2007.0079.

DOI:10.1089/cmb.2007.0079
PMID:17990976
Abstract

Protein structure analysis is a very important research topic in the molecular biology of the post-genomic era. The root mean square deviation (RMSD) is the most frequently used measure for comparing two protein three-dimensional (3-D) structures. In this paper, we deal with two fundamental problems related to the RMSD. We first deal with a problem called the "range RMSD query" problem. Given an aligned pair of structures, the problem is to compute the RMSD between two aligned substructures of them without gaps. This problem has many applications in protein structure analysis. We propose a linear-time preprocessing algorithm that enables constant-time RMSD computation. Next, we consider a problem called the "substructure RMSD query" problem, which is a generalization of the above range RMSD query problem. It is a problem to compute the RMSD between any substructures of two unaligned structures without gaps. Based on the algorithm for the range RMSD problem, we propose an O(nm) preprocessing algorithm that enables constant-time RMSD computation, where n and m are the lengths of the given structures. Moreover, we propose O(nm log r/r)-time and O(nm/r)-space preprocessing algorithm that enables O(r) query, where r is an arbitrary integer such that 1 < or = r < or = min(n, m). We also show that our strategy also works for another measure called the unit-vector root mean square deviation (URMSD), which is a variant of the RMSD.

摘要

蛋白质结构分析是后基因组时代分子生物学中一个非常重要的研究课题。均方根偏差(RMSD)是比较两个蛋白质三维(3-D)结构时最常用的度量。在本文中,我们处理与RMSD相关的两个基本问题。我们首先处理一个称为“范围RMSD查询”的问题。给定一对对齐的结构,该问题是计算它们两个无间隙对齐子结构之间的RMSD。这个问题在蛋白质结构分析中有许多应用。我们提出了一种线性时间预处理算法,该算法能够进行常数时间的RMSD计算。接下来,我们考虑一个称为“子结构RMSD查询”的问题,它是上述范围RMSD查询问题的推广。它是计算两个未对齐结构的任意子结构之间无间隙的RMSD的问题。基于范围RMSD问题的算法,我们提出了一种O(nm)预处理算法,该算法能够进行常数时间的RMSD计算,其中n和m分别是给定结构的长度。此外,我们提出了O(nm log r/r)时间和O(nm/r)空间的预处理算法,该算法能够进行O(r)查询,其中r是一个任意整数,满足1 <= r <= min(n, m)。我们还表明,我们的策略也适用于另一种称为单位向量均方根偏差(URMSD)的度量,它是RMSD的一种变体。

相似文献

1
Efficient substructure RMSD query algorithms.高效子结构均方根偏差查询算法。
J Comput Biol. 2007 Nov;14(9):1201-7. doi: 10.1089/cmb.2007.0079.
2
Searching protein 3-D structures in linear time.在线性时间内搜索蛋白质三维结构。
J Comput Biol. 2010 Mar;17(3):203-19. doi: 10.1089/cmb.2009.0148.
3
Searching protein three-dimensional structures in faster than linear time.以快于线性时间的速度搜索蛋白质三维结构。
J Comput Biol. 2010 Apr;17(4):593-602. doi: 10.1089/cmb.2009.0217.
4
LB3D: a protein three-dimensional substructure search program based on the lower bound of a root mean square deviation value.LB3D:一个基于均方根偏差值下限的蛋白质三维子结构搜索程序。
J Comput Biol. 2012 May;19(5):493-503. doi: 10.1089/cmb.2011.0230. Epub 2012 Apr 17.
5
Multiple structure alignment by optimal RMSD implies that the average structure is a consensus.通过最优均方根偏差(RMSD)进行的多结构比对意味着平均结构是一种共识结构。
Comput Syst Bioinformatics Conf. 2006:79-87.
6
Fast hinge detection algorithms for flexible protein structures.快速铰链检测算法用于柔性蛋白质结构。
IEEE/ACM Trans Comput Biol Bioinform. 2010 Apr-Jun;7(2):333-41. doi: 10.1109/TCBB.2008.62.
7
Linear-time protein 3-D structure searching with insertions and deletions.带插入和缺失的线性时间蛋白质三维结构搜索
Algorithms Mol Biol. 2010 Jan 4;5:7. doi: 10.1186/1748-7188-5-7.
8
Finding All Longest Common Segments in Protein Structures Efficiently.高效查找蛋白质结构中的所有最长公共片段
IEEE/ACM Trans Comput Biol Bioinform. 2015 May-Jun;12(3):644-55. doi: 10.1109/TCBB.2014.2372782.
9
A space-efficient algorithm for the constrained pairwise sequence alignment problem.一种用于受限成对序列比对问题的节省空间的算法。
Genome Inform. 2005;16(2):237-46.
10
Efficient computation of root mean square deviations under rigid transformations.刚性变换下均方根偏差的高效计算
J Comput Chem. 2014 Apr 15;35(10):765-71. doi: 10.1002/jcc.23513. Epub 2013 Dec 19.

引用本文的文献

1
In silico analysis of Ffp1, an ancestral Porphyromonas spp. fimbrillin, shows differences with Fim and Mfa.对祖先卟啉单胞菌属菌毛蛋白Ffp1的计算机模拟分析显示,其与菌毛蛋白(Fim)和微纤毛蛋白(Mfa)存在差异。
Access Microbiol. 2024 Jul 11;6(7). doi: 10.1099/acmi.0.000771.v3. eCollection 2024.
2
Structures, Energetics, and Spectra of (NH) and (OH) Tautomers of 2-(2-Hydroxyphenyl)-1-azaazulene: A Density Functional Theory/Time-Dependent Density Functional Theory Study.2-(2-羟基苯基)-1-氮杂薁的(NH)和(OH)互变异构体的结构、能量学和光谱:密度泛函理论/含时密度泛函理论研究
ACS Omega. 2022 Apr 15;7(16):14222-14238. doi: 10.1021/acsomega.2c00866. eCollection 2022 Apr 26.
3
Yeast-based assays for characterization of the functional effects of single nucleotide polymorphisms in human DNA repair genes.
基于酵母的方法用于研究人类 DNA 修复基因中单核苷酸多态性的功能效应。
PLoS One. 2018 Mar 9;13(3):e0193823. doi: 10.1371/journal.pone.0193823. eCollection 2018.
4
Linear-time protein 3-D structure searching with insertions and deletions.带插入和缺失的线性时间蛋白质三维结构搜索
Algorithms Mol Biol. 2010 Jan 4;5:7. doi: 10.1186/1748-7188-5-7.