Local Sequence Alignment MCQ

Test your knowledge with important Local Sequence Alignment MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Local Sequence Alignment MCQs on Bissoy. Bissoy App

• Which of the following is untrue regarding BLAST and FASTA?
  ক

  FASTA is faster than BLAST

  খ

  FASTA is the most accurate

  গ

  BLAST has limited choices of databases

  ঘ

  FASTA is more sensitive for DNA-DNA comparisons
• Which of the following does not describe BLAST?
  ক

  It stands for Basic Local Alignment Search Tool

  খ

  It uses word matching like FASTA

  গ

  It is one of the tools of the NCBI

  ঘ

  Even if no words are similar, there is an alignment to be considered
• Which of the following does not describe k-tuple methods?
  ক

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

  খ

  They are also known as words methods

  গ

  They are basically heuristic methods to find local alignment

  ঘ

  They are useful in small scale databases
• Among the following which one is not the approach to the local alignment?
  ক

  Smith-Waterman algorithm

  খ

  K-tuple method

  গ

  Words method

  ঘ

  Needleman-Wunsch algorithm
• Which of the following is untrue regarding the gap penalty used in dynamic programming?
  ক

  Gap penalty is subtracted for each gap that has been introduced

  খ

  Gap penalty is added for each gap that has been introduced

  গ

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

  ঘ

  Gap open and gap extension has been introduced when there are continuous gaps (five or more)
• Which of the following does not describe BLOSUM matrices?
  ক

  It stands for BLOcks SUbstitution Matrix

  খ

  It was developed by Henikoff and Henikoff

  গ

  The year it was developed was 1992

  ঘ

  These matrices are logarithmic identity values
• Local alignments are more used when _____________
  ক

  There are totally similar and equal length sequences

  খ

  Dissimilar sequences are suspected to contain regions of similarity

  গ

  Similar sequence motif with larger sequence context

  ঘ

  Partially similar, different length and conserved region containing sequences
• Which of the following does not describe local alignment?
  ক

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

  খ

  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

  গ

  Local alignments have terminal gaps

  ঘ

  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
• When did Smith–Waterman first describe the algorithm for local alignment?
  ক

  1950

  খ

  1970

  গ

  1981

  ঘ

  1925