A study of accessible motifs and RNA folding complexity

Ydo Wexler, Chaya Zilberstein, Michal Ziv-Ukelson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability criterion to the task of genome-wide mRNA motif discovery raises the challenge of overcoming the core O(n3) factor imposed by the time complexity of the currently best known algorithms for RNA secondary structure prediction [24,25,43]. We speed up the dynamic programming algorithms that are standard for RNA folding prediction. Our new approach significantly reduces the computations without sacrificing the optimality of the results, yielding an expected time complexity of O(n2ψ(n)), where ψ(n) is shown to be constant on average under standard polymer folding models. Benchmark analysis confirms that in practice the runtime ratio between the previous approach and the new algorithm indeed grows linearly with increasing sequence size. The fast new RNA folding algorithm is utilized for genome-wide discovery of accessible cis-regulatory motifs in data sets of ribosomal densities and decay rates of S. cerevisiae genes and to the mining of exposed binding sites of tissue-specific microRNAs in A. Thailand. Further details, including additional figures and proofs to all lemmas, can be found at: http://www.cs.tau.ac.il/~raichaluz/ QuadraticRNAFold.pdf

Original languageEnglish
Title of host publicationResearch in Computational Molecular Biology - 10th Annual International Conference, RECOMB 2006, Proceedings
Pages473-487
Number of pages15
DOIs
StatePublished - 14 Jul 2006
Externally publishedYes
Event10th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2006 - Venice, Italy
Duration: 2 Apr 20065 Apr 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3909 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2006
Country/TerritoryItaly
CityVenice
Period2/04/065/04/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A study of accessible motifs and RNA folding complexity'. Together they form a unique fingerprint.

Cite this