You are here

Dynamic Programming Algorithms

In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions – ideally, using a memory-based data structure. [Source: Wikipedia ]

ViennaRNA

Submitted by ChenLiang on Fri, 09/02/2016 - 21:59

The Vienna RNA secondary structure server provides a web interface to the most frequently used functions of the Vienna RNA software package for the analysis of RNA secondary structures. It currently offers prediction of secondary structure from a single sequence, prediction of the consensus secondary structure for a set of aligned sequences and the design of sequences that will fold into a predefined structure.

Rating: 
5
Average: 5 (2 votes)

TargetRNA

Submitted by ChenLiang on Fri, 09/02/2016 - 21:59

Many small RNA (sRNA) genes in bacteria act as posttranscriptional regulators of target messenger RNAs. Here, we present TargetRNA, a web tool for predicting mRNA targets of sRNA action in bacteria. TargetRNA takes as input a genomic sequence that may correspond to an sRNA gene. TargetRNA then uses a dynamic programming algorithm to search each annotated message in a specified genome for mRNAs that evince basepair-binding potential to the input sRNA sequence.

Rating: 
Average: 5 (1 vote)

rip

Submitted by ChenLiang on Fri, 09/02/2016 - 21:59

It has been proven that the accessibility of the target sites has a critical influence on RNA-RNA binding, in general and the specificity and efficiency of miRNAs and siRNAs, in particular. Recently, O(N(6)) time and O(N(4)) space dynamic programming (DP) algorithms have become available that compute the partition function of RNA-RNA interaction complexes, thereby providing detailed insights into their thermodynamic properties.

Rating: 
Average: 5 (1 vote)

BiTargeting

Submitted by ChenLiang on Fri, 09/02/2016 - 21:59

MicroRNAs (miRNAs) are an abundant class of small noncoding RNAs (20-24 nts) that can affect gene expression by post-transcriptional regulation of mRNAs. They play important roles in several biological processes (e.g., development and cell cycle regulation). Numerous bioinformatics methods have been developed to identify the function of miRNAs by predicting their target mRNAs. Some viral organisms also encode miRNAs, a fact that contributes to the complex interactions between viruses and their hosts.

Rating: 
Average: 5 (1 vote)

SparseMFEFold

Submitted by ChenLiang on Fri, 09/02/2016 - 21:59

RNA secondary structure prediction by energy minimization is the central computational tool for the analysis of structural non-coding RNAs and their interactions. Sparsification has been successfully applied to improve the time efficiency of various structure prediction algorithms while guaranteeing the same result; however, for many such folding problems, space efficiency is of even greater concern, particularly for long RNA sequences.

Rating: 
Average: 5 (1 vote)

SeRPeNT

Submitted by ChenLiang on Tue, 01/09/2018 - 19:03

Small non-coding RNAs (sncRNAs) are highly abundant molecules that regulate essential cellular processes and are classified according to sequence and structure. Here we argue that read profiles from size-selected RNA sequencing capture the post-transcriptional processing specific to each RNA family, thereby providing functional information independently of sequence and structure.

Rating: 
Average: 5 (1 vote)
Subscribe to Dynamic Programming Algorithms