BLAST tool - Bioinformatics

BLAST tool - Bioinformatics

University

10 Qs

quiz-placeholder

Similar activities

Quiz 02 USBO403

Quiz 02 USBO403

University

9 Qs

Intro to Genomics

Intro to Genomics

University

12 Qs

Bioinformatics

Bioinformatics

University

10 Qs

What do you already know about bioinformatics?

What do you already know about bioinformatics?

University - Professional Development

10 Qs

Tutorial 38

Tutorial 38

University

9 Qs

PostTest Day 2: Workshop Genetik

PostTest Day 2: Workshop Genetik

University

11 Qs

Ncbi Blast

Ncbi Blast

University

10 Qs

Blastn

Blastn

University

15 Qs

BLAST tool - Bioinformatics

BLAST tool - Bioinformatics

Assessment

Quiz

Biology, Science, Computers

University

Hard

Created by

R Renuka

Used 63+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statements is not correct with respect to BLAST algorithm?

We should mask low complexity regions to speedup BLAST

We should build indices for seed words in advance to speedup BLAST

We should use fixed seed words inorder to speedup BLAST

We should use shorter seed words inorder to speedup BLAST

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statements is not correct with respect to BLAST algorithm?

We should mask low complexity regions to speedup BLAST

We should use dynamic programming at the first stage to speedup BLAST

We should build indices for seed words in advance to speedup BLAST

We should use longer seed words inorder to speedup BLAST

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

BLAST uses dynamic programming in the last step to produce gapped alignment

TRUE

FALSE

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Why does BLAST use dynamic programming to realign the sequence after extending the hit cluster?

To find optimum alignment of query around hit cluster

To calculate directly the p-value probability that this alignment is by random chance

There is no reason, and this step is optional

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A= Compares an amino acid query sequence against a protein sequence database

B= Compares a nucleotide query sequence against a nucleotide sequence database

A= BLASTN B=BLASTP

A=BLASTP, B=BLASTN

A= BLASTX B=BLASTN

A=TBLASTN B=BLASTX

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Compares a protein query sequence against a nucleotide sequence database dynamically translated in all reading frames

BLASTX

BLASTP

TBLASTN

TBLASTX

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The BLAST program was developed in _______

a) 1992

b) 1995

c) 1990

d) 1991

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?