Navigation überspringen
Universitätsbibliothek Heidelberg
Status: Bibliographieeintrag

Verfügbarkeit
Standort: ---
Exemplare: ---
heiBIB
 Online-Ressource
Verfasst von:Lindner, Robert [VerfasserIn]   i
 Friedel, Caroline Christina [VerfasserIn]   i
Titel:A comprehensive evaluation of alignment algorithms in the context of RNA-Seq
Verf.angabe:Robert Lindner, Caroline C. Friedel
E-Jahr:2012
Jahr:December 26, 2012
Umfang:10 S.
Fussnoten:Gesehen am 16.11.2018
Titel Quelle:Enthalten in: PLOS ONE
Ort Quelle:San Francisco, California, US : PLOS, 2006
Jahr Quelle:2012
Band/Heft Quelle:7(2012), 12, Artikel-ID e52403
ISSN Quelle:1932-6203
Abstract:Transcriptome sequencing (RNA-Seq) overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level. The first step and a major challenge in the analysis of such experiments is the mapping of sequencing reads to a transcriptomic origin including the identification of splicing events. In recent years, a large number of such mapping algorithms have been developed, all of which have in common that they require algorithms for aligning a vast number of reads to genomic or transcriptomic sequences. Although the FM-index based aligner Bowtie has become a de facto standard within mapping pipelines, a much larger number of possible alignment algorithms have been developed also including other variants of FM-index based aligners. Accordingly, developers and users of RNA-seq mapping pipelines have the choice among a large number of available alignment algorithms. To provide guidance in the choice of alignment algorithms for these purposes, we evaluated the performance of 14 widely used alignment programs from three different algorithmic classes: algorithms using either hashing of the reference transcriptome, hashing of reads, or a compressed FM-index representation of the genome. Here, special emphasis was placed on both precision and recall and the performance for different read lengths and numbers of mismatches and indels in a read. Our results clearly showed the significant reduction in memory footprint and runtime provided by FM-index based aligners at a precision and recall comparable to the best hash table based aligners. Furthermore, the recently developed Bowtie 2 alignment algorithm shows a remarkable tolerance to both sequencing errors and indels, thus, essentially making hash-based aligners obsolete.
DOI:doi:10.1371/journal.pone.0052403
URL:Bitte beachten Sie: Dies ist ein Bibliographieeintrag. Ein Volltextzugriff für Mitglieder der Universität besteht hier nur, falls für die entsprechende Zeitschrift/den entsprechenden Sammelband ein Abonnement besteht oder es sich um einen OpenAccess-Titel handelt.

kostenfrei: Volltext ; Verlag: http://dx.doi.org/10.1371/journal.pone.0052403
 kostenfrei: Volltext: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0052403
 DOI: https://doi.org/10.1371/journal.pone.0052403
Datenträger:Online-Ressource
Sprache:eng
K10plus-PPN:1583791329
Verknüpfungen:→ Zeitschrift

Permanenter Link auf diesen Titel (bookmarkfähig):  https://katalog.ub.uni-heidelberg.de/titel/68329159   QR-Code
zum Seitenanfang