z-logo
open-access-imgOpen Access
Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming
Author(s) -
Jochen Blom,
Tobias Jakobi,
Daniel Doppmeier,
Sebastian Jaenicke,
Jörn Kalinowski,
Jens Stoye,
Alexander Goesmann
Publication year - 2011
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btr151
Subject(s) - cuda , speedup , computer science , reference genome , graphics , graphics processing unit , multiple sequence alignment , dynamic programming , heuristic , smith–waterman algorithm , sequence (biology) , genome , alignment free sequence analysis , sequence alignment , parallel computing , algorithm , artificial intelligence , computer graphics (images) , biology , gene , genetics , peptide sequence
The introduction of next-generation sequencing techniques and especially the high-throughput systems Solexa (Illumina Inc.) and SOLiD (ABI) made the mapping of short reads to reference sequences a standard application in modern bioinformatics. Short-read alignment is needed for reference based re-sequencing of complete genomes as well as for gene expression analysis based on transcriptome sequencing. Several approaches were developed during the last years allowing for a fast alignment of short sequences to a given template. Methods available to date use heuristic techniques to gain a speedup of the alignments, thereby missing possible alignment positions. Furthermore, most approaches return only one best hit for every query sequence, thus losing the potentially valuable information of alternative alignment positions with identical scores.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom