Bioinformatics Lecture 3 Flashcards

1
Q

synonymous mutation

A

same amino acid

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

non-synonymous mutation

A

missense and nonsense mutations

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

missense mutation

A

different amino acid

lead to different amino acid

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

nonsense mutation

A

replaced by stop codon

often produces non-functioning protein

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

homology

A

a sequence or species shares the same ancestor

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

MSA

A

multiple sequence alignment
shows conserved and less conserved regions
conserved proteins are likely to be functional

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

Protein sequence alignment

A

how closely are proteins related

how homologous

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

alignment scoring

A

matches and mismatches with substitution matrix

in the end gap penalty is subtracted

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

global pairwise sequence alignment

A

an algorithm
takes substitution matrix
traces back steps
gives perfect alignmnet

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

three possible roads

A

high
low
middle road

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

algorithmic complexity

A

how many steps you need

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

Needleman Wunsch

A

global pair wise alignment

comparing two whole sequences

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

Smith Waterman

A

local pair wise alignment
comparing only some parts
theory driven
gap at sequence ends are not punished

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

Henikoff and Henikoff

A
1992
first BLOSUM score
takes amino acid frequency into account
positive: preferred substitution
negative: avoided substitution
zero: random
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

BLOSUM n

A

always integer
made from n% sequence alignment
in practice: most often 62%

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

BLAST step 1

A

determine query words
find matches with atabase
find alignment scores of at least 8

17
Q

BLAST step 2

A

find near-exact matches

using the words we already have

18
Q

gapped BLAST

A

faster

19
Q

scoring e value

A

the smaller the better
the expected number of non-homologous sequences with score greater than x in database with size n
i.e. likelihood of finding something randomly

20
Q

bit score

A

required size of database to be sure the match is not by chance
the higher the more similar the sequences are