Bioinformatics Mock Test 1

10%

Question 1 of 10

1. Among the following which one is not the approach to the local alignment?

Needleman-Wunsch algorithm

K-tuple method

Words method

Smith-Waterman algorithm

Question 1 of 10

Question 2 of 10

2. Which of the following is not an advantage of Needleman-Wunsch algorithm?

This does not help in determining evolutionary relationship

If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details

Similar sequence region is of same order and orientation

New algorithmic improvements as well as increasing computer capacity make it possible to align a query sequence against a large DB in a few minutes

Question 2 of 10

Question 3 of 10

3. The softwares for dot plot analysis perform several tasks. Which one of them is not performed by them?

Gap open penalty

Expectation threshold

Gap extend penalty

Change or mutate residues

Question 3 of 10

Question 4 of 10

4. Which of the following is not a description of dynamic programming algorithm?

A method that requires a manageable number of comparisons

A method that can take gaps into account

This method doesn’t provide an optimal (highest scoring) alignment

A method of sequence alignment

Question 4 of 10

Question 5 of 10

5. A feature of the dynamic programming algorithm is that the alignments obtained depend on the choice of a scoring system for comparing character pairs and penalty scores for gaps.

True

False

Question 5 of 10

Question 6 of 10

6. When did Smith–Waterman first describe the algorithm for local alignment?

1970

1925

1981

1950

Question 6 of 10

Question 7 of 10

7. Vertical frame shifts show ______ while the horizontal ones show _______

deletion, deletion

insertion, insertion

insertion, deletion

deletion, insertion

Question 7 of 10

Question 8 of 10

8. When was this method, first described?

1966

1970

1959

1982

Question 8 of 10

Question 9 of 10

9. The Dayhoff model of protein evolution is not a Markov process.

True

False

Question 9 of 10

Question 10 of 10

10. On average, what is the length of a typical domain?

About 500 residues

About 900 residues

About 300 residues

About 100 residues

Question 10 of 10