

MCQOPTIONS
Saved Bookmarks
This section includes 101 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.
1. |
Neighbor-joining chooses the sequences that should be joined to give the best least squares estimates of the branch lengths that most closely reflect the actual distances between the sequences. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
2. |
For sequences that have ________ a phylogenetic analysis is __________ |
A. | diverged considerably, more challenging |
B. | not diverged, more challenging |
C. | diverged considerably, less challenging |
D. | diverged considerably, a less work to do |
Answer» B. not diverged, more challenging | |
3. |
The KH test sets out to test the null hypothesis that the two competing tree topologies are not significantly different. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
4. |
Parsimony can give ________ information when rates of sequence change _______ in the different branches of a tree that are represented by the sequence data. |
A. | misleading, vary |
B. | useful, change |
C. | misleading, are constant |
D. | sometimes contradicting, are constant |
Answer» B. useful, change | |
5. |
Which of the following is untrue regarding the Distance analysis programs in PHYLIP? |
A. | FITCH estimates a phylogenetic tree assuming additivity of branch lengths |
B. | FITCH uses the Fitch-Margoliash method |
C. | FITCH assumes a molecular clock but KITSCH does not |
D. | NEIGHBOR estimates phylogenies using the neighbor-joining or unweighted pair group method with arithmetic mean (UPGMA) |
Answer» D. NEIGHBOR estimates phylogenies using the neighbor-joining or unweighted pair group method with arithmetic mean (UPGMA) | |
6. |
In Shimodaira–Hasegawa Test, The degree of freedom used for the analysis depends on the substitution model used. It relies on the following test formula d = 2(ln LA – ln LB) = 2 ln(LA/LB). Here, is the log likelihood ratio score and ln LA and ln LB are likelihood scores for tree A and tree B, respectively. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
7. |
Which of the following is untrue regarding the neighbor-joining method? |
A. | It is very much like the Fitch-Margoliash method |
B. | It is totally dissimilar than the Fitch-Margoliash method |
C. | It is especially suitable when the rate of evolution of the separate lineages under consideration varies |
D. | When the branch lengths of trees of known topology are allowed to vary in a manner that simulates varying levels of evolutionary change, it is the most reliable method |
Answer» C. It is especially suitable when the rate of evolution of the separate lineages under consideration varies | |
8. |
A method of sequence alignment based on a Model (Bishop and Thompson 1986) was introduced that predicts the manner in which DNA sequences change during evolution. Which of the following is wrong about it? |
A. | This method is different from the Smith-Waterman local alignment algorithm |
B. | This method is quite similar to the Smith-Waterman local alignment algorithm |
C. | The underlying mutational theory is like those used to produce the PAM matrices for predicting changes in DNA and protein sequences |
D. | Sequences are predicted to change by a Markov process such that each mutation in the sequence is independent of previous mutations at that site or at other sites |
Answer» C. The underlying mutational theory is like those used to produce the PAM matrices for predicting changes in DNA and protein sequences | |
9. |
MrBayes is a Bayesian phylogenetic inference program. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
10. |
Maximum likelihood has also been used for an analysis of mutations in overlapping reading frames in viruses. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
11. |
Which of the following is incorrect about Caveats? |
A. | Unusually high GC content in the original dataset is the potential cause for generating biased trees |
B. | Unusually accelerated evolutionary rates is the potential cause for generating biased trees |
C. | Unusually accelerated evolutionary rates is the potential cause for generating biased bootstrap estimates |
D. | Not a large number of bootstrap re-sampling steps are needed to achieve yielding results |
Answer» E. | |
12. |
Which of the following is wrong statement about the maximum likelihood approach? |
A. | This method doesn’t always involve probability calculations |
B. | It finds a tree that best accounts for the variation in a set of sequences |
C. | The method is similar to the maximum parsimony method |
D. | The analysis is performed on each column of a multiple sequence alignment |
Answer» B. It finds a tree that best accounts for the variation in a set of sequences | |
13. |
Which of the following is wrong statement about DNAML and DNAMLK? |
A. | PHYLIP includes mentioned two programs for this maximum likelihood analysis |
B. | DNAML estimates phylogenies from nucleotide sequences by the maximum likelihood method |
C. | DNAMLK estimates phylogenies in the same manner as DNAML |
D. | DNAMLK estimates phylogenies without molecular clock |
Answer» E. | |
14. |
Phylogenetic analysis of a set of sequences that aligns ______ is straightforward because the positions that correspond in the sequences can be readily identified in a ______ of the sequences. |
A. | very well, multiple sequence alignment |
B. | in a haphazard manner, multiple sequence alignment |
C. | in a distorted way, multiple sequence alignment |
D. | very well, self alignment |
Answer» B. in a haphazard manner, multiple sequence alignment | |
15. |
Which of the following is untrue regarding the distance methods? |
A. | The sequence pairs that have the largest number of sequence changes between them are termed ‘neighbors’ |
B. | On a tree, these sequences share a node or common ancestor position and are each joined to that node by a branch |
C. | It produces a phylogenetic tree of the group |
D. | It employs the number of changes between each pair in a group of sequences |
Answer» B. On a tree, these sequences share a node or common ancestor position and are each joined to that node by a branch | |
16. |
The main disadvantage of maximum likelihood methods is that they are _____ |
A. | mathematically less folded |
B. | mathematically less complex |
C. | computationally lucid |
D. | computationally intense |
Answer» E. | |
17. |
Which of the following is incorrect statement about branch-and-bound? |
A. | It uses a shortcut to find an MP tree |
B. | It establishes an upper limit (or upper bound) for the number of allowed sequence variations |
C. | It solely uses UPGMA method |
D. | It starts by building a distance tree for all taxa involved |
Answer» D. It starts by building a distance tree for all taxa involved | |
18. |
The branch-and-bound method starts building trees in a similar way as in the exhaustive method. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
19. |
Which of the following is incorrect statement about Tree-Searching Methods? |
A. | The choice of the first three taxa can be random |
B. | Parsimony method examines all possible tree topologies to find the maximally parsimonious tree |
C. | It starts by building a three taxa unrooted tree, for which only one topology is available |
D. | This is different than exhaustive search method |
Answer» E. | |
20. |
In a heuristic tree search, only a small subset of all possible trees is examined. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
21. |
DNA sequences are sometimes more biased than protein sequences because of preferential codon usage in different organisms. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
22. |
In many cases ______ sequences are preferable to ______ sequences because they are relatively ____ conserved. |
A. | protein, nucleotide, less |
B. | nucleotide, protein, less |
C. | protein, nucleotide, more |
D. | nucleotide, protein, more |
Answer» D. nucleotide, protein, more | |
23. |
Protein sequences can remain the same while the corresponding DNA sequences have more room for variation. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
24. |
In the final steps of the bootstrap method, the _____ the decay value, the _______ significant the original branches. |
A. | greater, less |
B. | greater, more |
C. | lesser, more |
D. | more, less |
Answer» C. lesser, more | |
25. |
Tracking the evolutionary history of individual genes in a group of species can reveal which genes have remained in a genome for a long time and which genes have been horizontally transferred between species. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
26. |
Two more recent uses of phylogenetic analysis are to analyze ______ and to trace the evolutionary history of specific genes. Which of the following could not be the correct blank? |
A. | gene families |
B. | genomes |
C. | proteomes |
D. | physical separation methods |
Answer» E. | |
27. |
The traditional use of phylogenetic analysis is to discover evolutionary relationships among species. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
28. |
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ᴀʙ’ = dᴀʙ − 1/4 × (rᴀ + rʙ) |
B. | dᴀʙ’ = dᴀʙ − 1/2 × (rᴀ + rʙ) |
C. | dᴀʙ’ = dᴀʙ − 1/3 × (rᴀ + rʙ) |
D. | dᴀʙ’ = (dᴀʙ/3) − 1/2 × (rᴀ + rʙ) |
Answer» C. dᴀʙ’ = dᴀʙ − 1/3 × (rᴀ + rʙ) | |
29. |
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 | |
30. |
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 |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
31. |
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 | |
32. |
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 |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
33. |
In PHYML, The tree searching _____ when the total ML score no longer ______ |
A. | ceases, increases |
B. | stops, decreases |
C. | terminates, decreases |
D. | stops, increases |
Answer» E. | |
34. |
Which of the following is incorrect about nonparametric bootstrapping? |
A. | A new multiple sequence alignment of the same length is generated with random duplication of some of the sites |
B. | A new multiple sequence alignment of the distinct lengths is generated with random duplication of some of the sites |
C. | Certain sites are randomly replaced by other existing sites |
D. | Certain sites may appear multiple times, and other sites may not appear at all in the new alignment |
Answer» C. Certain sites are randomly replaced by other existing sites | |
35. |
Once all positions in the sequence alignment have been examined, the likelihoods given by each column in the alignment for each tree are _____ to give the likelihood of the tree. |
A. | multiplied |
B. | added |
C. | divided |
D. | squared |
Answer» B. added | |
36. |
Which of the following is untrue regarding the distance methods? |
A. | The distance method was pioneered by Feng and Doolittle |
B. | A collection of programs by authors Feng and Doolittle will produce both an alignment and tree of a set of protein sequences |
C. | The program CLUSTALW uses the neighbor-joining distance method as a guide to multiple sequence alignments |
D. | Among the Programs of the PHYLIP package, DNADIST is not one of them |
Answer» E. | |
37. |
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 | |
38. |
Which of the following is untrue regarding the maximum parsimony method? |
A. | This method predicts the evolutionary tree |
B. | It minimizes the number of steps required to generate the observed variation in the sequences |
C. | The method is also sometimes referred to as the minimum evolution method |
D. | Only a pairwise sequence alignment is required to predict which sequence positions are likely to correspond |
Answer» E. | |
39. |
Which of the following is untrue regarding the maximum parsimony method? |
A. | The analysis steps are continued for every position in the sequence alignment |
B. | This method is used for large numbers of sequences |
C. | Those trees that produce the smallest number of changes overall for all sequence positions are identified |
D. | This method is used for sequences that are quite similar |
Answer» C. Those trees that produce the smallest number of changes overall for all sequence positions are identified | |
40. |
A common recommendation is to use at least two of the methods—maximum parsimony, distance, or maximum likelihood, for the analysis. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
41. |
In the bootstrap method, the data are resampled by _____ choosing _____ columns from the aligned sequences to produce, in effect, a new sequence alignment of the _____ |
A. | randomly, horizontal, same length |
B. | specifically, vertical, different lengths |
C. | randomly, vertical, same length |
D. | randomly, vertical, different lengths |
Answer» D. randomly, vertical, different lengths | |
42. |
In the bootstrap method, for branches in the predicted tree topology to be significant, the resampled data sets should frequently predict the same branches. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
43. |
The choice of a suitable multiple sequence alignment method depends on the degree of variation among the sequences. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
44. |
Which of the following is incorrect about Bayesian Simulation? |
A. | It does not require bootstrapping |
B. | It requires bootstrapping |
C. | The MCMC procedure itself involves thousands or millions of steps of resampling |
D. | Posterior probabilities are assigned at each node of a best Bayesian tree as statistical support |
Answer» C. The MCMC procedure itself involves thousands or millions of steps of resampling | |
45. |
In the Neighbor Joining step, The UPGMA method uses unweighted distances and assumes that all taxa have constant evolutionary rates. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
46. |
The tree construction process is somewhat similar to that used UPGMA. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» C. May be True or False | |
47. |
A generalized expression of the r-value is ri calculated based on the following formula _______ |
A. | ri = ∑dij + dj² |
B. | ri = ∑dij |
C. | ri = ∑dij + di |
D. | ri = ∑dij + dj |
Answer» C. ri = ∑dij + di | |
48. |
PROTPARS counts the minimum number of mutations to change a codon for the first amino acid into a codon for the second amino acid, but only scores those mutations in the mutational path that actually change the amino acid. |
A. | True |
B. | False |
C. | May be True or False |
D. | Can't say |
Answer» B. False | |
49. |
Which of the following is wrong statement about the maximum likelihood method’s steps? |
A. | It starts with an evolutionary model of sequence change that provides estimates of rates of substitution of one base for another |
B. | In the beginning there is an evolutionary model of sequence change that provides estimates of transitions and transversions in a set of nucleic acid sequences |
C. | The rates of all possible substitutions are chosen so that the base composition differs |
D. | The set of sequences is then aligned |
Answer» D. The set of sequences is then aligned | |
50. |
In Jukes–Cantor Model to correct evolutionary distances, A formula for deriving evolutionary distances that include hidden changes is introduced by using a logarithmic function. It is ____ |
A. | dᴀʙ = −(3/4) log[1 − (4/7)ₚᴀʙ] |
B. | dᴀʙ = −(3/4) ln[1 − (5/3)ₚᴀʙ] |
C. | dᴀʙ = −(3/4) log[1 − (4/3)ₚᴀʙ] |
D. | dᴀʙ = −(3/4) ln[1 − (4/3)ₚᴀʙ] |
Answer» E. | |