Question 51. The first step in Genetic Algorithm is arranging the sequences to be aligned in rows.

Question 52. In Genetic Algorithm, in the mutation process _______

Question 53. Which of the following is not true about iterative methods?

Question 54. The HMM is a statistical model that considers few combinations of matches and gaps to generate an alignment of a set of sequences.

Question 55. The second step in the Genetic Algorithm comprises of scoring of the 100 initial MSAs by the sum of pairs method.

Question 56. The Expectation Maximization algorithm has been used to identify conserved domains in unaligned proteins only.

Question 57. 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.

Question 58. Out of the two repeated steps in EM algorithm, the step 2 is ________

Question 59. Which of the following is untrue regarding Expectation Maximization algorithm?

Question 60. 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.