Bioinformatics Mock Test 1

10%

Question 1 of 10

1. Which of the following is not a site on internet for alignment of sequence pairs?

BLASTN

SIM

BLASTX

BCM Search Launcher

Question 1 of 10

Question 2 of 10

2. Which of the following is wrong in case of substitution matrices?

BLOSUM-X type uses logarithmic identity to find similarity

They use system where substitutions that are less likely should get a lower score

They determine likelihood of homology between two sequences

They use system where substitutions that are more likely should get a higher score

Question 2 of 10

Question 3 of 10

3. Which of the following statements about SUPERFAMILY database is incorrect regarding its features?

It searches the database using a superfamily, family, or species name plus a sequence, SCOP, PDB or HMM ID's

Sequences must be submitted in FASTA format only

Sequences can be submitted raw or FASTA format

It has generated GO annotations for evolutionarily closed domains and distant domains

Question 3 of 10

Question 4 of 10

4. While scanning for similarities in motifs, how regular expressions’ techniques work?

Matrix analysis methods are used in this type

Dot matrix analysis is used in this type of sequence analysis

An algorithm similar to dynamic programming is used

It represents a sequence family by a string of characters and further compares them

Question 4 of 10

Question 5 of 10

5. Which of the following is untrue about Expectation Maximization (EM) method?

The log odds scores of the PSSM are modified at the end of the process

The trial PSSM is used to compare with each sequence individually

It is used to find hidden motifs

The method works by first making a random or guessed alignment of the sequences to generate a trial PSSM

Question 5 of 10

Question 6 of 10

6. Which of the following is not a disadvantage of Needleman-Wunsch algorithm?

This cannot be applied on genome sized sequences

This method is comparatively slow

There is a need of intensive memory

This method can be applied to even large sized sequences

Question 6 of 10

Question 7 of 10

7. 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 7 of 10

Question 8 of 10

8. Which of the following does not describe local alignment algorithm?

First row and first column are set to 0 in initialization step

Negative score is set to 0

In traceback step, beginning is with the highest score, it ends when 0 is encountered

Score can be negative

Question 8 of 10

Question 9 of 10

9. Which of the following is true regarding the assumptions in the method of constructing the Dayhoff scoring matrix?

it is assumed that each amino acid position is equally mutable

it is assumed that each amino acid position is not mutable at all

sites do not vary in their degree of mutability

it is assumed that each amino acid position is not equally mutable

Question 9 of 10

Question 10 of 10

10. Pfam is available at four locations around the world. Which of the following is not one of them?

Sweden

Japan

Question 10 of 10