Sequence Alignment MCQs

Welcome to our comprehensive collection of Multiple Choice Questions (MCQs) on 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 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 Sequence Alignment mcq questions that explore various aspects of Sequence Alignment problems. Each MCQ is crafted to challenge your understanding of 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 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 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 Sequence Alignment knowledge to the test? Let's get started with our carefully curated MCQs!

Sequence Alignment MCQs | Page 11 of 15

Discover more Topics under Bioinformatics

Q101.
When random or unrelated sequences are compared using a global alignment method, they can have ____________ reflecting the tendency of the global algorithm to match as many characters as possible.

a.

very low scores

b.

very high scores

c.

moderate scores

d.

low scores

Discuss
Answer: (b).very high scores
Q102.
Which of the following are not related to Needleman-Wunsch alignment algorithm?

a.

Global alignment programs use this algorithm

b.

The output is a positive number

c.

Small changes in the scoring system can produce a different alignment

d.

Changes in the scoring system can produce the same alignment

Discuss
Answer: (d).Changes in the scoring system can produce the same alignment
Q103.
Waterman, in1989, provided a set of means and standard deviations of global alignment scores between random DNA sequences, using mismatch and gap penalties that produce a linear increase in score with _______ a distinguishing feature of global alignments.

a.

alignment score

b.

sequence score

c.

sequence length

d.

scoring system

Discuss
Answer: (c).sequence length
Q104.
Who suggested that the global alignment scores between unrelated protein sequences followed the extreme value distribution, similar to local alignment scores? And when?

a.

Abagyan and Batalov, in 1981

b.

Chvátal and Lipman, in 1984

c.

Abagyan and Batalov, in 1997

d.

Chvátal and Sankoff, in 1995

Discuss
Answer: (c).Abagyan and Batalov, in 1997
Q105.
_______ analyzed the distribution of scores among 100 vertebrate nucleic acid sequences and compared these scores with randomized sequences prepared in different ways.

a.

Lipman, in 1984

b.

Batalov, in 1964

c.

Waterman, in 1987

d.

Lipman, in 1967

Discuss
Answer: (a).Lipman, in 1984
Q106.
If the random sequences were prepared in a way that maintained the local base composition by producing them from overlapping fragments of sequence, the distribution of scores has a _______ standard deviation that is closer to the distribution of the natural sequences.

a.

lowest

b.

higher

c.

lower

d.

moderate

Discuss
Answer: (c).lower
Q107.
The GCG alignment programs have a RANDOMIZATION option, which shuffles the second sequence and calculates similarity scores between the unshuffled sequence and each of the shuffled copies.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q108.
Dayhoff, 1978- 1983, devised a second method for testing the relatedness of two protein sequences that can accommodate some local variation. Where this method is useful?

a.

For finding repeated regions within a sequence

b.

For finding similar regions that are in a different order in two sequences

c.

For finding small conserved region such as an active site

d.

For finding huge regions within sequences

Discuss
Answer: (d).For finding huge regions within sequences
Q109.
By whom and when were the Bayesian methods applied first?

a.

Smith-Waterman, 1981

b.

Agarwal and States, 1996

c.

Smith-Waterman, 1996

d.

Agarwal and States, 1981

Discuss
Answer: (b).Agarwal and States, 1996
Q110.
With the application of Bayesian methods, the most probable repeat length and evolutionary time since the repeat was formed may be derived.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Page 11 of 15