Suppr超能文献

一种在BLAST中进行无间隙分析后的高效算法。

An efficient algorithm after ungapped analysis in BLAST.

作者信息

Garg Deepak, Saxena Suresh C, Bhardwaj Lalit M

机构信息

Faculty of Computer Science and Engineering, Thapar Institute of Engineering and Technology, Patiala, India.

出版信息

DNA Seq. 2006 Aug;17(4):247-53. doi: 10.1080/10425170600805128.

Abstract

Basic Local Alignment Search Tool (BLAST) is a popular tool used for determining the patterns in genomic sequences. The algorithm of BLAST has gone for various changes from time to time. One third of the time is taken by BLAST to perform the gapped analysis on the sequences. An efficient algorithm has been presented that employs a new approach for curtailing the amount of sequences that proceed for gapped alignment. So this method will work after the ungapped alignment process is over. This works because of the fact that it is not necessary to perform gapped alignment for all the sequences that are coming from ungapped analysis. There is a significant increase in speed of the alignment process without compromising on the sensitivity of the result.

摘要

基本局部比对搜索工具(BLAST)是一种用于确定基因组序列模式的常用工具。BLAST算法不时经历各种变化。BLAST执行序列的空位分析要花费三分之一的时间。已经提出了一种高效算法,该算法采用一种新方法来减少进行空位比对的序列数量。因此,这种方法将在无空位比对过程结束后起作用。之所以可行,是因为没有必要对来自无空位分析的所有序列进行空位比对。在不影响结果敏感性的情况下,比对过程的速度有了显著提高。

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验