Home > Research > Publications & Outputs > Fast and accurate approximate inference of tran...
View graph of relations

Fast and accurate approximate inference of transcript expression from RNA-seq data

Research output: Contribution to journalJournal article

Published
  • James Hensman
  • Panagiotis Papastamoulis
  • Peter Glaus
  • Antti Honkela
  • Magnus Rattray
Close
<mark>Journal publication date</mark>15/12/2015
<mark>Journal</mark>Bioinformatics
Issue number24
Volume31
Number of pages9
Pages (from-to)3881-3889
<mark>State</mark>Published
Early online date26/08/15
<mark>Original language</mark>English

Abstract

Motivation: Assigning RNA-seq reads to their transcript of origin is a fundamental task in transcript expression estimation. Where ambiguities in assignments exist due to transcripts sharing sequence, e.g. alternative isoforms or alleles, the problem can be solved through probabilistic inference. Bayesian methods have been shown to provide accurate transcript abundance estimates compared with competing methods. However, exact Bayesian inference is intractable and approximate methods such as Markov chain Monte Carlo and Variational Bayes (VB) are typically used. While providing a high degree of accuracy and modelling flexibility, standard implementations can be prohibitively slow for large datasets and complex transcriptome annotations. Results: We propose a novel approximate inference scheme based on VB and apply it to an existing model of transcript expression inference from RNA-seq data. Recent advances in VB algorithmics are used to improve the convergence of the algorithm beyond the standard Variational Bayes Expectation Maximization algorithm. We apply our algorithm to simulated and biological datasets, demonstrating a significant increase in speed with only very small loss in accuracy of expression level estimation. We carry out a comparative study against seven popular alternative methods and demonstrate that our new algorithm provides excellent accuracy and inter-replicate consistency while remaining competitive in computation time.