Bioinformatics Advance Access originally published online on February 13, 2009
Bioinformatics 2009 25(7):967-968; doi:10.1093/bioinformatics/btp087
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PASS: a program to align short sequences
CRIBI Biotechnology Centre, University of Padua, via Ugo Bassi 58/B, 35121 Padova, Italy
*To whom correspondence should be addressed.
 |
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.
Contact: pass{at}cribi.unipd.it
Associate Editor: Alex Bateman
Received on October 30, 2008; revised on February 9, 2009; accepted on February 11, 2009
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  D. S. Horner, G. Pavesi, T. Castrignano, P. D. De Meo, S. Liuni, M. Sammeth, E. Picardi, and G. Pesole Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing Brief Bioinform, October 27, 2009; (2009) bbp046v1. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 Y. Chen, T. Souaiaia, and T. Chen PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds Bioinformatics, October 1, 2009; 25(19): 2514 - 2521. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
H. Li and R. Durbin Fast and accurate short read alignment with Burrows-Wheeler transform Bioinformatics, July 15, 2009; 25(14): 1754 - 1760. [Abstract] [Full Text] [PDF]
|
|