Multiple Sequence Alignment MCQs

Welcome to our comprehensive collection of Multiple Choice Questions (MCQs) on Multiple Sequence Alignment, a fundamental topic in the field of Bioinformatics. Whether you're preparing for competitive exams, honing your problem-solving skills, or simply looking to enhance your abilities in this field, our Multiple Sequence Alignment MCQs are designed to help you grasp the core concepts and excel in solving problems.

In this section, you'll find a wide range of Multiple Sequence Alignment mcq questions that explore various aspects of Multiple Sequence Alignment problems. Each MCQ is crafted to challenge your understanding of Multiple Sequence Alignment principles, enabling you to refine your problem-solving techniques. Whether you're a student aiming to ace Bioinformatics tests, a job seeker preparing for interviews, or someone simply interested in sharpening their skills, our Multiple Sequence Alignment MCQs are your pathway to success in mastering this essential Bioinformatics topic.

Note: Each of the following question comes with multiple answer choices. Select the most appropriate option and test your understanding of Multiple Sequence Alignment. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

So, are you ready to put your Multiple Sequence Alignment knowledge to the test? Let's get started with our carefully curated MCQs!

Multiple Sequence Alignment MCQs | Page 7 of 8

Discover more Topics under Bioinformatics

Q61.
The Expectation Maximization algorithm has been used to identify conserved domains in unaligned proteins only.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (b).False
Q62.
Which of the following is untrue regarding Expectation Maximization algorithm?

a.

An initial guess is made as to the location and size of the site of interest in each of the sequences, and these parts of the sequence are aligned

b.

The alignment provides an estimate of the base or amino acid composition of each column in the site

c.

The column-by-column composition of the site already available is used to estimate the probability of finding the site at any position in each of the sequences

d.

The row-by-column composition of the site already available is used to estimate the probability

Discuss
Answer: (d).The row-by-column composition of the site already available is used to estimate the probability
Q63.
Out of the two repeated steps in EM algorithm, the step 2 is ________

a.

the maximization step

b.

the minimization step

c.

the optimization step

d.

the normalization step

Discuss
Answer: (a).the maximization step
Q64.
In EM algorithm, as an example, suppose that there are 10 DNA sequences having very little similarity with each other, each about 100 nucleotides long and thought to contain a binding site near the middle 20 residues, based on biochemical and genetic evidence. The following steps would be used by the EM algorithm to find the most probable location of the binding sites in each of the ______ sequences.

a.

30

b.

10

c.

25

d.

20

Discuss
Answer: (b).10
Q65.
In the initial step of EM algorithm, the 20-residue-long binding motif patterns in each sequence are aligned as an initial guess of the motif.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q66.
In the intermediate steps of EM algorithm, the number of each base in each column is determined and then converted to fractions.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q67.
For the 10-residue DNA sequence example, there are _______ possible starting sites for a 20-residue-long site.

a.

30

b.

21

c.

81

d.

60

Discuss
Answer: (c).81
Q68.
An alternative method is to produce an odds scoring matrix calculated by dividing each base frequency by the background frequency of that base.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q69.
Which of the following about MEME is untrue?

a.

It is a Web resource for performing local MSAs (Multiple Sequence Alignment) by the above expectation maximization method is the program MEME

b.

It stands for Multiple EM for Motif Elicitation

c.

It was developed at developed at the University of California at San Diego Supercomputing Center

d.

The Web page has multiple versions for searching blocks by an EM algorithm

Discuss
Answer: (d).The Web page has multiple versions for searching blocks by an EM algorithm
Q70.
Which of the following about the Gibbs sampler is untrue?

a.

It is a statistical method for finding motifs in sequences

b.

It is dissimilar to the principle of the EM method

c.

It searches for the statistically most probable motifs

d.

It can find the optimal width and number of given motifs in each sequence

Discuss
Answer: (b).It is dissimilar to the principle of the EM method
Page 7 of 8