Counting pseudoalignments to novel splicing events

Author:

Borozan Luka1,Rojas Ringeling Francisca23ORCID,Kao Shao-Yen4,Nikonova Elena4,Monteagudo-Mesas Pablo2ORCID,Matijević Domagoj1,Spletter Maria L45ORCID,Canzar Stefan236ORCID

Affiliation:

1. Department of Mathematics, Josip Juraj Strossmayer University of Osijek , Osijek 31000, Croatia

2. Gene Center, Ludwig-Maximilians-Universität München , Munich 81377, Germany

3. Huck Institutes of the Life Sciences, The Pennsylvania State University , University Park, PA 16802, United States

4. Biomedical Center, Department of Physiological Chemistry, Ludwig-Maximilians-Universität München , Planegg-Martinsried 82152, Germany

5. School of Science and Engineering, Division of Biological & Biomedical Systems, University of Missouri Kansas City , Kansas City, MO 64110, United States

6. Department of Computer Science and Engineering, The Pennsylvania State University , University Park, PA 16802, United States

Abstract

Abstract Motivation Alternative splicing (AS) of introns from pre-mRNA produces diverse sets of transcripts across cell types and tissues, but is also dysregulated in many diseases. Alignment-free computational methods have greatly accelerated the quantification of mRNA transcripts from short RNA-seq reads, but they inherently rely on a catalog of known transcripts and might miss novel, disease-specific splicing events. By contrast, alignment of reads to the genome can effectively identify novel exonic segments and introns. Event-based methods then count how many reads align to predefined features. However, an alignment is more expensive to compute and constitutes a bottleneck in many AS analysis methods. Results Here, we propose fortuna, a method that guesses novel combinations of annotated splice sites to create transcript fragments. It then pseudoaligns reads to fragments using kallisto and efficiently derives counts of the most elementary splicing units from kallisto’s equivalence classes. These counts can be directly used for AS analysis or summarized to larger units as used by other widely applied methods. In experiments on synthetic and real data, fortuna was around 7× faster than traditional align and count approaches, and was able to analyze almost 300 million reads in just 15 min when using four threads. It mapped reads containing mismatches more accurately across novel junctions and found more reads supporting aberrant splicing events in patients with autism spectrum disorder than existing methods. We further used fortuna to identify novel, tissue-specific splicing events in Drosophila. Availability and implementation fortuna source code is available at https://github.com/canzarlab/fortuna.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3