Global Sequence Alignment MCQ

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

• Which of the following is wrong in case of substitution matrices?
  ক

  They determine likelihood of homology between two sequences

  খ

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

  গ

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

  ঘ

  BLOSUM-X type uses logarithmic identity to find similarity
• Which of the following is untrue regarding the scoring system used in dynamic programming?
  ক

  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

  খ

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

  গ

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

  ঘ

  The score should be added to the diagonally positioned cell of the current cell
• Which of the following does not describe PAM matrices?
  ক

  These matrices are used in optimal alignment scoring

  খ

  It stands for Point Altered Mutations

  গ

  It stands for Point Accepted Mutations

  ঘ

  It was first developed by Margaret Dayhoff
• Which of the following does not describe global alignment algorithm?
  ক

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

  খ

  Score can be negative

  গ

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

  ঘ

  First row and first column are set to zero
• Which of the following is not a disadvantage of Needleman-Wunsch algorithm?
  ক

  This method is comparatively slow

  খ

  There is a need of intensive memory

  গ

  This cannot be applied on genome sized sequences

  ঘ

  This method can be applied to even large sized sequences
• Which of the following is not an advantage of Needleman-Wunsch algorithm?
  ক

  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

  খ

  Similar sequence region is of same order and orientation

  গ

  This does not help in determining evolutionary relationship

  ঘ

  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
• Which of the following does not describe dynamic programming?
  ক

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

  খ

  Global alignment algorithm is based on this method

  গ

  Local alignment algorithm is based on this method

  ঘ

  The method can be useful in aligning protein sequences to protein sequences only
• When did Needleman-Wunsch first describe the algorithm for global alignment?
  ক

  1899

  খ

  1970

  গ

  1930

  ঘ

  1950