Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Speeding up the dynamic algorithm for planar RNA folding.

R Nussinov1, B Shapiro, S Y Le

  • 1Sackler Institute for Molecular Medicine, Sackler Faculty of Medicine, Tel Aviv University, Ramat Aviv, Israel.

Mathematical Biosciences
|June 11, 1990
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Properties of the Binary Black Hole Merger GW150914.

Physical review letters·2016
Same author

GW151226: Observation of Gravitational Waves from a 22-Solar-Mass Binary Black Hole Coalescence.

Physical review letters·2016
Same author

Tests of General Relativity with GW150914.

Physical review letters·2016
Same author

GW150914: Implications for the Stochastic Gravitational-Wave Background from Binary Black Holes.

Physical review letters·2016
Same author

GW150914: The Advanced LIGO Detectors in the Era of First Discoveries.

Physical review letters·2016
Same author

Observation of Gravitational Waves from a Binary Black Hole Merger.

Physical review letters·2016

This study introduces a novel "jumping" procedure to accelerate RNA folding algorithms. This method enhances computational efficiency for both maximum base pair and minimum energy RNA folding predictions.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Molecular Biology

Background:

  • Dynamic programming algorithms are used for RNA folding.
  • Standard algorithms for RNA folding can be computationally intensive, especially for complex energy models.
  • Previous optimizations include limiting loop size and reducing calculation steps.

Purpose of the Study:

  • To introduce a new computational method to speed up RNA folding algorithms.
  • To demonstrate the applicability of this method to both maximum base pair and minimum energy RNA folding.
  • To improve the overall time complexity of RNA structure prediction.

Main Methods:

  • A novel "jumping" procedure was developed.
  • The procedure was applied to dynamic programming algorithms for RNA folding.

Related Experiment Videos

  • Computational efficiency was analyzed for different RNA folding scenarios.

    • Main Results:

    • The "jumping" procedure significantly speeds up computation.
    • The method improves the time behavior of both maximum base pair and minimum energy algorithms.
    • The enhanced algorithms maintain accuracy in RNA structure prediction.

    Conclusions:

    • The "jumping" procedure offers a substantial improvement in computational speed for RNA folding.
    • This advancement facilitates more efficient analysis of RNA structures.
    • The method is broadly applicable to key RNA folding prediction tasks.