Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2018 Jul 31;13(7):e0201483.
doi: 10.1371/journal.pone.0201483. eCollection 2018.

HSRA: Hadoop-based spliced read aligner for RNA sequencing data

Affiliations

HSRA: Hadoop-based spliced read aligner for RNA sequencing data

Roberto R Expósito et al. PLoS One. .

Abstract

Nowadays, the analysis of transcriptome sequencing (RNA-seq) data has become the standard method for quantifying the levels of gene expression. In RNA-seq experiments, the mapping of short reads to a reference genome or transcriptome is considered a crucial step that remains as one of the most time-consuming. With the steady development of Next Generation Sequencing (NGS) technologies, unprecedented amounts of genomic data introduce significant challenges in terms of storage, processing and downstream analysis. As cost and throughput continue to improve, there is a growing need for new software solutions that minimize the impact of increasing data volume on RNA read alignment. In this work we introduce HSRA, a Big Data tool that takes advantage of the MapReduce programming model to extend the multithreading capabilities of a state-of-the-art spliced read aligner for RNA-seq data (HISAT2) to distributed memory systems such as multi-core clusters or cloud platforms. HSRA has been built upon the Hadoop MapReduce framework and supports both single- and paired-end reads from FASTQ/FASTA datasets, providing output alignments in SAM format. The design of HSRA has been carefully optimized to avoid the main limitations and major causes of inefficiency found in previous Big Data mapping tools, which cannot fully exploit the raw performance of the underlying aligner. On a 16-node multi-core cluster, HSRA is on average 2.3 times faster than previous Hadoop-based tools. Source code in Java as well as a user's guide are publicly available for download at http://hsra.dec.udc.es.

PubMed Disclaimer

Conflict of interest statement

The authors have declared that no competing interests exist.

Figures

Fig 1
Fig 1. Overall workflow of the MapReduce paradigm.
This workflow shows several map and reduce tasks working in parallel over different input splits.
Fig 2
Fig 2. Overview of the HSRA workflow for single-end alignment.
This mode executes a map-only job taking advantage of the HSP library to parse the reads directly from HDFS. Native pipes are used for efficient IPC communication between Hadoop and HISAT2.
Fig 3
Fig 3. Overview of the HSRA workflow for paired-end alignment using the reduce-side join approach.
This approach executes a MapReduce job using the single-end support provided by the HSP library, where a reduce-side join is needed to obtain the paired-end reads. Native pipes are used for efficient IPC communication between Hadoop and HISAT2.
Fig 4
Fig 4. Overview of the HSRA workflow for paired-end alignment using the map-side join approach.
This approach allows avoiding any data shuffling by executing a map-only job thanks to the specific support for paired-end datasets provided by the HSP library. Native pipes are used for efficient IPC communication between Hadoop and HISAT2.
Fig 5
Fig 5. Experimental results for single-end alignment.
Runtime results obtained by HSRA when varying the number of nodes using the (a) SRR1 and (b) DRR1 datasets.
Fig 6
Fig 6. Experimental results for paired-end alignment (SRR1 dataset).
Runtime results obtained by HSRA when varying the number of nodes using the (a) reduce-side and (b) map-side join approaches.
Fig 7
Fig 7. Experimental results for paired-end alignment (DRR1 dataset).
Runtime results obtained by HSRA when varying the number of nodes using the (a) reduce-side and (b) map-side join approaches.

Similar articles

Cited by

References

    1. Pepke S, Wold B, Mortazavi A. Computation for ChIP-seq and RNA-seq studies. Nat Methods. 2009;6(11):S22–S32. 10.1038/nmeth.1371 - DOI - PMC - PubMed
    1. Wang Z, Gerstein M, Snyder M. RNA-Seq: a revolutionary tool for transcriptomics. Nat Rev Genet. 2009;10(1):57–63. 10.1038/nrg2484 - DOI - PMC - PubMed
    1. Marioni JC, Mason CE, Mane SM, Stephens M, Gilad Y. RNA-seq: an assessment of technical reproducibility and comparison with gene expression arrays. Genome Res. 2008;18(9):1509–1517. 10.1101/gr.079558.108 - DOI - PMC - PubMed
    1. Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. Commun ACM. 2008;51(1):107–113. 10.1145/1327452.1327492 - DOI
    1. Zou Q, Li XB, Jiang WR, Lin ZY, Li GL, Chen K. Survey of MapReduce frame operation in bioinformatics. Brief Bioinform. 2013;15(4):637–647. 10.1093/bib/bbs088 - DOI - PubMed

Publication types