In comparative approach to RNA structure prediction, in Dynalign program–by comparing _________ from each sequence, a ______ structure common to both sequences is selected that serves as the basis for sequence alignment.(a) multiple alternative structures, lowest energy(b) single structure, lowest energy(c) single structure, highest energy(d) multiple alternative structures, highest energyThe question was posed to me by my college professor while I was bunking the class.My question is from Performance Evaluation topic in division RNA Structure Prediction of Bioinformatics

In comparative approach to RNA structure prediction, in Dynalign progr

1.	In comparative approach to RNA structure prediction, in Dynalign program–by comparing _________ from each sequence, a ______ structure common to both sequences is selected that serves as the basis for sequence alignment.(a) multiple alternative structures, lowest energy(b) single structure, lowest energy(c) single structure, highest energy(d) multiple alternative structures, highest energyThe question was posed to me by my college professor while I was bunking the class.My question is from Performance Evaluation topic in division RNA Structure Prediction of Bioinformatics
Answer» Correct answer is (a) multiple alternative structures, lowest energy The EXPLANATION: The unique FEATURE of this program is that it does not require sequence similarity and therefore can HANDLE very divergent sequences. However, because of the computation complexity, the program only PREDICTS small RNA sequences such as tRNA with reasonable accuracy.

Discussion

No Comment Found

Related InterviewSolutions

If the centroid structure is different from the minimum free-energy structure, the centroid structure is often closer to the phylogenetic prediction and contains fewer base pairs, or fewer false-positive base pair predictions, than the minimum free-energy prediction.(a) True(b) FalseThis question was posed to me in an interview for job.I'm obligated to ask this question of Searching Genomes for RNA & RNA Structure Modeling Applications in division RNA Structure Prediction of Bioinformatics
These limitations of the Zuker method and other methods have been largely overcome by using an algorithm originally described by Waterman and Byers (1985) for finding sequence alignments within a certain range of the optimal one by modifications of the trace-back procedure used in dynamic programming.(a) True(b) FalseI got this question in semester exam.This question is from MFOLD and the Use of Energy Plots topic in division RNA Structure Prediction of Bioinformatics
______ molecules can simply be identified based on their sequence similarity with already-known sequences.(a) Larger, less conserved(b) Larger, highly conserved(c) smaller, highly conserved(d) shorter, highly conservedThis question was addressed to me in an interview for job.The origin of the question is Searching Genomes for RNA & RNA Structure Modeling Applications topic in section RNA Structure Prediction of Bioinformatics
One of the first methods used to find tRNA genes was to search for sequences that are complementary and can fold into a knot like the three found in tRNAs.(a) True(b) FalseThis question was addressed to me during a job interview.The question is from Searching Genomes for RNA & RNA Structure Modeling Applications in division RNA Structure Prediction of Bioinformatics
Fichant and Burks (1991) described a program, tRNAscan, that searches a genomic sequence with a sliding window searching simultaneously for matches to a set of invariant bases and conserved self-complementary regions in tRNAs with an accuracy of 97.5%.(a) True(b) FalseI had been asked this question during an online exam.This interesting question is from Searching Genomes for RNA & RNA Structure Modeling Applications topic in section RNA Structure Prediction of Bioinformatics
Which of the following is untrue about Vienna RNA Websuite?(a) It introduced the Wuchty algorithm, developed applications of the McCaskill algorithm(b) It also offers a wide variety of algorithms and functions(c) The Wuchty algorithm generates a small but complete set of suboptimal structures(d) The Wuchty algorithm computes some possible tertiary structures within a narrow free-energy rangeThis question was addressed to me in an interview.My question is from Searching Genomes for RNA & RNA Structure Modeling Applications topic in section RNA Structure Prediction of Bioinformatics
Which of the following is untrue about the Sfold algorithm?(a) It uses a unique algorithm to aid in the design of siRNA(b) The algorithm combines thermodynamic stabilities, calculations of target accessibility, and empirical rules(c) The website offers specialized programs for the design of siRNA, antisense RNA, trans-cleaving RNA, and mRNA-microRNA interactions(d) The website doesn’t offer programs for the design of a general program for statistically sampling suboptimal RNA structuresThis question was addressed to me in an online interview.Enquiry is from Searching Genomes for RNA & RNA Structure Modeling Applications in chapter RNA Structure Prediction of Bioinformatics
The probabilistic model was used to identify small nucleolar (sno) RNAs in the yeast genome that methylate ribosomal RNA.(a) True(b) FalseI had been asked this question in unit test.The question is from Searching Genomes for RNA & RNA Structure Modeling Applications topic in portion RNA Structure Prediction of Bioinformatics
Three scores, Pnum (i), Hnum (i,j), and Ssum, have been derived to assist with a determination of the reliability of a secondary structure prediction for a particular base i or a base pair i,j. Which of the following is not a correct regarding Ssum?(a) is also called as ss-count(b) is the number of foldings in which base i is single-stranded divided by m, the number of folding(c) is the number of foldings in which base i is single-stranded multiplied by m, the number of folding(d) gives the probability that base i is single-strandedThe question was asked in an online interview.I'd like to ask this question from MFOLD and the Use of Energy Plots topic in section RNA Structure Prediction of Bioinformatics
The ILM program uses an iterative loop matching algorithm to maximize base pairs and allows pseudoknots to form by allowing base. pairs to be added or removed in successive rounds.(a) True(b) FalseI had been asked this question in an internship interview.This interesting question is from Searching Genomes for RNA & RNA Structure Modeling Applications in portion RNA Structure Prediction of Bioinformatics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment