...
首页> 外文期刊>International Journal of Foundations of Computer Science >AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE
【24h】

AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE

机译:一种针对蛋白质数据库匹配缺口序列标签的自动方法

获取原文
获取原文并翻译 | 示例

摘要

In Biochemistry, tandem mass spectrometry (MS/MS) is the most common method for peptide and protein identifications. One computational method to get a peptide sequence from the MS/MS data is called de novo sequencing, which is becoming more and more important in this area. However De novo sequencing usually can only confidently determine partial sequences, while the undetermined parts are represented by "mass gaps". We call such a partially determined sequence a gapped sequence tag. When a gapped sequence tag is searched in a database for protein identification, the determined parts should match the database sequence exactly, while each mass gap should match a substring of ammo acids whose masses add up to the value of the mass gap. In such a case, the standard string matching algorithm does not work any more. In this paper, we present a new efficient algorithm to find the matches of gapped sequence tags in a protein database.
机译:在生物化学中,串联质谱(MS / MS)是鉴定肽和蛋白质的最常用方法。从MS / MS数据中获取肽序列的一种计算方法称为从头测序,这在该领域变得越来越重要。但是,从头测序通常只能确定地确定部分序列,而未确定的部分则由“质量缺口”表示。我们称这种部分确定的序列为缺口序列标签。在数据库中搜索有空位的序列标签以进行蛋白质鉴定时,确定的部分应与数据库序列完全匹配,而每个质量空缺应匹配一小部分氨基酸的串,其质量加起来等于质量空缺的值。在这种情况下,标准字符串匹配算法不再起作用。在本文中,我们提出了一种新的有效算法,可以在蛋白质数据库中找到缺口序列标签的匹配。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号