Mapping RNA-seq reads to transcriptomes efficiently based on learning to hash method.

Clicks: 390
ID: 67860
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #9 of 87 articles by views in Computers in biology and medicine

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Accurate and efficient read-alignment is one of the fundamental challenges in RNA-seq analysis. Due to the increasingly large number of reads generated from the RNA-seq experiments, read-alignment is a time-consuming task. Many mappers adopted various strategies to look for potential alignment locations for reads in a tolerable time, and provide adequate information for downstream analysis. But in some transcript analysis tasks, such as transcriptome quantification, the mapping information about the transcripts and positions for reads is sufficient. Thus the original alignment problem can be simplified to a string searching problem since the reads can be mapped contiguously to the transcriptome. Some models for transcript analysis adopt more efficient strategies to solve this simplified problem, but the efficiency is still restricted by handling RNA-seq data in the original read space. We propose a method, bit-mapping, based on learning to hash algorithm for mapping reads to the transcriptome. It learns hash functions from the transcriptome and generates binary hash codes of the sequences, then maps reads to the transcriptome according to their hash codes. Bit-mapping accelerates mapping problems in RNA-seq analysis by reducing the dimension of the read. We evaluate the performance of bit-mapping based on simulated data and real data, and compare it with other popular and state-of-the-art methods, STAR, RapMap, Bowtie 2 and HISAT 2. The comparative results of simulated and real data show that the accuracy of our method is competitive to the existing mappers in terms of mapping efficiency, especially for longer reads (¿ 100 bp).
Reference Key
yu2019mappingcomputers Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Yu, Xueting;Liu, Xuejun;
Journal Computers in biology and medicine
Year 2019
DOI
S0010-4825(19)30397-X
URL
Keywords
transcriptome rna-seq bit-mapping learning to hash read mapping

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.