TransRef enables accurate transcriptome assembly by redefining accurate neo-splicing graphs

Abstract

Abstract RNA-seq technology is widely employed in various research areas related to transcriptome analyses, and the identification of all the expressed transcripts from short sequencing reads presents a considerable computational challenge. In this study, we introduce TransRef, a new computational algorithm for accurate transcriptome assembly by redefining a novel graph model, the neo-splicing graph, and then iteratively applying a constrained dynamic programming to reconstruct all the expressed transcripts for each graph. When TransRef is utilized to analyze both real and simulated datasets, its performance is notably better than those of several state-of-the-art assemblers, including StringTie2, Cufflinks and Scallop. In particular, the performance of TransRef is notably strong in identifying novel transcripts and transcripts with low-expression levels, while the other assemblers are less effective.