GraphClust can be used for structural clustering of RNA sequences. Especially it can be used for clustering of very large dataset with thousands of RNAs.
The MSARi (Multiple Sequence Alignments for Statistical Detection of RNA Secondary Structure) program indentifies conserved RNA secondary structure in non-coding RNA genes and mRNAs by searching multiple sequence alignments of a large set of candidate catalogs for correlated arrangements of reverse-complementary regions
RNASampler is a program that predicts common RNA secondary structure motifs in a group of related sequences.RNASampler finds the common structures between two sequences by probabilistically sampling aligned stems based on stem conservation calculated from intrasequence base pairing probabilities and intersequence base alignment probabilities. It iteratively updates these probabilities based on sampled structures and subsequently recalculates stem conservation using the updated probabilities. The iterative process terminates upon convergence of the sampled structures.
::DEVELOPER
Stormo Lab in Department of Genetics, Washington University
CentroidFold predicts an RNA secondary structure from an RNA sequence. FASTA and one-sequence-in-a-line format are accepted for predicting a secondary structure per sequence. It also predicts a consensus secondary structure when a multiple alignment (CLUSTALW format) is given. CentroidFold based on a generalized centroid estimator is one of the most accurate tools for predicting RNA secondary structures. See the original paper for the details of the algorithm.
RNAvista is a webserver to assess RNA secondary structure with non-canonical base pairs based on user-provided sequence or secondary structure containing canonical base pairs only.
rnalocopt is a web server that computes the partition function and samples structures from the ensemble of locally optimal secondary structures of a given RNA sequence. Here, a locally optimal secondary structure is one for which the free energy can not be lowered by the addition or removal of a single base pair (i.e. a kinetic trap in unit resolution energetics).
RNApathfinder is a web server to compute near-optimal folding pathways between two given secondary structures for a given RNA sequence. Since this problem is known to be NP-complete, our main algorithm, RNAtabupath uses the TABU local search heuristic. The web server includes both downloadable source code for several algorithms, as well as a web engine to compute pathways. Intended applications concern folding pathways for RNA conformational switches.
RNAborMEA computes the maximum expected accurate δ-neighbors of a given RNA secondary structure for a given RNA sequence. Here, a structure T is a δ-neighbor of a given structure S, if S can be transformed into T by a minimum number δ of edit operations, where an edit operation consists of removing or adding a single base pair (i.e. if the base pair distance between S and T is δ).