Search Results - "Frid, Yelena"
-
1
An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding
Published in Algorithms for molecular biology (05-08-2016)“…The basic RNA secondary structure prediction problem or single sequence folding problem (SSF) was solved 35 years ago by a now well-known [Formula: see…”
Get full text
Journal Article -
2
Faster algorithms for RNA-folding using the Four-Russians method
Published in Algorithms for molecular biology (06-03-2014)“…The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in O(n3)…”
Get full text
Journal Article -
3
A simple, practical and complete O(n3/log n)-time algorithm for RNA folding using the Four-Russians speedup
Published in Algorithms for molecular biology (04-01-2010)“…The problem of computationally predicting the secondary structure (or folding) of RNA molecules was first introduced more than thirty years ago and yet…”
Get full text
Journal Article -
4
A simple, practical and complete O graphic file="1748-7188-5-13-i1.gif"/>-time Algorithm for RNA folding using the Four-Russians Speedup
Published in Algorithms for molecular biology (01-01-2010)“…Abstract Background The problem of computationally predicting the secondary structure (or folding) of RNA molecules was first introduced more than thirty years…”
Get full text
Journal Article -
5
Worst-Case and Practical Speedups of RNA Secondary Structure Prediction Algorithms Using the Four-Russians Method
Published 01-01-2014“…Non-coding RNA (ncRNA) affect many aspects of gene expression; regulation of epigenetic processes, transcription, splicing, and translation. It has been…”
Get full text
Dissertation -
6
Worst-Case and Practical Speedups of RNA Secondary Structure Prediction Algorithms Using the Four-Russians Method
Get full text
Dissertation -
7
Faster Algorithms for RNA-folding using the Four-Russians method
Published 30-07-2013“…The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in…”
Get full text
Journal Article