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

A mini-greedy algorithm for faster structural RNA stem-loop search.

J Gorodkin1, R B Lyngso, G D Stormo

  • 1Bioinformatics Research Center and Department of Genetics and Ecology, University of Aarhus, Building 540, Ny Munkegade, DK-8000 Aarhus, Denmark. gorodkin@bioinf.au.dk

Genome Informatics. International Conference on Genome Informatics
|January 16, 2002
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

Sequence assembly.

Computational biology and chemistry·2009
Same author

SNP-finding in pig mitochondrial ESTs.

Animal genetics·2008
Same author

Identification of 10 882 porcine microsatellite sequences and virtual mapping of 4528 of these sequences.

Animal genetics·2007
Same author

MicroRNA sequence motifs reveal asymmetry between the stem arms.

Computational biology and chemistry·2006
Same author

Linkage mapping of gene-associated SNPs to pig chromosome 11.

Animal genetics·2006
Same author

Comparing two K-category assignments by a K-category correlation coefficient.

Computational biology and chemistry·2004
Same journal

Linear regression models predicting strength of transcriptional activity of promoters.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Sign: large-scale gene network estimation environment for high performance computing.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Docking-calculation-based method for predicting protein-RNA interactions.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Mechanism of cell cycle disruption by multiple p53 pulses.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Database for crude drugs and Kampo medicine.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.

Genome informatics. International Conference on Genome Informatics·2011
See all related articles

This study introduces a faster method for finding conserved RNA structural motifs in coregulated genes. By using a mini-greedy algorithm on a selected subset of sequences, researchers can achieve high-quality structural alignments efficiently.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • RNA Structure Analysis

Background:

  • Identifying conserved structural RNA motifs in coregulated genes is challenging for standard motif search tools.
  • Existing methods like FOLDALIGN are computationally intensive due to their use of greedy algorithms for multiple sequence alignment.
  • The computational cost hinders the efficient discovery of structurally conserved RNA motifs.

Purpose of the Study:

  • To develop a computationally efficient method for locating covarying but structurally conserved RNA motifs.
  • To reduce the computational expense associated with high-quality RNA structural motif detection.
  • To improve the speed of structural alignment while maintaining accuracy comparable to full greedy methods.

Main Methods:

  • A mini-greedy algorithm is applied to a carefully selected subset of sequences to estimate the order of sequence entry into a good greedy alignment.

Related Experiment Videos

  • Sequence ranking is performed using two complementary approaches: distance to the center of mass in a kernel space and finding K closest sequences.
  • These ranking approaches are merged to identify the most informative subset for alignment.

    • Main Results:

    • Near full greedy alignment quality can be achieved by applying the greedy algorithm to a significantly smaller subset of sequences.
    • The proposed ranking methods effectively identify sequences crucial for discovering core structural motifs.
    • Structural alignments are found in significantly reduced computation time compared to traditional methods.

    Conclusions:

    • The developed mini-greedy approach offers a computationally efficient alternative for identifying conserved RNA structural motifs.
    • This method significantly speeds up structural alignment without substantial loss of accuracy.
    • The algorithm is integrated into the SLASH (Stem-Loop Align SearcH) server for broader accessibility.