A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms Public Deposited

Downloadable Content

Download PDF
Creator
  • Jones, Corbin
    • Affiliation: College of Arts and Sciences, Department of Biology
  • Tomberlin, Jeffery K
    • Other Affiliation: Department of Entomology, Texas A&M University, College Station, TX 77843, USA
  • Sze, Sing-Hoi
    • Other Affiliation: Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843, USA; Department of Biochemistry & Biophysics, Texas A&M University, College Station, TX 77843, USA
  • Tarone, Aaron M
    • Other Affiliation: Department of Entomology, Texas A&M University, College Station, TX 77843, USA
  • Pimsler, Meaghan L
    • Other Affiliation: Department of Entomology, Texas A&M University, College Station, TX 77843, USA
Abstract
  • Abstract Background With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries. Results We develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory. Conclusions Our strategy minimizes memory consumption while simultaneously obtaining comparable or improved accuracy over existing algorithms. It provides support for incremental updates of assemblies when new libraries become available.
Date of publication
Identifier
  • doi:10.1186/s12864-017-3735-1
Resource type
  • Article
Rights statement
  • In Copyright
Rights holder
  • The Author(s)
Language
  • English
Bibliographic citation
  • BMC Genomics. 2017 May 24;18(Suppl 4):387
Publisher
  • BioMed Central
Parents:

This work has no parents.

Items