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

Energy Diagrams - II01:10

Energy Diagrams - II

Energy diagrams are important to understand the dynamics of a system. The topology of an energy diagram helps illustrate the equilibrium points of the system.
The point in the energy diagram at which the system’s potential energy is the lowest is known as the local minima. The system tends to stay in this position indefinitely unless acted upon by a net force. The slope of the potential energy diagram at the local minima is zero, indicating that zero net force is acting on the system. The slope...
Energy Diagrams - I01:14

Energy Diagrams - I

The dynamics of a mechanical system can be easily understood by interpreting a potential energy diagram. Since energy is a scalar quantity, the interpretation of the dynamics of the system becomes even simpler.
Take the example of a skater on a parabolic ramp. The potential energy at different points along the ramp will be proportional to the height of the ramp, which varies quadratically with the horizontal position on the ramp. As the skater moves down the ramp from the highest position,...
The Power Flow Problem and Solution01:26

The Power Flow Problem and Solution

Power flow problem analysis is fundamental for determining real and reactive power flows in network components, such as transmission lines, transformers, and loads. The power system's single-line diagram provides data on the bus, transmission line, and transformer. Each bus k in the system is characterized by four key variables: voltage magnitude Vk​, phase angle δk​, real power Pk​, and reactive power Qk​. Two of these four variables are inputs, while the power flow program computes the...
Arc Length of a Curve: Problem Solving01:21

Arc Length of a Curve: Problem Solving

A high-voltage power line spans a 40-meter horizontal distance between two transmission towers, resulting in a 10-meter vertical sag due to the effects of gravity and thermal expansion. The curve formed by the suspended cable is a catenary, which accurately models the behavior of a uniform, flexible cable under its own weight. Unlike a parabolic shape, the catenary is described by the hyperbolic cosine function and offers a precise representation of the cable's form.In this setup, engineers...
Hyperbolic and Inverse Hyperbolic Functions: Problem Solving01:30

Hyperbolic and Inverse Hyperbolic Functions: Problem Solving

An arched gate can be effectively modeled using a hyperbolic cosine profile because this type of function is smooth and symmetric about the vertical axis. When the arch is centered at the origin, its maximum height occurs at the center point. This symmetry ensures that any height below the crown of the arch is reached at two horizontal positions that are equal in distance from the centerline but lie on opposite sides.To determine where the gate reaches a height of five meters, the height of the...
Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...

You might also read

Related Articles

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

Sort by
Same author

CellUntangler: Separating distinct biological signals in single-cell data with deep generative models.

Cell genomics·2025
Same author

<i>Struc2mapGAN</i>: improving synthetic cryogenic electron microscopy density maps with generative adversarial networks.

Bioinformatics advances·2025
Same author

A comprehensive survey and benchmark of deep learning-based methods for atomic model building from cryo-electron microscopy density maps.

Briefings in bioinformatics·2025
Same author

Isometric Hamming embeddings of weighted graphs.

Discrete applied mathematics (Amsterdam, Netherlands : 1988)·2023
Same author

AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps.

IEEE/ACM transactions on computational biology and bioinformatics·2023
Same author

Leveraging Steric Moieties for Kinetic Control of DNA Strand Displacement Reactions.

Journal of the American Chemical Society·2023
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

Related Experiment Video

Updated: Jun 18, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

An algorithm for the energy barrier problem without pseudoknots and temporary arcs.

Chris Thachuk1, Ján Manuch, Arash Rafiey

  • 1Department of Computer Science, University of British Columbia, Canada.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|November 13, 2009
PubMed
Summary
This summary is machine-generated.

We developed new algorithms for calculating RNA folding pathways with minimal energy barriers. Our methods efficiently find pseudoknot-free folding pathways, even for long RNA structures.

Related Experiment Videos

Last Updated: Jun 18, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Area of Science:

  • Computational Biology
  • Bioinformatics
  • RNA Structure Prediction

Background:

  • Calculating RNA folding pathways is crucial for understanding RNA function.
  • Existing methods face challenges with pseudoknots and identifying minimum energy barriers.

Purpose of the Study:

  • To develop efficient algorithms for computing pseudoknot-free RNA folding pathways with minimum energy barriers.
  • To address the problem of finding direct folding pathways with minimal energy barriers between two RNA secondary structures.

Main Methods:

  • Deconstruction of bipartite graphs to solve the direct folding pathway problem.
  • Analysis of energy barriers in RNA folding pathways for a simple energy model.

Main Results:

  • An exact algorithm for finding minimum energy barrier direct folding pathways, performing well empirically on long RNA structures.
  • Demonstration that repeatedly adding/removing base pairs is not optimal for minimizing energy barriers.
  • The problem of finding minimum barrier pathways with repeats is NP-hard.

Conclusions:

  • The new algorithm efficiently computes minimum energy barrier pseudoknot-free folding pathways.
  • The findings provide insights into the complexity of RNA folding pathway determination.
  • The developed methods advance the field of RNA structure prediction and analysis.