Character Based Methods MCQ

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

• In a heuristic tree search, only a small subset of all possible trees is examined.
  ক

  True

  খ

  False
• When the number of taxa exceeds twenty, even the branch-and-bound method becomes computationally unfeasible.
  ক

  True

  খ

  False
• The branch-and-bound method starts building trees in a similar way as in the exhaustive method.
  ক

  True

  খ

  False
• Which of the following is incorrect statement about branch-and-bound?
  ক

  It uses a shortcut to find an MP tree

  খ

  It establishes an upper limit (or upper bound) for the number of allowed sequence variations
• Which of the following is incorrect statement about Tree-Searching Methods?
  ক

  The choice of the first three taxa can be random

  খ

  Parsimony method examines all possible tree topologies to find the maximally parsimonious tree

  গ

  It starts by building a three taxa unrooted tree, for which only one topology is available

  ঘ

  This is different than exhaustive search method
• The unweighted method treats all mutations as equivalent.
  ক

  True

  খ

  False
• Because these ancestral character states are not known directly, multiple possible solutions may exist. In this case, the parsimony principle applies to choose the character states that result in a minimum number of substitutions.
  ক

  True

  খ

  False
• Which of the following is incorrect statement about Building Work of MP tree?
  ক

  It works by searching for all possible tree topologies and reconstructing ancestral sequences that require the minimum number of changes to evolve to the current sequences

  খ

  Other than informative sites are non-informative, which are constant sites or sites that have changes occurring only once

  গ

  Informative sites are the ones that can often be explained by a unique tree topology

  ঘ

  Constant sites have the same state in all taxa and are quite useful in evaluating the various topologies
• Which of the following is incorrect statement about Maximum Parsimony Method?
  ক

  By cutting off the unnecessary variables, model development may become difficult, and there may be more chances of introducing inconsistencies, ambiguities, and redundancies, hence, the name Occam’s razor

  খ

  In dealing with problems that may have an infinite number of possible solutions, choosing the simplest model may help to ‘cut off’ those variables that are not really necessary to explain the phenomenon

  গ

  This method chooses a tree that has the fewest evolutionary changes or shortest overall branch lengths

  ঘ

  It is based on a principle related to a medieval philosophy called Occam’s razor
• Which of the following is incorrect statement about Character-based methods?
  ক

  They are also called discrete methods

  খ

  They are based directly on the sequence characters rather than on pairwise distances

  গ

  They doesn’t count mutational events accumulated on the sequences

  ঘ

  They may avoid the loss of information when characters are converted to distances