Distance Based Methods MCQ

Test your knowledge with important Distance Based Methods MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Distance Based Methods MCQs at Bissoy

• Minimum evolution (ME) constructs a tree with a similar procedure, but uses a different optimality criterion that finds a tree among all possible trees with a minimum overall branch length. The optimality criterion relies on the formula S = ∑bi where bi is the (i)th branch length.
  ক

  True

  খ

  False
• Which of the following is untrue about the Fitch–Margoliash?
  ক

  Method selects a best tree among all possible trees based on minimal deviation between the distances calculated in the overall branches in the tree and the distances in the original dataset

  খ

  It starts by randomly clustering two taxa in a node

  গ

  It starts by creating three equations to describe the distances

  ঘ

  The method searches for some specific tree topologies
• Which of the following is untrue about the Optimality-Based Methods?
  ক

  The clustering-based methods produce multiple trees as output

  খ

  Optimality-based methods select a tree that best fits the actual evolutionary distance matrix

  গ

  There is no criterion in judging how this tree is compared to other alternative trees

  ঘ

  Optimality-based methods have a well-defined algorithm to compare all possible tree topologies
• The tree construction process is somewhat similar to that used UPGMA.
  ক

  True

  খ

  False
• A generalized expression of the r-value is ri calculated based on the following formula _______
  ক

  ri = ∑dij + dj2

  খ

  ri = ∑dij

  গ

  ri = ∑dij + di

  ঘ

  ri = ∑dij + dj
• Corrects for unequal evolutionary rates between sequences by using a conversion step. This conversion requires the calculations of “r-values” and “transformed r-values” using the following formula ______
  ক

  dAB’ = dAB − 1/4 × (rA + rB)

  খ

  dAB’ = dAB − 1/2 × (rA + rB)

  গ

  dAB’ = dAB − 1/3 × (rA + rB)

  ঘ

  dAB’ = (dAB/3) − 1/2 × (rA + rB)
• In the Neighbor Joining step, The UPGMA method uses unweighted distances and assumes that all taxa have constant evolutionary rates.
  ক

  True

  খ

  False
• The basic assumption of the UPGMA method is that all taxa evolve at a constant rate and that they are equally distant from the root, implying that a molecular clock is in effect.
  ক

  True

  খ

  False
• Which of the following is untrue about the Unweighted Pair Group Method Using Arithmetic Average?
  ক

  The simplest clustering method is UPGMA, which builds a tree by a sequential clustering method

  খ

  Given a distance matrix, it starts by grouping two taxa with the largest pairwise distance in the distance matrix

  গ

  The distances between this new composite taxon and all remaining taxa are calculated to create a reduced matrix

  ঘ

  The grouping process is repeated and another newly reduced matrix is created
• Which of the following is untrue about distance based methods?
  ক

  The computed evolutionary distances can be used to construct a matrix of distances between all individual pairs of taxa

  খ

  Clustering is the only method among the algorithms for the distance-based tree-building method

  গ

  The clustering-type algorithms compute a tree based on a distance matrix starting from the most similar sequence pairs

  ঘ

  Based on the pairwise distance scores in the matrix, a phylogenetic tree can be constructed for all the taxa involved