Skip Navigation


Bioinformatics Advance Access originally published online on February 13, 2009
Bioinformatics 2009 25(7):967-968; doi:10.1093/bioinformatics/btp087
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
25/7/967    most recent
btp087v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Citing Articles
Right arrowScopus Links
Right arrowCiting Articles via CrossRef
Google Scholar
Right arrow Articles by Campagna, D.
Right arrow Articles by Valle, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Campagna, D.
Right arrow Articles by Valle, G.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

PASS: a program to align short sequences

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

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

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 DatabaseHome page
L. N. Hutchins, Y. Ding, J. P. Szatkiewicz, R. V. Smith, H. Yang, F. P.-M. de Villena, G. A. Churchill, and J. H. Graber
CGDSNPdb: a database resource for error-checked and imputed mouse SNPs
Database, July 30, 2010; 2010(0): baq008 - baq008.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
A. V. Dalca, S. M. Rumble, S. Levy, and M. Brudno
VARiD: A variation detection framework for color-space and letter-space platforms
Bioinformatics, June 15, 2010; 26(12): i343 - i349.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
E. Picardi, D. S. Horner, M. Chiara, R. Schiavon, G. Valle, and G. Pesole
Large-scale detection and analysis of RNA editing in grape mtDNA by RNA deep-sequencing
Nucleic Acids Res., April 12, 2010; (2010) gkq202v1.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
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, March 1, 2010; 11(2): 181 - 197.
[Abstract] [Full Text] [PDF]

Home page
 Briefings in Functional GenomicsHome page
L. Wang, P. Li, and T. P. Brutnell
Exploring plant transcriptomes using ultra high-throughput sequencing
Briefings in Functional Genomics, March 1, 2010; 9(2): 118 - 128.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
A. V. Dalca and M. Brudno
Genome variation discovery with high-throughput sequencing data
Brief Bioinform, January 6, 2010; (2010) bbp058v1.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
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]

Home page
 BioinformaticsHome page
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]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.