Computational methods for transcriptome annotation and quantification using RNA-seq

M Garber, MG Grabherr, M Guttman, C Trapnell - Nature methods, 2011 - nature.com
High-throughput RNA sequencing (RNA-seq) promises a comprehensive picture of the
transcriptome, allowing for the complete annotation and quantification of all genes and their …

Compressed full-text indexes

G Navarro, V Mäkinen - ACM Computing Surveys (CSUR), 2007 - dl.acm.org
Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

Efficient architecture-aware acceleration of BWA-MEM for multicore systems

M Vasimuddin, S Misra, H Li… - 2019 IEEE international …, 2019 - ieeexplore.ieee.org
Innovations in Next-Generation Sequencing are enabling generation of DNA sequence data
at ever faster rates and at very low cost. For example, the Illumina NovaSeq 6000 sequencer …

Differential gene and transcript expression analysis of RNA-seq experiments with TopHat and Cufflinks

C Trapnell, A Roberts, L Goff, G Pertea, D Kim… - Nature protocols, 2012 - nature.com
Recent advances in high-throughput cDNA sequencing (RNA-seq) can reveal new genes
and splice variants and quantify expression genome-wide in a single assay. The volume …

BWA-MEME: BWA-MEM emulated with a machine learning approach

Y Jung, D Han - Bioinformatics, 2022 - academic.oup.com
Motivation The growing use of next-generation sequencing and enlarged sequencing
throughput require efficient short-read alignment, where seeding is one of the major …

TopHat: discovering splice junctions with RNA-Seq

C Trapnell, L Pachter, SL Salzberg - Bioinformatics, 2009 - academic.oup.com
Motivation: A new protocol for sequencing the messenger RNA in a cell, known as RNA-
Seq, generates millions of short sequence fragments in a single run. These fragments, or …

Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

B Langmead, C Trapnell, M Pop, SL Salzberg - Genome biology, 2009 - Springer
Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence
reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie …

Indexing compressed text

P Ferragina, G Manzini - Journal of the ACM (JACM), 2005 - dl.acm.org
We design two compressed data structures for the full-text indexing problem that support
efficient substring searches using roughly the space required for storing the text in …

[HTML][HTML] Replacing suffix trees with enhanced suffix arrays

MI Abouelhoda, S Kurtz, E Ohlebusch - Journal of discrete algorithms, 2004 - Elsevier
The suffix tree is one of the most important data structures in string processing and
comparative genomics. However, the space consumption of the suffix tree is a bottleneck in …

Compressed suffix arrays and suffix trees with applications to text indexing and string matching

R Grossi, JS Vitter - Proceedings of the thirty-second annual ACM …, 2000 - dl.acm.org
The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …