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

Accelerated probabilistic inference of RNA structure evolution.

Ian Holmes1

  • 1Department of Bioengineering, University of California, Berkeley, CA 94720-1762, USA. ihh@berkeley.edu

BMC Bioinformatics
|March 26, 2005
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

Apollo 3: Multi-Species Genome Curation.

bioRxiv : the preprint server for biology·2026
Same author

Insertions, deletions, and exchangeable couplings: a Dirichlet process over TKF92 domains and sites.

bioRxiv : the preprint server for biology·2026
Same author

Nested birth-death processes are competitive with parameter-heavy neural networks as time-dependent models of protein evolution.

bioRxiv : the preprint server for biology·2026
Same author

Proteins in the Genome Browser: Integration of Phylogenies, Alignments, and Structures With Nucleotide-level Evidence in JBrowse 2.

Journal of molecular biology·2026
Same author

Setting up JBrowse 2 for Visualizing Genome Synteny.

Current protocols·2025
Same author

Selective State Space Models Outperform Transformers at Predicting RNA-Seq Read Coverage.

bioRxiv : the preprint server for biology·2025

Pairwise stochastic context-free grammars (Pair SCFGs) enable RNA sequence alignment and structure prediction but are computationally intensive. New constraints significantly reduce computational costs for Pair SCFG algorithms, improving efficiency.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Biology

Background:

  • Pairwise stochastic context-free grammars (Pair SCFGs) are essential for RNA evolutionary analysis, including sequence alignment and secondary structure prediction.
  • Existing Pair SCFG algorithms face significant CPU and memory demands, hindering their application.
  • Pre-processing sequences to impose constraints is crucial for optimizing these algorithms.

Purpose of the Study:

  • To develop and demonstrate a method for constraining Pair SCFG algorithms.
  • To reduce the computational intensity of RNA alignment and structure prediction.
  • To maintain high accuracy in structural homology prediction while improving efficiency.

Main Methods:

  • Imposing flexible classes of constraints on Pair SCFG algorithms.

Related Experiment Videos

  • Utilizing score-attributed context-free grammars, including energy-based schemes and conditionally normalized Pair SCFGs.
  • Combining independent structural and alignment constraints with general flexibility.

    • Main Results:

    • Demonstrated significant reduction in computational costs for Pair SCFG algorithms.
    • Maintained high quality in structural homology prediction.
    • Enabled unprecedented flexibility in combining structural and alignment constraints.
    • Successfully applied to RNA sequence and structure bioinformatics, including N-best alignments and progressive multiple alignment.

    Conclusions:

    • A program named Stemloc implements these efficient algorithms.
    • Stemloc facilitates efficient RNA sequence alignment and structure prediction.
    • The Stemloc program is available under the GNU General Public License.