Bioinformatics Mcqs

Page No. 39

The dynamic programming method produces ____ structure with _____ score.


a one, single best

✓


bmultiple, single best

✖


cmultiple, multiple

✖


d single, multiple

✖


View Answer one, single best

In dynamic programming, in ab initio methods, Often ________ base pairing and energy terms of the base pairing _____ incorporated into the scoring process.


aG-C, are

✖


bG–U, are not

✖


cG–U, are also

✓


dG-C, are not

✖


View Answer G–U, are also

In ab initio methods, a quantitative approach such as dynamic programming can be used to assemble a final structure with optimal base-paired regions.


aTrue

✓


bFalse

✖


ceither true and false

✖


dnone of these

✖


View Answer True

In dynamic programming, in ab initio methods, the use of a dot plot can be effective in finding a ____ secondary structure in a ________ molecule.


a multiple, large

✖


bsingle, large

✖


csingle, small

✓


dmultiple, small

✖


View Answer single, small

In dot matrix in ab initio methods, one way to reduce the noise in the matrix is to select an appropriate window size of a maximum number of contiguous base matches.


aTrue

✖


b False

✓


ceither true and false

✖


dnone of these

✖


View Answer False

In dot matrix in ab initio methods, the diagonals _____________ to the main diagonal represent regions that can self hybridize.


aparallel

✖


bcutting in random fashion

✖


cperpendicular

✓


dadjacent parallel

✖


View Answer perpendicular

Which of the following is true about the RNAalifold?


aDynamic programming is not involved

✖


bMinimum free energy method is not used

✖


cOnly minimum free energy is used

✖


dCovariation information is taken into consideration

✓



The predefined alignment requiring method also depends on the quality of the input alignment. If there ___ errors in the alignment, covariation signals ____ detected.


a are, will be

✖


b are, will not be

✓


c are not, will not be

✖


dare not, possibly will not be

✖


View Answer are, will not be

The type of algorithm that _____ predefined alignment is ______ for reasonably conserved sequences.


adoesn’t require, more successful

✖


brequires, less successful

✖


cdoesn’t require, relatively successful

✖


d requires, relatively successful

✓



The type of algorithm that requires predefined alignment, requires the user to provide _______ alignment as input.


anot necessarily an alignment

✖


b multiple only

✖


cpairwise or multiple

✓


dpair wise only

✖


View Answer pairwise or multiple

Goto Page No.

Page 39 of 92

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan