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

Computational RNA secondary structure design: empirical complexity and improved methods.

Rosalía Aguirre-Hernández1, Holger H Hoos, Anne Condon

  • 1Institute of Applied Mathematics, University of British Columbia, Vancouver, BC, Canada. rosalia@cs.ubc.ca <rosalia@cs.ubc.ca>

BMC Bioinformatics
|February 3, 2007
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

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

MO-SMAC: Multiobjective Sequential Model-Based Algorithm Configuration.

Evolutionary computation·2025
Same author

Circulating tumour mutation detection in triple-negative breast cancer as an adjunct to tissue response assessment.

NPJ breast cancer·2024
Same author

Isometric Hamming embeddings of weighted graphs.

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

Model-based quantification of protein-protein interaction aberrations for exploring dysregulated signalling pathways through pathway maps and gene expression levels.

BMC bioinformatics·2026
Same journal

Research on multi-trait genome association study method based on Shannon information entropy.

BMC bioinformatics·2026
Same journal

A multi-view feature fusion framework with interpretable graph convolution for predicting microbe-drug associations.

BMC bioinformatics·2026
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
See all related articles

This study analyzes RNA secondary structure design complexity, finding that algorithms like RNA-SSD and RNAinverse generally scale polynomially with structure size. Performance improves with constraints on paired bases, and some structures are proven impossible to design.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • RNA Structure Prediction

Background:

  • Investigates the empirical complexity of RNA secondary structure design.
  • Aims to understand factors influencing the difficulty of RNA design for high-performance algorithms.
  • Provides a basis for improving RNA design algorithms like RNA-SSD.

Purpose of the Study:

  • To analyze the scaling of RNA secondary structure design difficulty with increasing structure size.
  • To identify factors affecting the performance of RNA design algorithms.
  • To improve existing RNA design algorithms and characterize their limitations.

Main Methods:

  • Performed scaling analysis on random and biologically motivated RNA structures.
  • Utilized an improved version of the RNA-SSD algorithm and the RNAinverse algorithm.

Related Experiment Videos

  • Investigated the correlation between primary structure constraints and algorithm performance.

    • Main Results:

    • Running time for both RNA-SSD and RNAinverse algorithms scales polynomially with structure size.
    • Algorithms perform faster when constraints are limited to paired bases.
    • Proved that for some structures, no sequence exists with the target structure as its minimum free energy structure.

    Conclusions:

    • Enhanced understanding of the strengths and limitations of RNA-SSD and RNAinverse algorithms.
    • Identified potential avenues for improving the performance of RNA design algorithms.
    • Contributed to the theoretical understanding of RNA secondary structure design feasibility.