Informed kmer selection for de novo transcriptome assembly. (28th April 2016)

• Record Type: Journal Article
• Authors: Durai, Dilip A.; Schulz, Marcel H.
• Is Part Of: Bioinformatics. Volume 32:Number 11(2016)
• Page Start: 1670
• Page End: 1677
• Publication Date: 2016-04-28
• Subjects: Bioinformatics -- Periodicals; Genomics -- Data processing -- Periodicals; Computational biology -- Periodicals; 572.80285
• DOI: 10.1093/bioinformatics/btw217
• Languages: English
• ISSNs: 1367-4803

Abstract

Abstract : Motivation: De novo transcriptome assembly is an integral part for many RNA-seq workflows. Common applications include sequencing of non-model organisms, cancer or meta transcriptomes. Most de novo transcriptome assemblers use the de Bruijn graph (DBG) as the underlying data structure. The quality of the assemblies produced by such assemblers is highly influenced by the exact word length k . As such no single k mer value leads to optimal results. Instead, DBGs over different k mer values are built and the assemblies are merged to improve sensitivity. However, no studies have investigated thoroughly the problem of automatically learning at which k mer value to stop the assembly. Instead a suboptimal selection of k mer values is often used in practice. Results: Here we investigate the contribution of a single k mer value in a multi- k mer based assembly approach. We find that a comparative clustering of related assemblies can be used to estimate the importance of an additional k mer assembly. Using a model fit based algorithm we predict the k mer value at which no further assemblies are necessary. Our approach is tested with different de novo assemblers for datasets with different coverage values and read lengths. Further, we suggest a simple post processing step that significantly improves the quality of multi- k mer assemblies. Conclusion: We provide an automatic method for limiting the number of k mer values without a significant loss in assembly quality but with savings in assembly time. This is a step forward to making multi- k mer methods more reliable and easier to use. Availability and Implementation :A general implementation of our approach can be found under: https://github.com/SchulzLab/KREATION . Supplementary information: Supplementary data are available at Bioinformatics online. Contact: [e-mail]