BLAST Flashcards

1
Q

What does BLAST mean

A

basic local alignment search tool

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Who developed BLAST?

A

Altschul and colleagues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

algorithm for rapid searching of nucleotide and protein databases

A

BLAST

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

employs a heuristic method of pairwise comparison

A

BLAST

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

algorithm that estimates the best solution without considering every possible outcome

A

heuristic method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

does not guarantee to find best solutions but finds good solutions

A

heuristic method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

has high speed and is time efficient

A

heuristic method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

homologous sequence are likely to contain a short, high-scoring similarity region

A

BLAST Strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

short, high-scoring similarity region

A

word or hit (W)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

designed to find local regions of similarity but can be expected to run about two orders of magnitude faster than the Smith-Waterman algorithm

A

BLAST

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

sequence that is subject to comparison

A

Query

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

sequences showing similarity with the query sequence

A

subject (or target)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What are different BLAST programs

A

blastn
blastp
blastx
tblastn
tblastx

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

searches a nucleotide database using a nucleotide query

A

blastn

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

searches a protein database using a protein query

A

blastp

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

searches a protein database using a translated nucleotide query

16
Q

searches a translated nucleotide database using a protein query

17
Q

searches a translated nucleotide database using a translated nucleotide query

18
Q

if BLAST found a similar sequence, we must have an idea:

A

whether alignment is good
whether it portrays possible biological relationship
whether the similarity observed is attributable to chance alone

19
Q

uses statistical theory to produce a bit score and e-value

20
Q

gives an indication of how good the alignment is

21
Q

In Bit score, the higher the score, _

A

the better

22
Q

key element in the calculation of bit score

A

substitution matrix

23
Q

bit score for the aligned region with the highest score

24
Q

adds the bit scores for all aligned regions

A

Total score

25
Q

gives an indication fo the statistical significance of a given pairwise alignment and reflects the size of the database and the scoring system used

A

Expected value

26
Q

the lower the E-value, the _ is the hit

A

more significant

27
Q

determine the beginning and end positioning of genes in a genome

A

gene prediction problem

28
Q

determines the sequence of amino acids in a protein

A

sequence of codons

29
Q

What is the paradox of genome

A

Genome size of many eukaryotes does not correspond to genetic complexity

30
Q

When was the discovery of split genes through experiments with mRNA of hexon, a viral proteins

31
Q

When was it discovered that the sequence of codons in a gene determines the sequence of amino acids in a protein

32
Q

True or False: the genome of many eukaryotes contain only relatively few genes

33
Q

Problems in Gene Prediction

A

genome has relatively few genes
many false splice
short exons
long introns
alternative splicing