Hi everyone, I came across with a question regarding the Nussinov algorithm(- a nucleic acid structure prediction algorithm used in computational biology to predict the folding of an RNA molecule) in my Bioinformatics class.
I've not manage to get to a solution and would love to get some help. The question is-
"Suggest an approach to change the Nussinov algorithm such that it supports the following biology assumption: Each edge is at least 2 stacked base-pairs length and each hairpin loops is at least 2 bases (single-strand) .
Suggest an algorithm that implement those assumptions and describe it well. The answer also has to be efficient and include the time complexity."
*** - Nussinov algorithm
THANK YOU very much in advance.
Jonathan.
0 answers
No answers yet.
Log in to answer this question.
-
Blog: Overview of Nanopore Sequencing
written by usa.cd.genomics •
-
Comparative Analysis of Algorithms for Implementing the FM-Index: Correctness, Complexity, and Use …
written by qwertyuiop26 •
-
Random walk can be applied to any network?
written by Yoomi •
-
Job: Super-resolution microscopy in chromatin biology
written by alessio.zippo •
-
Basic Python problem on .pdb reading
written by August •
-
Differential abundance analysis at high taxonomic ranks
written by Erwann •
-
Can an inter-residue coevolution method be used to detect inter-protein coevolution
written by traviata •
-
Job: Postdoctoral fellow in Computational Biology/Big Data at UC San Diego
written by peter.rose
-
Nussinov algorithm RNA folding extension
written by newscient •
-
Tool: Rsem: Accurate Transcript Quantification From Rna-Seq Data With Or Without A Reference Genome
written by Istvan Albert
Unfortunately it is against forum policy to answer homework/coursework questions. We can troubleshoot attempts you make at an answer and provide correction, but we cannot offer wholesale answers.