MCQOPTIONS
Saved Bookmarks
This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Unlike the commonly used methods for aligning a pair of sequences, the Bayesian method _______ using a particular scoring matrix or designated gap penalties. |
| A. | does not depend on |
| B. | depends on |
| C. | is based on |
| D. | involves |
| Answer» B. depends on | |
| 2. |
Zhu (1998) have devised a computer program called the Bayes block aligner which in effect slides ____ sequences along each other to find the ______ ungapped regions or blocks. |
| A. | two, least scoring |
| B. | two, highest scoring |
| C. | multiple, highest scoring |
| D. | multiple, least scoring |
| Answer» C. multiple, highest scoring | |
| 3. |
Another difficulty in Bayesian methods is deciding on the length of sequence that was duplicated. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
In Bayesian methods, difficulty with making estimations is that the estimate depends on the following Assumption. (Assumption – The mutation rate in sequences has been constant with time and that the rate of mutation of all nucleotides is the same.) |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
ZHU_(1998)_HAVE_DEVISED_A_COMPUTER_PROGRAM_CALLED_THE_BAYES_BLOCK_ALIGNER_WHICH_IN_EFFECT_SLIDES______SEQUENCES_ALONG_EACH_OTHER_TO_FIND_THE________UNGAPPED_REGIONS_OR_BLOCKS.?$ |
| A. | two, least scoring |
| B. | two, highest scoring |
| C. | multiple, highest scoring |
| D. | multiple, least scoring |
| Answer» C. multiple, highest scoring | |
| 6. |
Unlike_the_commonly_used_methods_for_aligning_a_pair_of_sequences,_the_Bayesian_method_________using_a_particular_scoring_matrix_or_designated_gap_penalties.$ |
| A. | does not depend on |
| B. | depends on |
| C. | is based on |
| D. | involves |
| Answer» B. depends on | |
| 7. |
Which of the following feature of Bayesian methods is the disadvantage of it? |
| A. | A length and distance that gives the highest overall probability may be determined |
| B. | They are used to calculate evolutionary distance |
| C. | Computationally Bayesian methods are better |
| D. | A specific mutational model is required |
| Answer» E. | |
| 8. |
A length and distance that gives the highest overall probability may then be determined. Such alignments are initially found using ________ |
| A. | a particular scoring matrix only |
| B. | an alignment algorithm only |
| C. | an alignment algorithm and a particular scoring matrix |
| D. | dot method |
| Answer» D. dot method | |
| 9. |
Another difficulty in Bayesian methods is deciding on the length of sequence that was duplicated |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
In Bayesian methods, difficulty with making estimations is that the estimate depends on the |
| A. | |
| B. | True |
| Answer» B. True | |
| 11. |
In a type of probability, analysis is to calculate the odds score for one event OR a second event, or of a series of events. In this case, the odds scores are _______ |
| A. | multiplied |
| B. | subtracted |
| C. | added and multiplied |
| D. | added |
| Answer» E. | |
| 12. |
If the purpose is to calculate the probability of one event AND a second event, the odds scores for the events are _________ |
| A. | added |
| B. | multiplied |
| C. | multiplied and added |
| D. | subtracted |
| Answer» C. multiplied and added | |
| 13. |
With the application of Bayesian methods, the most probable repeat length and evolutionary time since the repeat was formed may be derived. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
By whom and when were the Bayesian methods applied first? |
| A. | Smith-Waterman, 1981 |
| B. | Agarwal and States, 1996 |
| C. | Smith-Waterman, 1996 |
| D. | Agarwal and States, 1981 |
| Answer» C. Smith-Waterman, 1996 | |