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 5 of 15

Discover more Topics under Bioinformatics

Q41.
When did Needleman-Wunsch first describe the algorithm for global alignment?

a.

1899

b.

1970

c.

1930

d.

1950

Discuss
Answer: (b).1970
Q42.
Which of the following does not describe dynamic programming?

a.

The approach compares every pair of characters in the two sequences and generates an alignment, which is the best or optimal

b.

Global alignment algorithm is based on this method

c.

Local alignment algorithm is based on this method

d.

The method can be useful in aligning protein sequences to protein sequences only

Discuss
Answer: (d).The method can be useful in aligning protein sequences to protein sequences only
Q43.
Which of the following is not an advantage of Needleman-Wunsch algorithm?

a.

New algorithmic improvements as well as increasing computer capacity make it possible to align a query sequence against a large DB in a few minutes

b.

Similar sequence region is of same order and orientation

c.

This does not help in determining evolutionary relationship

d.

If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details

Discuss
Answer: (c).This does not help in determining evolutionary relationship
Q44.
Which of the following is not a disadvantage of Needleman-Wunsch algorithm?

a.

This method is comparatively slow

b.

There is a need of intensive memory

c.

This cannot be applied on genome sized sequences

d.

This method can be applied to even large sized sequences

Discuss
Answer: (d).This method can be applied to even large sized sequences
Q45.
Which of the following does not describe global alignment algorithm?

a.

In initialization step, the first row and first column are subject to gap penalty

b.

Score can be negative

c.

In trace back step, beginning is with the cell at the lower right of the matrix and it ends at top left cell

d.

First row and first column are set to zero

Discuss
Answer: (d).First row and first column are set to zero
Q46.
Which of the following does not describe PAM matrices?

a.

These matrices are used in optimal alignment scoring

b.

It stands for Point Altered Mutations

c.

It stands for Point Accepted Mutations

d.

It was first developed by Margaret Dayhoff

Discuss
Answer: (b).It stands for Point Altered Mutations
Q47.
Which of the following is untrue regarding the scoring system used in dynamic programming?

a.

If the residues are same in both the sequences the match score is assumed as +5 which is added to the diagonally positioned cell of the current cell

b.

If the residues are not same, the mismatch score is assumed as -3

c.

If the residues are not same, the mismatch score is assumed as 3

d.

The score should be added to the diagonally positioned cell of the current cell

Discuss
Answer: (c).If the residues are not same, the mismatch score is assumed as 3
Q48.
Which of the following does not describe global alignment algorithm?

a.

Score can be negative in this method

b.

It is based on dynamic programming technique

c.

For two sequences of length m and n, the matrix to be defined should be of dimensions m+1 and n+1

d.

For two sequences of length m and n, the matrix to be defined should be of dimensions m and n

Discuss
Answer: (d).For two sequences of length m and n, the matrix to be defined should be of dimensions m and n
Q49.
Which of the following does not describe global alignment algorithm?

a.

It attempts to align every residue in every sequence

b.

It is most useful when the aligning sequences are similar and of roughly the same size

c.

It is useful when the aligning sequences are dissimilar

d.

It can use Needleman-Wunsch algorithm

Discuss
Answer: (c).It is useful when the aligning sequences are dissimilar
Q50.
Which of the following is wrong in case of substitution matrices?

a.

They determine likelihood of homology between two sequences

b.

They use system where substitutions that are more likely should get a higher score

c.

They use system where substitutions that are less likely should get a lower score

d.

BLOSUM-X type uses logarithmic identity to find similarity

Discuss
Answer: (d).BLOSUM-X type uses logarithmic identity to find similarity
Page 5 of 15