EXHAUSTIVE MATCHING OF THE ENTIRE PROTEIN-SEQUENCE DATABASE
EXHAUSTIVE MATCHING OF THE ENTIRE PROTEIN-SEQUENCE DATABASE
复制标题
DOI：
10.1126/science.1604319
复制
发表时间：
1992-06-05
期刊：
影响因子：
56.9
通讯作者：
BENNER, SA
中科院分区：
文献类型：
--
作者：
GONNET, GH;COHEN, MA;BENNER, SA
整个蛋白质序列数据库已经完全匹配。从匹配中获得连续突变矩阵和评分缺口的模型，并用于将序列数据库组织为进化连接组件的集合。开发的方法是通用的，可以用来管理主要基因组测序项目产生的序列数据。通过穷举匹配所实现的比对是成功从头预测蛋白质折叠结构、重建古蛋白质序列和古生物代谢以及获得结构生物化学新视角的起点。
The entire protein sequence database has been exhaustively matched. Definitive mutation matrices and models for scoring gaps were obtained from the matching and used to organize the sequence database as sets of evolutionarily connected components. The methods developed are general and can be used to manage sequence data generated by major genome sequencing projects. The alignments made possible by the exhaustive matching are the starting point for successful de novo prediction of the folded structures of proteins, for reconstructing sequences of ancient proteins and metabolisms in ancient organisms, and for obtaining new perspectives in structural biochemistry.