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. |
Which of the following about the Gibbs sampler is untrue? |
| A. | It is a statistical method for finding motifs in sequences |
| B. | It is dissimilar to the principle of the EM method |
| C. | It searches for the statistically most probable motifs |
| D. | It can find the optimal width and number of given motifs in each sequence |
| Answer» C. It searches for the statistically most probable motifs | |
| 2. |
Which of the following about MEME is untrue? |
| A. | It is a Web resource for performing local MSAs (Multiple Sequence Alignment) by the above expectation maximization method is the program MEME |
| B. | It stands for Multiple EM for Motif Elicitation |
| C. | It was developed at developed at the University of California at San Diego Supercomputing Center |
| D. | The Web page has multiple versions for searching blocks by an EM algorithm |
| Answer» E. | |
| 3. |
An alternative method is to produce an odds scoring matrix calculated by dividing each base frequency by the background frequency of that base. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
WHICH_OF_THE_FOLLOWING_ABOUT_MEME_IS_UNTRUE??$ |
| A. | It is a Web resource for performing local MSAs (Multiple Sequence Alignment) by the above expectation maximization method is the program MEME |
| B. | It stands for Multiple EM for Motif Elicitation |
| C. | It was developed at developed at the University of California at San Diego Supercomputing Center |
| D. | The Web page has multiple versions for searching blocks by an EM algorithm |
| Answer» E. | |
| 5. |
Which of the following about the Gibbs sampler is untrue?$ |
| A. | It is a statistical method for finding motifs in sequences |
| B. | It is dissimilar to the principle of the EM method |
| C. | It searches for the statistically most probable motifs |
| D. | It can find the optimal width and number of given motifs in each sequence |
| Answer» C. It searches for the statistically most probable motifs | |
| 6. |
An alternative method is to produce an odds scoring matrix calculated by dividing each base frequency by the background frequency of that base? |
| A. | True |
| B. | False |
| Answer» B. False | |
| 7. |
For the 10-residue DNA sequence example, there are _______ possible starting sites for a 20-residue-long site. |
| A. | 30 |
| B. | 21 |
| C. | 81 |
| D. | 60 |
| Answer» D. 60 | |
| 8. |
In the intermediate steps of EM algorithm, the number of each base in each column is determined and then converted to fractions. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
In the initial step of EM algorithm, the 20-residue-long binding motif patterns in each sequence are aligned as an initial guess of the motif. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
In EM algorithm, as an example, suppose that there are 10 DNA sequences having very little similarity with each other, each about 100 nucleotides long and thought to contain a binding site near the middle 20 residues, based on biochemical and genetic evidence. the following steps would be used by the EM algorithm to find the most probable location of the binding sites in each of the ______ sequences. |
| A. | 30 |
| B. | 10 |
| C. | 25 |
| D. | 20 |
| Answer» C. 25 | |
| 11. |
Out of the two repeated steps in EM algorithm, the step 2 is ________ |
| A. | the maximization step |
| B. | the minimization step |
| C. | the optimization step |
| D. | the normalization step |
| Answer» B. the minimization step | |
| 12. |
Which of the following is untrue regarding Expectation Maximization algorithm? |
| A. | An initial guess is made as to the location and size of the site of interest in each of the sequences, and these parts of the sequence are aligned |
| B. | The alignment provides an estimate of the base or amino acid composition of each column in the site |
| C. | The column-by-column composition of the site already available is used to estimate the probability of finding the site at any position in each of the sequences |
| D. | The row-by-column composition of the site already available is used to estimate the probability |
| Answer» E. | |
| 13. |
The Expectation Maximization algorithm has been used to identify conserved domains in unaligned proteins only. |
| A. | True |
| B. | False |
| Answer» C. | |