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

Discover more Topics under Bioinformatics

Q51.
When did Smith–Waterman first describe the algorithm for local alignment?

a.

1950

b.

1970

c.

1981

d.

1925

Discuss
Answer: (c).1981
Q52.
Which of the following does not describe local alignment?

a.

A local alignment aligns a substring of the query sequence to a substring of the target sequence

b.

A local alignment is defined by maximizing the alignment score, so that deleting a column from either end would reduce the score, and adding further columns at either end would also reduce the score

c.

Local alignments have terminal gaps

d.

The substrings to be examined may be all of one or both sequences; if all of both are included then the local alignment is also global

Discuss
Answer: (c).Local alignments have terminal gaps
Q53.
Which of the following does not describe local alignment algorithm?

a.

Score can be negative

b.

Negative score is set to 0

c.

First row and first column are set to 0 in initialization step

d.

In traceback step, beginning is with the highest score, it ends when 0 is encountered

Discuss
Answer: (a).Score can be negative
Q54.
Local alignments are more used when _____________

a.

There are totally similar and equal length sequences

b.

Dissimilar sequences are suspected to contain regions of similarity

c.

Similar sequence motif with larger sequence context

d.

Partially similar, different length and conserved region containing sequences

Discuss
Answer: (a).There are totally similar and equal length sequences
Q55.
Which of the following does not describe BLOSUM matrices?

a.

It stands for BLOcks SUbstitution Matrix

b.

It was developed by Henikoff and Henikoff

c.

The year it was developed was 1992

d.

These matrices are logarithmic identity values

Discuss
Answer: (d).These matrices are logarithmic identity values
Q56.
Which of the following is untrue regarding the gap penalty used in dynamic programming?

a.

Gap penalty is subtracted for each gap that has been introduced

b.

Gap penalty is added for each gap that has been introduced

c.

The gap score defines a penalty given to alignment when we have insertion or deletion

d.

Gap open and gap extension has been introduced when there are continuous gaps (five or more)

Discuss
Answer: (b).Gap penalty is added for each gap that has been introduced
Q57.
Among the following which one is not the approach to the local alignment?

a.

Smith-Waterman algorithm

b.

K-tuple method

c.

Words method

d.

Needleman-Wunsch algorithm

Discuss
Answer: (d).Needleman-Wunsch algorithm
Q58.
Which of the following does not describe k-tuple methods?

a.

k-tuple methods are best known for their implementation in the database search tools FASTA and the BLAST family

b.

They are also known as words methods

c.

They are basically heuristic methods to find local alignment

d.

They are useful in small scale databases

Discuss
Answer: (d).They are useful in small scale databases
Q59.
Which of the following does not describe BLAST?

a.

It stands for Basic Local Alignment Search Tool

b.

It uses word matching like FASTA

c.

It is one of the tools of the NCBI

d.

Even if no words are similar, there is an alignment to be considered

Discuss
Answer: (d).Even if no words are similar, there is an alignment to be considered
Q60.
Which of the following is untrue regarding BLAST and FASTA?

a.

FASTA is faster than BLAST

b.

FASTA is the most accurate

c.

BLAST has limited choices of databases

d.

FASTA is more sensitive for DNA-DNA comparisons

Discuss
Answer: (a).FASTA is faster than BLAST
Page 6 of 15