SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics

  • Authors:

  • Sebastian Will;Christina Schmiedl;Milad Miladi;Mathias Möhl;Rolf Backofen

  • Affiliations:

  • Bioinformatics, Department of Computer Science, University of Freiburg, Germany,Bioinformatics, Department of Computer Science, University of Leipzig, Germany;Bioinformatics, Department of Computer Science, University of Freiburg, Germany;Bioinformatics, Department of Computer Science, University of Freiburg, Germany;Bioinformatics, Department of Computer Science, University of Freiburg, Germany;Bioinformatics, Department of Computer Science, University of Freiburg, Germany,Centre for Biological Signalling Studies (BIOSS), University of Freiburg, Germany,Centre for Biological Systems Anal ...

  • Venue:
  • RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Motivation: There is increasing evidence of pervasive transcription, resulting in hundreds of thousands of ncRNAs of unknown function. Standard computational analysis tasks for inferring functional annotations like clustering require fast and accurate RNA comparisons based on sequence and structure similarity. The gold standard for the latter is Sankoff's algorithm [3], which simultaneously aligns and folds RNAs. Because of its extreme time complexity of O(n6), numerous faster "Sankoff-style" approaches have been suggested. Several such approaches introduce heuristics based on sequence alignment, which compromises the alignment quality for RNAs with sequence identities below 60% [1]. Avoiding such heuristics, as e.g. in LocARNA [4], has been assumed to prohibit time complexities better than O(n4), which strongly limits large-scale applications.