Suppr超能文献

PASS:一个用于比对短序列的程序。

PASS: a program to align short sequences.

作者信息

Campagna Davide, Albiero Alessandro, Bilardi Alessandra, Caniato Elisa, Forcato Claudio, Manavski Svetlin, Vitulo Nicola, Valle Giorgio

机构信息

CRIBI Biotechnology Centre, University of Padua, Padova, Italy.

出版信息

Bioinformatics. 2009 Apr 1;25(7):967-8. doi: 10.1093/bioinformatics/btp087. Epub 2009 Feb 13.

Abstract

SUMMARY

Standard DNA alignment programs are inadequate to manage the data produced by new generation DNA sequencers. To answer this problem, we developed PASS with the objective of improving execution time and sensitivity when compared with other available programs. PASS performs fast gapped and ungapped alignments of short DNA sequences onto a reference DNA, typically a genomic sequence. It is designed to handle a huge amount of reads such as those generated by Solexa, SOLiD or 454 technologies. The algorithm is based on a data structure that holds in RAM the index of the genomic positions of 'seed' words (typically 11 and 12 bases) as well as an index of the precomputed scores of short words (typically seven and eight bases) aligned against each other. After building the genomic index, the program scans every query sequence performing three steps: (1) it finds matching seed words in the genome; (2) for every match checks the precomputed alignment of the short flanking regions; (3) if passes step 2, then it performs an exact dynamic alignment of a narrow region around the match. The performance of the program is very striking both for sensitivity and speed. For instance, gap alignment is achieved hundreds of times faster than BLAST and several times faster than SOAP, especially when gaps are allowed. Furthermore, PASS has a higher sensitivity when compared with the other available programs.

AVAILABILITY AND IMPLEMENTATION

Source code and binaries are freely available for download at http://pass.cribi.unipd.it, implemented in C++and supported on Linux and Windows.

摘要

摘要

标准的DNA比对程序不足以处理新一代DNA测序仪产生的数据。为了解决这个问题,我们开发了PASS,目的是与其他现有程序相比,提高执行时间和灵敏度。PASS能将短DNA序列与参考DNA(通常是基因组序列)进行快速的带空位和不带空位的比对。它旨在处理大量的读段,比如由Solexa、SOLiD或454技术产生的读段。该算法基于一种数据结构,这种数据结构在随机存取存储器(RAM)中保存“种子”词(通常为11和12个碱基)的基因组位置索引,以及相互比对的短词(通常为7和8个碱基)的预计算得分索引。构建基因组索引后,程序扫描每个查询序列,执行三个步骤:(1)在基因组中找到匹配的种子词;(2)对于每个匹配项,检查侧翼短区域的预计算比对;(3)如果通过步骤2,那么它会对匹配周围的一个狭窄区域进行精确的动态比对。该程序在灵敏度和速度方面的表现都非常出色。例如,带空位比对的速度比BLAST快数百倍,比SOAP快几倍,尤其是在允许有空位的情况下。此外,与其他现有程序相比,PASS具有更高的灵敏度。

可用性和实现方式

源代码和二进制文件可在http://pass.cribi.unipd.it免费下载,用C++实现,支持Linux和Windows系统。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验