Bioinformatics Mock Test 3

10%

Question 1 of 10

1. Currently, there are two major heuristic algorithms for performing database searches: BLAST and FASTA.

True

False

Question 1 of 10

Question 2 of 10

2. Which of the following is not correct about FASTA?

The string of residues is known as blocks

FASTA uses a ‘hashing’ strategy to find matches for a short stretch of identical residues with a length of k

Its stands for FAST ALL

It was in fact the first database similarity search tool developed, preceding the development of BLAST

Question 2 of 10

Question 3 of 10

3. An alternative method is to produce an odds scoring matrix calculated by dividing each base frequency by the background frequency of that base.

False

True

Question 3 of 10

Question 4 of 10

4. Which of the following is not a variant of BLAST?

TBLASTNX

BLASTP

BLASTN

BLASTX

Question 4 of 10

Question 5 of 10

5. Which of the following is incorrect the ‘word’ method?

Two related sequences must have at zero word in common while assuming

The basic assumption is that two related sequences must have at least one word in common

Both BLAST and FASTA use a heuristic word method

Word method is used for fast pairwise sequence alignment in BLAST and FASTA

Question 5 of 10

Question 6 of 10

6. The peptide formation involves two amino acids covalently joined together between the carboxyl group of one amino acid and the amino group of another.

False

True

Question 6 of 10

Question 7 of 10

7. Which of the following is not correct about the X-ray Crystallography?

The x-rays are deflected by the electron clouds surrounding the atoms in the crystal producing a regular pattern of diffraction

The protein crystals are illuminated with an intense x-ray beam

In x-ray protein crystallography, proteins need to be grown into large crystals in which their positions are fixed in a repeated, ordered fashion

The protein crystals are illuminated with an intense infrared beam

Question 7 of 10

Question 8 of 10

8. If a good sampling of sequences is _______ the number of sequences is _________ and the motif structure is ________ it should, in principle, be possible to obtain frequencies highly representative of the same motif in other sequences also.

unavailable, sufficiently large, not too complex

available, sufficiently large, not too complex

unavailable, sufficiently small, not too complex

available, sufficiently large, too complex

Question 8 of 10

Question 9 of 10

9. Score can be negative in Smith–Waterman algorithm.

True

False

Question 9 of 10

Question 10 of 10

10. Analysis of s for conserved blocks of sequence leads to production of the position-specific scoring matrix.

False

True

Question 10 of 10