Progressive Methods of Multiple Sequence Alignment MCQ

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

• 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.
  ক

  True

  খ

  False
• Which of the following is untrue about PILEUP program?
  ক

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

  খ

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

  গ

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

  ঘ

  The sequences are aligned pair-wise using the Needleman- Wunsch dynamic programming algorithm
• 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.
  ক

  True

  খ

  False
• 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.
  ক

  True

  খ

  False
• Which of the following is untrue about CLUSTAL program?
  ক

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

  খ

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

  গ

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

  ঘ

  The intermediate step includes use the alignment scores to produce a phylogenetic tree
• The CLUSTALX provides a graphic interface.
  ক

  True

  খ

  False
• CLUSTALW is a more recent version of CLUSTAL with the W standing for ________
  ক

  weakening

  খ

  winding

  গ

  weighting

  ঘ

  wiping
• Progenitor sequences represented by the ______ branches of the tree are derived by alignment of the _______ sequences.
  ক

  outer, outermost

  খ

  inner, outermost

  গ

  inner, innermost

  ঘ

  outer, innermost
• 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.
  ক

  True

  খ

  False