DP Algorithms for RNA Secondary Structure Prediction with Pseudoknots
نویسنده
چکیده
This paper describes simple DP (dynamic programming) algorithms for RNA secondary structure prediction with pseudoknots, for which no explicit DP algorithm had been known. Results of preliminary computational experiments are described too.
منابع مشابه
RNA Secondary Structure Prediction Algorithms
RNA secondary structure prediction is an important problem studied extensively in the past three dacades. However, pseudoknots are usually excluded in RNA secondary structure prediction due to the hardness of examining all possible structures efficiently and model the energy correctly. Current algorithms on predicting structures with pseudoknots usually have extremely high resource requirements...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملRNA Secondary Structure Prediction with Simple Pseudoknots
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structural roles in cells. Current biophysical methods to identify the presence of pseudoknots are extremely time consuming and expensive. Therefore, bioinformatics approaches to accurately predict such structures are highly d...
متن کاملP-dcfold or How to Predict all Kinds of Pseudoknots in Rna Secondary Structures
Pseudoknots play important roles in many RNAs. But for computational reasons, pseudoknots are usually excluded from the definition of RNA secondary structures. Indeed, prediction of pseudoknots increase very highly the complexities in time of the algorithms, knowing that all existing algorithms for RNA secondary structure prediction have complexities at least of O(n). Some algorithms have been ...
متن کاملA Survey of Compute Intensive Algorithms for Ribo Nucleic Acids Structural Detection
Problem statement: Finding an accurate RNA structural alignment from primary sequence due to it is time consuming and computationally NP-hard problem is a major bioinformatics challenge. According to our investigation majority of current researches were concerned on achieving faster execution time, improving space complexity and better cache management. Recently one research introduced cache-ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997