A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup.docVIP

  • 7
  • 0
  • 约3.04万字
  • 约 8页
  • 2017-05-15 发布于上海
  • 举报

A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup.doc

A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup

FridandGusfieldAlgorithmsforMolecularBiology2010,5:13 /content/5/1/13 RESEARCH OpenAccess Asimple,practicalandcompleteO -time ? 3 ? n ? ? ? logn ? AlgorithmforRNAfoldingusingtheFour- RussiansSpeedup YelenaFrid*,DanGusfield Abstract Background:Theproblemofcomputationallypredictingthesecondarystructure(orfolding)ofRNAmolecules wasfirstintroducedmorethanthirtyyearsagoandyetcontinuestobeanareaofactiveresearchand development.ThebasicRNA-foldingproblemoffindingamaximumcardinality,non-crossing,matchingof complimentarynucleotidesinanRNAsequenceoflengthn,hasanO(n3)-timedynamicprogrammingsolutio

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档