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 Concept Videos

Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Compacting Factor test01:22

Compacting Factor test

The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
Combinatorial Gene Control02:33

Combinatorial Gene Control

Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Rationalizing Substitutions01:29

Rationalizing Substitutions

Integrals involving non-rational functions are often difficult to evaluate using standard techniques, especially when radicals appear in the integrand. Rationalizing substitution provides a systematic method for simplifying such integrals by converting them into rational forms that are easier to handle.Consider a rod whose linear mass density depends on a constant linear density, a characteristic length, and the distance from the left end of the rod. Determining the total mass requires...

You might also read

Related Articles

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

Sort by
Same author

Motifs in SARS-CoV-2 evolution.

RNA (New York, N.Y.)·2023
Same author

Lipschitz continuity under toric equivalence for asynchronous Boolean networks.

Chaos (Woodbury, N.Y.)·2023
Same author

RNA Secondary Structures with Given Motif Specification: Combinatorics and Algorithms.

Bulletin of mathematical biology·2023
Same author

The energy-spectrum of bicompatible sequences.

Algorithms for molecular biology : AMB·2021
Same author

Multiscale Feedback Loops in SARS-CoV-2 Viral Evolution.

Journal of computational biology : a journal of computational molecular cell biology·2020
Same author

On an enhancement of RNA probing data using information theory.

Algorithms for molecular biology : AMB·2020

Related Experiment Video

Updated: May 17, 2026

Finite Element Analysis Model for Assessing Expansion Patterns from Surgically Assisted Rapid Palatal Expansion
07:16

Finite Element Analysis Model for Assessing Expansion Patterns from Surgically Assisted Rapid Palatal Expansion

Published on: October 20, 2023

On the combinatorics of sparsification.

Fenix Wd Huang1, Christian M Reidys

  • 1Department of Mathematic and Computer science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark. duck@santafe.edu.

Algorithms for Molecular Biology : AMB
|October 24, 2012
PubMed
Summary

Sparsification significantly speeds up RNA structure prediction by reducing computation. This study quantifies its effectiveness, showing substantial improvements in predicting minimum free energy (mfe) RNA structures.

More Related Videos

Complementation of Splicing Activity by a Galectin-3 - U1 snRNP Complex on Beads
08:48

Complementation of Splicing Activity by a Galectin-3 - U1 snRNP Complex on Beads

Published on: December 9, 2020

Related Experiment Videos

Last Updated: May 17, 2026

Finite Element Analysis Model for Assessing Expansion Patterns from Surgically Assisted Rapid Palatal Expansion
07:16

Finite Element Analysis Model for Assessing Expansion Patterns from Surgically Assisted Rapid Palatal Expansion

Published on: October 20, 2023

Complementation of Splicing Activity by a Galectin-3 - U1 snRNP Complex on Beads
08:48

Complementation of Splicing Activity by a Galectin-3 - U1 snRNP Complex on Beads

Published on: December 9, 2020

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Structural Biology

Background:

  • RNA structure prediction is crucial for understanding RNA function.
  • Dynamic programming algorithms are widely used for RNA folding.
  • Sparsification methods aim to improve the computational efficiency of RNA structure prediction.

Purpose of the Study:

  • To quantitatively analyze the sparsification of a specific decomposition rule (Λ*) in RNA structure prediction.
  • To evaluate the impact of sparsification on the computation of minimum free energy (mfe) RNA structures.
  • To compare theoretical predictions with experimental observations for different energy models.

Main Methods:

  • Developed a combinatorial framework to analyze sparsification using probabilities of irreducible substructures.
  • Employed energy-filtered generating functions (GF) to compute expectations for arc-based and loop-based energy models.
  • Assumed a specific distribution of mfe-structures within arbitrary and irreducible RNA structures.

Main Results:

  • Demonstrated that sparsification provides a significant constant reduction in candidate sets for RNA secondary and pseudoknot structures.
  • Observed theoretical reductions of 91% and experimental reductions up to 98% depending on the energy model.
  • Found that the expected number of Λ* candidates is Θ(n^2), not a linear factor improvement as previously thought.

Conclusions:

  • Sparsification offers substantial computational improvements for RNA structure prediction, with significant constant reductions.
  • The effectiveness of sparsification is sensitive to the chosen energy model.
  • The study clarifies the theoretical complexity of sparsification, showing an expected quadratic growth in candidate sets.