Bioinformatics

Bioinformatics

University

10 Qs

quiz-placeholder

Similar activities

Test diagnóstico Bioinformática

Test diagnóstico Bioinformática

University

9 Qs

Translation

Translation

10th Grade - University

15 Qs

Comp Mol bio Unit -2

Comp Mol bio Unit -2

University

10 Qs

Basic bioinformatics

Basic bioinformatics

University

10 Qs

Database searching

Database searching

University

8 Qs

MLB大亂鬥

MLB大亂鬥

University

10 Qs

First Session Proteomics Quizz

First Session Proteomics Quizz

University

5 Qs

Suffixes Musculoskeletal

Suffixes Musculoskeletal

University

8 Qs

Bioinformatics

Bioinformatics

Assessment

Quiz

Biology

University

Hard

Created by

Charles Martinez

Used 3+ 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?