MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
Which of the following is untrue about the Fitch–Margoliash? |
| A. | 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 |
| B. | It starts by randomly clustering two taxa in a node |
| C. | It starts by creating three equations to describe the distances |
| D. | The method searches for some specific tree topologies |
| Answer» E. | |
| 3. |
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 ______ |
| A. | dAB’ = dAB − 1/4 × (rA + rB) |
| B. | dAB’ = dAB − 1/2 × (rA + rB) |
| C. | dAB’ = dAB − 1/3 × (rA + rB) |
| D. | dAB’ = (dAB/3) − 1/2 × (rA + rB) |
| Answer» C. dAB’ = dAB − 1/3 × (rA + rB) | |
| 4. |
WHICH_OF_THE_FOLLOWING_IS_UNTRUE_ABOUT_THE_FITCH‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬®MARGOLIASH??$# |
| A. | 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 |
| B. | It starts by randomly clustering two taxa in a node |
| C. | It starts by creating three equations to describe the distances |
| D. | The method searches for some specific tree topologies |
| Answer» E. | |
| 5. |
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.$# |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
Which of the following is untrue about the Optimality-Based Methods? |
| A. | The clustering-based methods produce multiple trees as output |
| B. | Optimality-based methods select a tree that best fits the actual evolutionary distance matrix |
| C. | There is no criterion in judging how this tree is compared to other alternative trees |
| D. | Optimality-based methods have a well-defined algorithm to compare all possible tree topologies |
| Answer» B. Optimality-based methods select a tree that best fits the actual evolutionary distance matrix | |
| 7. |
The tree construction process is somewhat similar to that used UPGMA. |
| A. | True |
| B. | False |
| Answer» C. | |
| 8. |
A generalized expression of the r-value is ri calculated based on the following formula _______ |
| A. | ri = ‚àëdij + dj<sup>2</sup> |
| B. | ri = ‚àëdij |
| C. | ri = ‚àëdij + di |
| D. | ri = ‚àëdij + dj |
| Answer» C. ri = ‚Äö√Ñ√∂‚àö‚Ć‚àö¬¥dij + di | |
| 9. |
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 ______$ |
| A. | d<sub>AB</sub>’= d<sub>AB</sub> − 1/4 × (r<sub>A</sub> + r<sub>B</sub>) |
| B. | d<sub>AB</sub>’= d<sub>AB</sub> − 1/2 × (r<sub>A</sub> + r<sub>B</sub>) |
| C. | d<sub>AB</sub>’= d<sub>AB</sub> − 1/3 × (r<sub>A</sub> + r<sub>B</sub>) |
| D. | d<sub>AB</sub>’= (d<sub>AB</sub>/3) − 1/2 × (r<sub>A</sub> + r<sub>B</sub>) |
| Answer» C. d<sub>AB</sub>‚Äö√Ñ√∂‚àö√ë‚àö¬•= d<sub>AB</sub> ‚Äö√Ñ√∂‚àö‚Ć‚àö‚↠1/3 ‚Äö√†√∂‚àö‚â• (r<sub>A</sub> + r<sub>B</sub>) | |
| 10. |
In the Neighbor Joining step, The UPGMA method uses unweighted distances and assumes that all taxa have constant evolutionary rates. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 11. |
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. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 12. |
Which of the following is untrue about the Unweighted Pair Group Method Using Arithmetic Average? |
| A. | The simplest clustering method is UPGMA, which builds a tree by a sequential clustering method |
| B. | Given a distance matrix, it starts by grouping two taxa with the largest pairwise distance in the distance matrix |
| C. | The distances between this new composite taxon and all remaining taxa are calculated to create a reduced matrix |
| D. | The grouping process is repeated and another newly reduced matrix is created |
| Answer» C. The distances between this new composite taxon and all remaining taxa are calculated to create a reduced matrix | |
| 13. |
Which of the following is untrue about distance based methods? |
| A. | The computed evolutionary distances can be used to construct a matrix of distances between all individual pairs of taxa |
| B. | Clustering is the only method among the algorithms for the distance-based tree-building method |
| C. | The clustering-type algorithms compute a tree based on a distance matrix starting from the most similar sequence pairs |
| D. | Based on the pairwise distance scores in the matrix, a phylogenetic tree can be constructed for all the taxa involved |
| Answer» C. The clustering-type algorithms compute a tree based on a distance matrix starting from the most similar sequence pairs | |