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 4 of 8

Discover more Topics under Bioinformatics

Q31.
Progressive alignment methods use the dynamic programming method to build an MSA starting with the most related sequences and then progressively adding less related sequences or groups of sequences to the initial alignment.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q32.
Progenitor sequences represented by the ______ branches of the tree are derived by alignment of the _______ sequences.

a.

outer, outermost

b.

inner, outermost

c.

inner, innermost

d.

outer, innermost

Discuss
Answer: (b).inner, outermost
Q33.
CLUSTALW is a more recent version of CLUSTAL with the W standing for ________

a.

weakening

b.

winding

c.

weighting

d.

wiping

Discuss
Answer: (c).weighting
Q34.
The CLUSTALX provides a graphic interface.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q35.
Which of the following is untrue about CLUSTAL program?

a.

CLUSTAL performs a global-multiple sequence alignment by a different method than MSA (Multiple Sequence Alignment)

b.

The initial heuristic alignment obtained by MSA is calculated in a different way

c.

The initial step includes performing pair-wise alignments of all of the sequences

d.

The intermediate step includes use the alignment scores to produce a phylogenetic tree

Discuss
Answer: (b).The initial heuristic alignment obtained by MSA is calculated in a different way
Q36.
The initial alignments used to produce the guide tree may be obtained by various methods. Which of the following is not one of them?

a.

Fast k-tuple

b.

pattern-finding approach similar

c.

FASTA

d.

Faster, full dynamic programming method

Discuss
Answer: (d).Faster, full dynamic programming method
Q37.
The scoring of gaps in a MSA (Multiple Sequence Alignment) has to be performed in a different manner from scoring gaps in a pair-wise alignment.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Q38.
Like other alignment programs, CLUSTAL uses a null score for opening a gap in a sequence alignment and a penalty for extending the gap by one residue.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (b).False
Q39.
Which of the following is untrue about PILEUP program?

a.

It is the MSA program that is a part of the Genetics Computer Group package of sequence analysis programs

b.

It is owned since 1997 by Oxford Communications and is widely used due to the popularity and availability of this package

c.

It uses a method for MSA that is polar opposite to CLUSTALW

d.

The sequences are aligned pair-wise using the Needleman- Wunsch dynamic programming algorithm

Discuss
Answer: (c).It uses a method for MSA that is polar opposite to CLUSTALW
Q40.
The resulting tree is then used to guide the alignment of the most closely related sequences and groups of sequences. The resulting alignment is a global alignment produced by the Needleman-Wunsch algorithm.

a.

True

b.

False

c.

May be True or False

d.

Can't say

Discuss
Answer: (a).True
Page 4 of 8