首页> 美国卫生研究院文献>BMC Bioinformatics >Iterative refinement of structure-based sequence alignments by Seed Extension
【2h】

Iterative refinement of structure-based sequence alignments by Seed Extension

机译:通过种子扩展迭代优化基于结构的序列比对

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

BackgroundAccurate sequence alignment is required in many bioinformatics applications but, when sequence similarity is low, it is difficult to obtain accurate alignments based on sequence similarity alone. The accuracy improves when the structures are available, but current structure-based sequence alignment procedures still mis-align substantial numbers of residues. In order to correct such errors, we previously explored the possibility of replacing the residue-based dynamic programming algorithm in structure alignment procedures with the Seed Extension algorithm, which does not use a gap penalty. Here, we describe a new procedure called RSE (Refinement with Seed Extension) that iteratively refines a structure-based sequence alignment.
机译:背景技术在许多生物信息学应用中需要精确的序列比对,但是当序列相似性较低时,仅凭序列相似性就很难获得准确的比对。当结构可用时,准确性会提高,但是当前基于结构的序列比对程序仍然会错位大量残基。为了纠正此类错误,我们先前探索了使用种子扩展算法在结构对齐过程中替换基于残基的动态规划算法的可能性,该算法不使用空位罚分。在这里,我们描述了一个称为RSE(带有种子扩展名的精炼)的新过程,该过程可以迭代地完善基于结构的序列比对。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号